./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-218.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:43,148 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:43,250 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f7433f8-fa87-4e3c-813c-6e6fada3b495/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:43,256 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:43,257 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:43,292 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:43,295 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:43,295 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:43,297 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:43,297 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:43,298 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:43,299 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:43,299 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:43,299 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:43,299 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:43,299 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:43,299 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:43,300 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:43,300 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:43,300 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:43,300 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:43,301 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:43,301 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:43,301 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:43,301 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:43,302 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:43,302 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:43,633 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:43,643 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:43,645 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:43,646 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:43,647 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:43,648 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f7433f8-fa87-4e3c-813c-6e6fada3b495/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-218.smt2
[2025-04-28 21:21:43,650 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:43,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:44,693 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f7433f8-fa87-4e3c-813c-6e6fada3b495/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-218.smt2
[2025-04-28 21:21:44,697 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:44,699 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:44,701 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:44,702 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:44,702 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:44,706 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,774 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44 Unit
[2025-04-28 21:21:44,774 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:44,775 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:44,775 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:44,776 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:44,797 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,797 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,856 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,856 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,895 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,900 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,904 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,910 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,913 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,945 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:44,946 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:44,946 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:44,947 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:44,948 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (1/1) ...
[2025-04-28 21:21:44,954 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:44,975 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:44,995 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:45,001 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:45,015 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:45,015 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:45,015 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:45,015 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main495 given in one single declaration
[2025-04-28 21:21:45,015 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main495
[2025-04-28 21:21:45,015 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main495
[2025-04-28 21:21:45,016 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main446 given in one single declaration
[2025-04-28 21:21:45,016 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main446
[2025-04-28 21:21:45,016 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main446
[2025-04-28 21:21:45,016 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main118 given in one single declaration
[2025-04-28 21:21:45,016 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main118
[2025-04-28 21:21:45,016 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main118
[2025-04-28 21:21:45,016 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main107 given in one single declaration
[2025-04-28 21:21:45,016 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main107
[2025-04-28 21:21:45,019 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main107
[2025-04-28 21:21:45,019 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main4 given in one single declaration
[2025-04-28 21:21:45,019 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main4
[2025-04-28 21:21:45,019 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main4
[2025-04-28 21:21:45,019 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main199 given in one single declaration
[2025-04-28 21:21:45,019 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main199
[2025-04-28 21:21:45,019 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main199
[2025-04-28 21:21:45,019 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main255 given in one single declaration
[2025-04-28 21:21:45,020 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main255
[2025-04-28 21:21:45,020 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main255
[2025-04-28 21:21:45,020 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main272 given in one single declaration
[2025-04-28 21:21:45,020 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main272
[2025-04-28 21:21:45,020 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main272
[2025-04-28 21:21:45,020 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main269 given in one single declaration
[2025-04-28 21:21:45,020 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main269
[2025-04-28 21:21:45,020 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main269
[2025-04-28 21:21:45,020 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main336 given in one single declaration
[2025-04-28 21:21:45,020 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main336
[2025-04-28 21:21:45,020 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main336
[2025-04-28 21:21:45,020 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main330 given in one single declaration
[2025-04-28 21:21:45,020 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main330
[2025-04-28 21:21:45,020 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main330
[2025-04-28 21:21:45,021 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main300 given in one single declaration
[2025-04-28 21:21:45,021 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main300
[2025-04-28 21:21:45,021 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main300
[2025-04-28 21:21:45,021 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv_main478 given in one single declaration
[2025-04-28 21:21:45,021 INFO  L130     BoogieDeclarations]: Found specification of procedure inv_main478
[2025-04-28 21:21:45,021 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv_main478
[2025-04-28 21:21:45,021 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:45,021 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:45,021 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:45,350 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:45,353 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:46,691 INFO  L?                        ?]: Removed 143 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:46,692 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:46,713 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:46,713 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:46,714 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:46 BoogieIcfgContainer
[2025-04-28 21:21:46,716 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:46,719 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:46,721 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:46,725 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:46,725 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:44" (1/3) ...
[2025-04-28 21:21:46,726 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39405e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:46, skipping insertion in model container
[2025-04-28 21:21:46,726 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:44" (2/3) ...
[2025-04-28 21:21:46,726 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39405e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:46, skipping insertion in model container
[2025-04-28 21:21:46,726 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:46" (3/3) ...
[2025-04-28 21:21:46,728 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:46,748 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:46,752 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 15 procedures, 126 locations, 340 edges, 15 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:46,810 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:46,833 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49ba3285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:46,834 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:46,838 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 126 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 97 states have internal predecessors, (97), 81 states have call successors, (81), 14 states have call predecessors, (81), 14 states have return successors, (81), 14 states have call predecessors, (81), 81 states have call successors, (81)
[2025-04-28 21:21:46,873 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:46,874 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:46,874 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:46,875 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:46,880 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:46,881 INFO  L85        PathProgramCache]: Analyzing trace with hash 289678401, now seen corresponding path program 1 times
[2025-04-28 21:21:46,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:46,891 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370770261]
[2025-04-28 21:21:46,892 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:46,892 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:46,955 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:47,053 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:47,053 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,054 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:47,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,565 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370770261]
[2025-04-28 21:21:47,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370770261] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:47,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:47,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:47,574 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190454217]
[2025-04-28 21:21:47,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:47,579 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:47,582 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:47,616 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:47,617 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:47,620 INFO  L87              Difference]: Start difference. First operand  has 126 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 97 states have internal predecessors, (97), 81 states have call successors, (81), 14 states have call predecessors, (81), 14 states have return successors, (81), 14 states have call predecessors, (81), 81 states have call successors, (81) Second operand  has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:48,674 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:48,677 INFO  L93              Difference]: Finished difference Result 121 states and 280 transitions.
[2025-04-28 21:21:48,678 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:48,680 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:48,680 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:48,696 INFO  L225             Difference]: With dead ends: 121
[2025-04-28 21:21:48,696 INFO  L226             Difference]: Without dead ends: 121
[2025-04-28 21:21:48,699 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:48,703 INFO  L437           NwaCegarLoop]: 190 mSDtfsCounter, 1 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:48,704 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 895 Invalid, 277 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-04-28 21:21:48,723 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2025-04-28 21:21:48,802 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121.
[2025-04-28 21:21:48,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 121 states, 30 states have (on average 3.0) internal successors, (90), 90 states have internal predecessors, (90), 74 states have call successors, (74), 14 states have call predecessors, (74), 16 states have return successors, (116), 16 states have call predecessors, (116), 74 states have call successors, (116)
[2025-04-28 21:21:48,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 280 transitions.
[2025-04-28 21:21:48,815 INFO  L79                 Accepts]: Start accepts. Automaton has 121 states and 280 transitions. Word has length 24
[2025-04-28 21:21:48,818 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:48,818 INFO  L485      AbstractCegarLoop]: Abstraction has 121 states and 280 transitions.
[2025-04-28 21:21:48,818 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:48,818 INFO  L278                IsEmpty]: Start isEmpty. Operand 121 states and 280 transitions.
[2025-04-28 21:21:48,831 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:48,833 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:48,833 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:48,833 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:48,833 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:48,834 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:48,834 INFO  L85        PathProgramCache]: Analyzing trace with hash -1446296494, now seen corresponding path program 1 times
[2025-04-28 21:21:48,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:48,835 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063625474]
[2025-04-28 21:21:48,835 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:48,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:48,873 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:48,916 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:48,916 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,916 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:49,175 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:49,176 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063625474]
[2025-04-28 21:21:49,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063625474] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:49,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:49,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:49,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514418815]
[2025-04-28 21:21:49,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,177 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:49,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,178 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:49,178 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:49,179 INFO  L87              Difference]: Start difference. First operand 121 states and 280 transitions. Second operand  has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:50,057 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,058 INFO  L93              Difference]: Finished difference Result 125 states and 324 transitions.
[2025-04-28 21:21:50,059 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:50,059 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 32
[2025-04-28 21:21:50,060 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,065 INFO  L225             Difference]: With dead ends: 125
[2025-04-28 21:21:50,066 INFO  L226             Difference]: Without dead ends: 125
[2025-04-28 21:21:50,066 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:50,067 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:50,067 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 838 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-04-28 21:21:50,068 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2025-04-28 21:21:50,108 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125.
[2025-04-28 21:21:50,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 32 states have (on average 2.875) internal successors, (92), 92 states have internal predecessors, (92), 74 states have call successors, (74), 14 states have call predecessors, (74), 18 states have return successors, (158), 18 states have call predecessors, (158), 74 states have call successors, (158)
[2025-04-28 21:21:50,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 324 transitions.
[2025-04-28 21:21:50,118 INFO  L79                 Accepts]: Start accepts. Automaton has 125 states and 324 transitions. Word has length 32
[2025-04-28 21:21:50,119 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,119 INFO  L485      AbstractCegarLoop]: Abstraction has 125 states and 324 transitions.
[2025-04-28 21:21:50,119 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:50,119 INFO  L278                IsEmpty]: Start isEmpty. Operand 125 states and 324 transitions.
[2025-04-28 21:21:50,127 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:50,127 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,128 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,128 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:50,128 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,128 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,129 INFO  L85        PathProgramCache]: Analyzing trace with hash 691696006, now seen corresponding path program 1 times
[2025-04-28 21:21:50,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,129 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603208449]
[2025-04-28 21:21:50,129 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,154 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:50,177 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:50,177 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,177 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:50,387 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:50,387 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603208449]
[2025-04-28 21:21:50,387 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603208449] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:50,387 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:50,387 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:50,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121708190]
[2025-04-28 21:21:50,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,389 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:50,389 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,390 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:50,390 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:50,390 INFO  L87              Difference]: Start difference. First operand 125 states and 324 transitions. Second operand  has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:51,044 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,047 INFO  L93              Difference]: Finished difference Result 129 states and 307 transitions.
[2025-04-28 21:21:51,047 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:51,048 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 32
[2025-04-28 21:21:51,048 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,051 INFO  L225             Difference]: With dead ends: 129
[2025-04-28 21:21:51,051 INFO  L226             Difference]: Without dead ends: 129
[2025-04-28 21:21:51,054 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:51,056 INFO  L437           NwaCegarLoop]: 221 mSDtfsCounter, 1 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,057 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 773 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:51,058 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2025-04-28 21:21:51,090 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125.
[2025-04-28 21:21:51,091 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 32 states have (on average 2.875) internal successors, (92), 92 states have internal predecessors, (92), 74 states have call successors, (74), 14 states have call predecessors, (74), 18 states have return successors, (131), 18 states have call predecessors, (131), 74 states have call successors, (131)
[2025-04-28 21:21:51,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 297 transitions.
[2025-04-28 21:21:51,094 INFO  L79                 Accepts]: Start accepts. Automaton has 125 states and 297 transitions. Word has length 32
[2025-04-28 21:21:51,094 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,094 INFO  L485      AbstractCegarLoop]: Abstraction has 125 states and 297 transitions.
[2025-04-28 21:21:51,095 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:51,095 INFO  L278                IsEmpty]: Start isEmpty. Operand 125 states and 297 transitions.
[2025-04-28 21:21:51,098 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2025-04-28 21:21:51,098 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,099 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:51,099 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:51,099 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,099 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,100 INFO  L85        PathProgramCache]: Analyzing trace with hash -1200226754, now seen corresponding path program 1 times
[2025-04-28 21:21:51,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,100 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210212842]
[2025-04-28 21:21:51,100 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,125 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-04-28 21:21:51,145 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:21:51,145 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,145 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:51,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,319 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210212842]
[2025-04-28 21:21:51,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210212842] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,320 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,320 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:51,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65445405]
[2025-04-28 21:21:51,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,320 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:51,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,321 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:51,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:51,322 INFO  L87              Difference]: Start difference. First operand 125 states and 297 transitions. Second operand  has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:52,059 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:52,059 INFO  L93              Difference]: Finished difference Result 129 states and 341 transitions.
[2025-04-28 21:21:52,060 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:52,060 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 36
[2025-04-28 21:21:52,060 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:52,063 INFO  L225             Difference]: With dead ends: 129
[2025-04-28 21:21:52,063 INFO  L226             Difference]: Without dead ends: 129
[2025-04-28 21:21:52,063 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:52,064 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:52,064 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 842 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:21:52,065 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2025-04-28 21:21:52,091 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125.
[2025-04-28 21:21:52,091 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 32 states have (on average 2.875) internal successors, (92), 92 states have internal predecessors, (92), 74 states have call successors, (74), 14 states have call predecessors, (74), 18 states have return successors, (131), 18 states have call predecessors, (131), 74 states have call successors, (131)
[2025-04-28 21:21:52,093 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 297 transitions.
[2025-04-28 21:21:52,094 INFO  L79                 Accepts]: Start accepts. Automaton has 125 states and 297 transitions. Word has length 36
[2025-04-28 21:21:52,094 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:52,094 INFO  L485      AbstractCegarLoop]: Abstraction has 125 states and 297 transitions.
[2025-04-28 21:21:52,094 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:52,094 INFO  L278                IsEmpty]: Start isEmpty. Operand 125 states and 297 transitions.
[2025-04-28 21:21:52,098 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2025-04-28 21:21:52,098 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:52,098 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:52,099 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:52,099 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:52,099 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:52,099 INFO  L85        PathProgramCache]: Analyzing trace with hash 73665747, now seen corresponding path program 1 times
[2025-04-28 21:21:52,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:52,100 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701331682]
[2025-04-28 21:21:52,100 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:52,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:52,135 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-04-28 21:21:52,159 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:21:52,160 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:52,160 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:52,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:52,299 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701331682]
[2025-04-28 21:21:52,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701331682] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:52,300 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:52,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:52,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911230808]
[2025-04-28 21:21:52,300 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:52,300 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:52,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:52,301 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:52,301 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:52,301 INFO  L87              Difference]: Start difference. First operand 125 states and 297 transitions. Second operand  has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:53,041 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:53,041 INFO  L93              Difference]: Finished difference Result 129 states and 341 transitions.
[2025-04-28 21:21:53,042 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:53,042 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 36
[2025-04-28 21:21:53,042 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:53,045 INFO  L225             Difference]: With dead ends: 129
[2025-04-28 21:21:53,045 INFO  L226             Difference]: Without dead ends: 129
[2025-04-28 21:21:53,045 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:53,046 INFO  L437           NwaCegarLoop]: 203 mSDtfsCounter, 1 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:53,046 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 717 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:21:53,049 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2025-04-28 21:21:53,085 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125.
[2025-04-28 21:21:53,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 32 states have (on average 2.875) internal successors, (92), 92 states have internal predecessors, (92), 74 states have call successors, (74), 14 states have call predecessors, (74), 18 states have return successors, (131), 18 states have call predecessors, (131), 74 states have call successors, (131)
[2025-04-28 21:21:53,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 297 transitions.
[2025-04-28 21:21:53,092 INFO  L79                 Accepts]: Start accepts. Automaton has 125 states and 297 transitions. Word has length 36
[2025-04-28 21:21:53,094 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:53,094 INFO  L485      AbstractCegarLoop]: Abstraction has 125 states and 297 transitions.
[2025-04-28 21:21:53,094 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:53,094 INFO  L278                IsEmpty]: Start isEmpty. Operand 125 states and 297 transitions.
[2025-04-28 21:21:53,100 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2025-04-28 21:21:53,100 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:53,101 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:53,101 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:53,102 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:53,103 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:53,103 INFO  L85        PathProgramCache]: Analyzing trace with hash 81628504, now seen corresponding path program 1 times
[2025-04-28 21:21:53,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:53,103 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476319444]
[2025-04-28 21:21:53,103 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:53,103 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:53,129 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-04-28 21:21:53,145 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:21:53,145 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:53,145 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:53,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:53,294 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476319444]
[2025-04-28 21:21:53,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476319444] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:53,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:53,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:53,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599624042]
[2025-04-28 21:21:53,295 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:53,295 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:53,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:53,295 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:53,296 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:53,296 INFO  L87              Difference]: Start difference. First operand 125 states and 297 transitions. Second operand  has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:53,976 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:53,976 INFO  L93              Difference]: Finished difference Result 129 states and 341 transitions.
[2025-04-28 21:21:53,976 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:53,977 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 36
[2025-04-28 21:21:53,977 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:53,979 INFO  L225             Difference]: With dead ends: 129
[2025-04-28 21:21:53,979 INFO  L226             Difference]: Without dead ends: 129
[2025-04-28 21:21:53,979 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:53,981 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:53,982 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 841 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:21:53,983 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2025-04-28 21:21:54,000 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125.
[2025-04-28 21:21:54,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 32 states have (on average 2.875) internal successors, (92), 92 states have internal predecessors, (92), 74 states have call successors, (74), 14 states have call predecessors, (74), 18 states have return successors, (131), 18 states have call predecessors, (131), 74 states have call successors, (131)
[2025-04-28 21:21:54,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 297 transitions.
[2025-04-28 21:21:54,004 INFO  L79                 Accepts]: Start accepts. Automaton has 125 states and 297 transitions. Word has length 36
[2025-04-28 21:21:54,004 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:54,005 INFO  L485      AbstractCegarLoop]: Abstraction has 125 states and 297 transitions.
[2025-04-28 21:21:54,005 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:54,006 INFO  L278                IsEmpty]: Start isEmpty. Operand 125 states and 297 transitions.
[2025-04-28 21:21:54,010 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:54,010 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:54,011 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:54,011 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:21:54,011 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:54,011 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:54,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 559175459, now seen corresponding path program 1 times
[2025-04-28 21:21:54,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:54,012 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360817976]
[2025-04-28 21:21:54,012 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:54,039 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:54,055 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:54,056 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:54,056 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:54,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:54,254 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360817976]
[2025-04-28 21:21:54,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360817976] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:54,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:54,255 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:54,255 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54172969]
[2025-04-28 21:21:54,255 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:54,255 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:54,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:54,256 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:54,256 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:54,256 INFO  L87              Difference]: Start difference. First operand 125 states and 297 transitions. Second operand  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:54,944 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:54,944 INFO  L93              Difference]: Finished difference Result 133 states and 384 transitions.
[2025-04-28 21:21:54,944 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:54,945 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 40
[2025-04-28 21:21:54,945 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:54,947 INFO  L225             Difference]: With dead ends: 133
[2025-04-28 21:21:54,947 INFO  L226             Difference]: Without dead ends: 133
[2025-04-28 21:21:54,947 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:54,948 INFO  L437           NwaCegarLoop]: 200 mSDtfsCounter, 1 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:54,948 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 907 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:21:54,949 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-04-28 21:21:54,969 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129.
[2025-04-28 21:21:54,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 34 states have (on average 2.764705882352941) internal successors, (94), 94 states have internal predecessors, (94), 74 states have call successors, (74), 14 states have call predecessors, (74), 20 states have return successors, (138), 20 states have call predecessors, (138), 74 states have call successors, (138)
[2025-04-28 21:21:54,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 306 transitions.
[2025-04-28 21:21:54,971 INFO  L79                 Accepts]: Start accepts. Automaton has 129 states and 306 transitions. Word has length 40
[2025-04-28 21:21:54,972 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:54,972 INFO  L485      AbstractCegarLoop]: Abstraction has 129 states and 306 transitions.
[2025-04-28 21:21:54,972 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:54,972 INFO  L278                IsEmpty]: Start isEmpty. Operand 129 states and 306 transitions.
[2025-04-28 21:21:54,975 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:54,976 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:54,976 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:54,976 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-04-28 21:21:54,976 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:54,976 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:54,977 INFO  L85        PathProgramCache]: Analyzing trace with hash 768305703, now seen corresponding path program 1 times
[2025-04-28 21:21:54,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:54,977 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682221613]
[2025-04-28 21:21:54,977 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:55,007 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:55,025 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:55,025 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,025 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:55,170 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:55,170 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682221613]
[2025-04-28 21:21:55,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682221613] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:55,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:55,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:55,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201038922]
[2025-04-28 21:21:55,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:55,171 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:55,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:55,171 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:55,171 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:55,172 INFO  L87              Difference]: Start difference. First operand 129 states and 306 transitions. Second operand  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:55,872 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:55,872 INFO  L93              Difference]: Finished difference Result 137 states and 393 transitions.
[2025-04-28 21:21:55,873 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:55,873 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 40
[2025-04-28 21:21:55,873 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:55,875 INFO  L225             Difference]: With dead ends: 137
[2025-04-28 21:21:55,875 INFO  L226             Difference]: Without dead ends: 137
[2025-04-28 21:21:55,876 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:55,876 INFO  L437           NwaCegarLoop]: 236 mSDtfsCounter, 1 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:55,876 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1078 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:21:55,877 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 137 states.
[2025-04-28 21:21:55,897 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129.
[2025-04-28 21:21:55,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 34 states have (on average 2.764705882352941) internal successors, (94), 94 states have internal predecessors, (94), 74 states have call successors, (74), 14 states have call predecessors, (74), 20 states have return successors, (138), 20 states have call predecessors, (138), 74 states have call successors, (138)
[2025-04-28 21:21:55,899 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 306 transitions.
[2025-04-28 21:21:55,899 INFO  L79                 Accepts]: Start accepts. Automaton has 129 states and 306 transitions. Word has length 40
[2025-04-28 21:21:55,899 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:55,899 INFO  L485      AbstractCegarLoop]: Abstraction has 129 states and 306 transitions.
[2025-04-28 21:21:55,899 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:55,900 INFO  L278                IsEmpty]: Start isEmpty. Operand 129 states and 306 transitions.
[2025-04-28 21:21:55,903 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:55,903 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:55,903 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:55,903 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:55,903 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:55,904 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:55,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -1478877695, now seen corresponding path program 1 times
[2025-04-28 21:21:55,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:55,904 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995472381]
[2025-04-28 21:21:55,904 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:55,932 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:55,946 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:55,946 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,946 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:56,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:56,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:56,085 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995472381]
[2025-04-28 21:21:56,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995472381] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:56,085 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:56,085 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:56,085 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733563835]
[2025-04-28 21:21:56,085 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:56,085 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:56,085 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:56,086 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:56,086 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:56,086 INFO  L87              Difference]: Start difference. First operand 129 states and 306 transitions. Second operand  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:56,759 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:56,760 INFO  L93              Difference]: Finished difference Result 137 states and 393 transitions.
[2025-04-28 21:21:56,760 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:56,760 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 40
[2025-04-28 21:21:56,761 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:56,763 INFO  L225             Difference]: With dead ends: 137
[2025-04-28 21:21:56,763 INFO  L226             Difference]: Without dead ends: 137
[2025-04-28 21:21:56,764 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:56,764 INFO  L437           NwaCegarLoop]: 236 mSDtfsCounter, 1 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:56,764 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1077 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:56,765 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 137 states.
[2025-04-28 21:21:56,783 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129.
[2025-04-28 21:21:56,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 34 states have (on average 2.764705882352941) internal successors, (94), 94 states have internal predecessors, (94), 74 states have call successors, (74), 14 states have call predecessors, (74), 20 states have return successors, (138), 20 states have call predecessors, (138), 74 states have call successors, (138)
[2025-04-28 21:21:56,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 306 transitions.
[2025-04-28 21:21:56,786 INFO  L79                 Accepts]: Start accepts. Automaton has 129 states and 306 transitions. Word has length 40
[2025-04-28 21:21:56,786 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:56,786 INFO  L485      AbstractCegarLoop]: Abstraction has 129 states and 306 transitions.
[2025-04-28 21:21:56,787 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:56,787 INFO  L278                IsEmpty]: Start isEmpty. Operand 129 states and 306 transitions.
[2025-04-28 21:21:56,790 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:56,790 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:56,790 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:56,791 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-04-28 21:21:56,791 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:56,791 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:56,791 INFO  L85        PathProgramCache]: Analyzing trace with hash -1160359804, now seen corresponding path program 1 times
[2025-04-28 21:21:56,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:56,791 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579053390]
[2025-04-28 21:21:56,791 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:56,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:56,814 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:56,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:56,826 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:56,826 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:56,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:56,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:56,935 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579053390]
[2025-04-28 21:21:56,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579053390] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:56,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:56,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:56,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820933807]
[2025-04-28 21:21:56,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:56,936 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:56,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:56,937 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:56,937 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:56,937 INFO  L87              Difference]: Start difference. First operand 129 states and 306 transitions. Second operand  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:57,556 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:57,556 INFO  L93              Difference]: Finished difference Result 133 states and 350 transitions.
[2025-04-28 21:21:57,556 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:57,557 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 40
[2025-04-28 21:21:57,557 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:57,559 INFO  L225             Difference]: With dead ends: 133
[2025-04-28 21:21:57,559 INFO  L226             Difference]: Without dead ends: 133
[2025-04-28 21:21:57,560 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:57,560 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:57,561 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 843 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:57,561 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-04-28 21:21:57,576 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129.
[2025-04-28 21:21:57,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 34 states have (on average 2.764705882352941) internal successors, (94), 94 states have internal predecessors, (94), 74 states have call successors, (74), 14 states have call predecessors, (74), 20 states have return successors, (138), 20 states have call predecessors, (138), 74 states have call successors, (138)
[2025-04-28 21:21:57,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 306 transitions.
[2025-04-28 21:21:57,578 INFO  L79                 Accepts]: Start accepts. Automaton has 129 states and 306 transitions. Word has length 40
[2025-04-28 21:21:57,579 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:57,579 INFO  L485      AbstractCegarLoop]: Abstraction has 129 states and 306 transitions.
[2025-04-28 21:21:57,579 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:57,579 INFO  L278                IsEmpty]: Start isEmpty. Operand 129 states and 306 transitions.
[2025-04-28 21:21:57,582 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:57,582 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:57,582 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:57,583 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-04-28 21:21:57,583 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:57,583 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:57,583 INFO  L85        PathProgramCache]: Analyzing trace with hash -325767744, now seen corresponding path program 1 times
[2025-04-28 21:21:57,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:57,584 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969672152]
[2025-04-28 21:21:57,584 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:57,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:57,610 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:57,622 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:57,622 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:57,622 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:57,714 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:57,714 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969672152]
[2025-04-28 21:21:57,715 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969672152] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:57,715 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:57,715 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:57,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073366428]
[2025-04-28 21:21:57,715 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:57,715 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:57,715 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:57,716 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:57,716 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:57,716 INFO  L87              Difference]: Start difference. First operand 129 states and 306 transitions. Second operand  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:58,437 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:58,437 INFO  L93              Difference]: Finished difference Result 133 states and 350 transitions.
[2025-04-28 21:21:58,438 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:58,438 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 40
[2025-04-28 21:21:58,438 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:58,441 INFO  L225             Difference]: With dead ends: 133
[2025-04-28 21:21:58,441 INFO  L226             Difference]: Without dead ends: 133
[2025-04-28 21:21:58,442 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:58,442 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:58,444 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 841 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:21:58,444 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-04-28 21:21:58,464 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129.
[2025-04-28 21:21:58,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 34 states have (on average 2.764705882352941) internal successors, (94), 94 states have internal predecessors, (94), 74 states have call successors, (74), 14 states have call predecessors, (74), 20 states have return successors, (138), 20 states have call predecessors, (138), 74 states have call successors, (138)
[2025-04-28 21:21:58,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 306 transitions.
[2025-04-28 21:21:58,470 INFO  L79                 Accepts]: Start accepts. Automaton has 129 states and 306 transitions. Word has length 40
[2025-04-28 21:21:58,471 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:58,471 INFO  L485      AbstractCegarLoop]: Abstraction has 129 states and 306 transitions.
[2025-04-28 21:21:58,471 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:58,472 INFO  L278                IsEmpty]: Start isEmpty. Operand 129 states and 306 transitions.
[2025-04-28 21:21:58,475 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:58,475 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:58,475 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:58,475 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-04-28 21:21:58,476 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:58,476 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:58,476 INFO  L85        PathProgramCache]: Analyzing trace with hash 1828963960, now seen corresponding path program 1 times
[2025-04-28 21:21:58,476 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:58,476 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484777834]
[2025-04-28 21:21:58,476 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:58,477 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:58,499 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:21:58,509 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:58,509 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:58,509 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:58,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:58,643 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484777834]
[2025-04-28 21:21:58,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484777834] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:58,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:58,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:58,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684044253]
[2025-04-28 21:21:58,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:58,644 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:58,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:58,644 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:58,644 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:58,645 INFO  L87              Difference]: Start difference. First operand 129 states and 306 transitions. Second operand  has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:59,789 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:59,789 INFO  L93              Difference]: Finished difference Result 200 states and 594 transitions.
[2025-04-28 21:21:59,790 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:59,790 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10) Word has length 40
[2025-04-28 21:21:59,792 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:59,801 INFO  L225             Difference]: With dead ends: 200
[2025-04-28 21:21:59,801 INFO  L226             Difference]: Without dead ends: 198
[2025-04-28 21:21:59,801 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:59,802 INFO  L437           NwaCegarLoop]: 338 mSDtfsCounter, 48 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:59,802 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1873 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-04-28 21:21:59,803 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2025-04-28 21:21:59,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196.
[2025-04-28 21:21:59,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 196 states, 46 states have (on average 3.3043478260869565) internal successors, (152), 149 states have internal predecessors, (152), 121 states have call successors, (121), 18 states have call predecessors, (121), 28 states have return successors, (313), 28 states have call predecessors, (313), 121 states have call successors, (313)
[2025-04-28 21:21:59,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 586 transitions.
[2025-04-28 21:21:59,888 INFO  L79                 Accepts]: Start accepts. Automaton has 196 states and 586 transitions. Word has length 40
[2025-04-28 21:21:59,889 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:59,889 INFO  L485      AbstractCegarLoop]: Abstraction has 196 states and 586 transitions.
[2025-04-28 21:21:59,889 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:21:59,889 INFO  L278                IsEmpty]: Start isEmpty. Operand 196 states and 586 transitions.
[2025-04-28 21:21:59,897 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:21:59,897 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:59,897 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:59,897 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-04-28 21:21:59,898 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:59,898 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:59,898 INFO  L85        PathProgramCache]: Analyzing trace with hash 1366640897, now seen corresponding path program 1 times
[2025-04-28 21:21:59,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:59,898 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78604196]
[2025-04-28 21:21:59,899 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:59,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:59,933 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:21:59,945 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:21:59,945 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:59,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:00,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:22:00,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:00,089 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78604196]
[2025-04-28 21:22:00,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78604196] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:00,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:00,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:22:00,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756820567]
[2025-04-28 21:22:00,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:00,089 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:22:00,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:00,090 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:22:00,090 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:00,091 INFO  L87              Difference]: Start difference. First operand 196 states and 586 transitions. Second operand  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:00,830 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:00,830 INFO  L93              Difference]: Finished difference Result 208 states and 710 transitions.
[2025-04-28 21:22:00,831 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:22:00,831 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:00,832 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:00,837 INFO  L225             Difference]: With dead ends: 208
[2025-04-28 21:22:00,837 INFO  L226             Difference]: Without dead ends: 208
[2025-04-28 21:22:00,837 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:00,838 INFO  L437           NwaCegarLoop]: 237 mSDtfsCounter, 1 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:00,838 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 851 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:22:00,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2025-04-28 21:22:00,906 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204.
[2025-04-28 21:22:00,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 204 states, 50 states have (on average 3.12) internal successors, (156), 153 states have internal predecessors, (156), 121 states have call successors, (121), 18 states have call predecessors, (121), 32 states have return successors, (428), 32 states have call predecessors, (428), 121 states have call successors, (428)
[2025-04-28 21:22:00,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 705 transitions.
[2025-04-28 21:22:00,912 INFO  L79                 Accepts]: Start accepts. Automaton has 204 states and 705 transitions. Word has length 44
[2025-04-28 21:22:00,913 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:00,913 INFO  L485      AbstractCegarLoop]: Abstraction has 204 states and 705 transitions.
[2025-04-28 21:22:00,913 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:00,913 INFO  L278                IsEmpty]: Start isEmpty. Operand 204 states and 705 transitions.
[2025-04-28 21:22:00,920 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:00,920 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:00,920 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:00,921 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-04-28 21:22:00,921 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:00,922 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:00,923 INFO  L85        PathProgramCache]: Analyzing trace with hash -211801814, now seen corresponding path program 1 times
[2025-04-28 21:22:00,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:00,923 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294672053]
[2025-04-28 21:22:00,923 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:00,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:00,950 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:00,963 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:00,963 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:00,963 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:01,065 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:22:01,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:01,067 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294672053]
[2025-04-28 21:22:01,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294672053] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:01,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:01,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:22:01,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141574012]
[2025-04-28 21:22:01,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:01,068 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:22:01,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:01,069 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:22:01,069 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:01,069 INFO  L87              Difference]: Start difference. First operand 204 states and 705 transitions. Second operand  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:01,627 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:01,628 INFO  L93              Difference]: Finished difference Result 216 states and 753 transitions.
[2025-04-28 21:22:01,631 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:22:01,632 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:01,632 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:01,637 INFO  L225             Difference]: With dead ends: 216
[2025-04-28 21:22:01,637 INFO  L226             Difference]: Without dead ends: 216
[2025-04-28 21:22:01,637 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:01,638 INFO  L437           NwaCegarLoop]: 239 mSDtfsCounter, 1 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:01,638 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 807 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:22:01,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 216 states.
[2025-04-28 21:22:01,687 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208.
[2025-04-28 21:22:01,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 208 states, 52 states have (on average 3.0384615384615383) internal successors, (158), 155 states have internal predecessors, (158), 121 states have call successors, (121), 18 states have call predecessors, (121), 34 states have return successors, (434), 34 states have call predecessors, (434), 121 states have call successors, (434)
[2025-04-28 21:22:01,691 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 713 transitions.
[2025-04-28 21:22:01,691 INFO  L79                 Accepts]: Start accepts. Automaton has 208 states and 713 transitions. Word has length 44
[2025-04-28 21:22:01,692 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:01,692 INFO  L485      AbstractCegarLoop]: Abstraction has 208 states and 713 transitions.
[2025-04-28 21:22:01,692 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:01,692 INFO  L278                IsEmpty]: Start isEmpty. Operand 208 states and 713 transitions.
[2025-04-28 21:22:01,697 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:01,697 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:01,698 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:01,698 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-04-28 21:22:01,698 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:01,698 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:01,698 INFO  L85        PathProgramCache]: Analyzing trace with hash 1057541211, now seen corresponding path program 1 times
[2025-04-28 21:22:01,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:01,699 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334140691]
[2025-04-28 21:22:01,699 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:01,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:01,720 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:01,729 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:01,729 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:01,729 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:01,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:22:01,827 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:01,827 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334140691]
[2025-04-28 21:22:01,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334140691] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:01,827 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:01,827 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:22:01,827 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555380621]
[2025-04-28 21:22:01,827 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:01,828 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:22:01,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:01,828 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:22:01,828 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:01,828 INFO  L87              Difference]: Start difference. First operand 208 states and 713 transitions. Second operand  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:02,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:02,437 INFO  L93              Difference]: Finished difference Result 216 states and 830 transitions.
[2025-04-28 21:22:02,440 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:22:02,440 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:02,440 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:02,445 INFO  L225             Difference]: With dead ends: 216
[2025-04-28 21:22:02,445 INFO  L226             Difference]: Without dead ends: 216
[2025-04-28 21:22:02,446 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:02,446 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:02,446 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 840 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:22:02,447 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 216 states.
[2025-04-28 21:22:02,515 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208.
[2025-04-28 21:22:02,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 208 states, 52 states have (on average 3.0384615384615383) internal successors, (158), 155 states have internal predecessors, (158), 121 states have call successors, (121), 18 states have call predecessors, (121), 34 states have return successors, (434), 34 states have call predecessors, (434), 121 states have call successors, (434)
[2025-04-28 21:22:02,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 713 transitions.
[2025-04-28 21:22:02,520 INFO  L79                 Accepts]: Start accepts. Automaton has 208 states and 713 transitions. Word has length 44
[2025-04-28 21:22:02,520 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:02,520 INFO  L485      AbstractCegarLoop]: Abstraction has 208 states and 713 transitions.
[2025-04-28 21:22:02,520 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:02,520 INFO  L278                IsEmpty]: Start isEmpty. Operand 208 states and 713 transitions.
[2025-04-28 21:22:02,526 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:02,527 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:02,527 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:02,527 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-04-28 21:22:02,527 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:02,528 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:02,528 INFO  L85        PathProgramCache]: Analyzing trace with hash -1004667007, now seen corresponding path program 1 times
[2025-04-28 21:22:02,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:02,529 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697993238]
[2025-04-28 21:22:02,529 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:02,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:02,554 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:02,564 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:02,564 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:02,565 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:02,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:22:02,655 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:02,655 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697993238]
[2025-04-28 21:22:02,656 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697993238] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:02,656 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:02,656 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:22:02,656 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807310577]
[2025-04-28 21:22:02,656 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:02,656 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:22:02,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:02,657 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:22:02,657 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:02,657 INFO  L87              Difference]: Start difference. First operand 208 states and 713 transitions. Second operand  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:03,304 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:03,305 INFO  L93              Difference]: Finished difference Result 216 states and 830 transitions.
[2025-04-28 21:22:03,305 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:22:03,305 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:03,306 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:03,311 INFO  L225             Difference]: With dead ends: 216
[2025-04-28 21:22:03,311 INFO  L226             Difference]: Without dead ends: 216
[2025-04-28 21:22:03,311 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:03,312 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:03,312 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 842 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:22:03,313 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 216 states.
[2025-04-28 21:22:03,383 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208.
[2025-04-28 21:22:03,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 208 states, 52 states have (on average 3.0384615384615383) internal successors, (158), 155 states have internal predecessors, (158), 121 states have call successors, (121), 18 states have call predecessors, (121), 34 states have return successors, (434), 34 states have call predecessors, (434), 121 states have call successors, (434)
[2025-04-28 21:22:03,387 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 713 transitions.
[2025-04-28 21:22:03,388 INFO  L79                 Accepts]: Start accepts. Automaton has 208 states and 713 transitions. Word has length 44
[2025-04-28 21:22:03,388 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:03,388 INFO  L485      AbstractCegarLoop]: Abstraction has 208 states and 713 transitions.
[2025-04-28 21:22:03,388 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:03,388 INFO  L278                IsEmpty]: Start isEmpty. Operand 208 states and 713 transitions.
[2025-04-28 21:22:03,394 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:03,394 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:03,394 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:03,394 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-04-28 21:22:03,395 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:03,395 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:03,395 INFO  L85        PathProgramCache]: Analyzing trace with hash 670246030, now seen corresponding path program 1 times
[2025-04-28 21:22:03,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:03,396 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722023805]
[2025-04-28 21:22:03,396 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:03,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:03,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:03,433 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:03,433 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:03,433 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:03,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:22:03,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:03,530 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722023805]
[2025-04-28 21:22:03,531 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722023805] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:03,532 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:03,532 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:22:03,532 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577875236]
[2025-04-28 21:22:03,532 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:03,532 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:22:03,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:03,533 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:22:03,533 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:03,533 INFO  L87              Difference]: Start difference. First operand 208 states and 713 transitions. Second operand  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:04,141 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:04,141 INFO  L93              Difference]: Finished difference Result 212 states and 716 transitions.
[2025-04-28 21:22:04,142 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:22:04,142 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:04,143 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:04,147 INFO  L225             Difference]: With dead ends: 212
[2025-04-28 21:22:04,147 INFO  L226             Difference]: Without dead ends: 212
[2025-04-28 21:22:04,148 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:04,148 INFO  L437           NwaCegarLoop]: 239 mSDtfsCounter, 1 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:04,148 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 858 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:22:04,149 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2025-04-28 21:22:04,192 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200.
[2025-04-28 21:22:04,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 200 states, 48 states have (on average 3.2083333333333335) internal successors, (154), 151 states have internal predecessors, (154), 121 states have call successors, (121), 18 states have call predecessors, (121), 30 states have return successors, (319), 30 states have call predecessors, (319), 121 states have call successors, (319)
[2025-04-28 21:22:04,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 594 transitions.
[2025-04-28 21:22:04,196 INFO  L79                 Accepts]: Start accepts. Automaton has 200 states and 594 transitions. Word has length 44
[2025-04-28 21:22:04,196 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:04,196 INFO  L485      AbstractCegarLoop]: Abstraction has 200 states and 594 transitions.
[2025-04-28 21:22:04,196 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:04,196 INFO  L278                IsEmpty]: Start isEmpty. Operand 200 states and 594 transitions.
[2025-04-28 21:22:04,201 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:04,202 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:04,202 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:04,202 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-04-28 21:22:04,202 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:04,202 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:04,202 INFO  L85        PathProgramCache]: Analyzing trace with hash 1151132383, now seen corresponding path program 1 times
[2025-04-28 21:22:04,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:04,203 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92595067]
[2025-04-28 21:22:04,203 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:04,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:04,226 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:04,236 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:04,236 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:04,236 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:04,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:22:04,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:04,341 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92595067]
[2025-04-28 21:22:04,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92595067] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:04,341 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:04,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:22:04,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925378503]
[2025-04-28 21:22:04,341 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:04,341 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:22:04,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:04,342 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:22:04,342 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:04,342 INFO  L87              Difference]: Start difference. First operand 200 states and 594 transitions. Second operand  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:04,942 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:04,942 INFO  L93              Difference]: Finished difference Result 212 states and 631 transitions.
[2025-04-28 21:22:04,942 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:22:04,943 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:04,943 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:04,946 INFO  L225             Difference]: With dead ends: 212
[2025-04-28 21:22:04,946 INFO  L226             Difference]: Without dead ends: 210
[2025-04-28 21:22:04,947 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:04,947 INFO  L437           NwaCegarLoop]: 234 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:04,947 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 790 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:22:04,948 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 210 states.
[2025-04-28 21:22:04,981 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 202.
[2025-04-28 21:22:04,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 202 states, 49 states have (on average 3.163265306122449) internal successors, (155), 152 states have internal predecessors, (155), 121 states have call successors, (121), 18 states have call predecessors, (121), 31 states have return successors, (321), 31 states have call predecessors, (321), 121 states have call successors, (321)
[2025-04-28 21:22:04,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 597 transitions.
[2025-04-28 21:22:04,985 INFO  L79                 Accepts]: Start accepts. Automaton has 202 states and 597 transitions. Word has length 44
[2025-04-28 21:22:04,985 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:04,985 INFO  L485      AbstractCegarLoop]: Abstraction has 202 states and 597 transitions.
[2025-04-28 21:22:04,985 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:04,985 INFO  L278                IsEmpty]: Start isEmpty. Operand 202 states and 597 transitions.
[2025-04-28 21:22:04,990 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:04,990 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:04,990 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:04,990 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-04-28 21:22:04,990 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:04,991 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:04,991 INFO  L85        PathProgramCache]: Analyzing trace with hash 1128730087, now seen corresponding path program 1 times
[2025-04-28 21:22:04,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:04,991 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506603951]
[2025-04-28 21:22:04,992 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:04,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:05,020 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:05,029 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:05,029 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:05,029 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:05,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:22:05,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:05,128 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506603951]
[2025-04-28 21:22:05,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506603951] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:05,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:05,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:22:05,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777819192]
[2025-04-28 21:22:05,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:05,128 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:22:05,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:05,129 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:22:05,129 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:22:05,130 INFO  L87              Difference]: Start difference. First operand 202 states and 597 transitions. Second operand  has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:05,855 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:05,855 INFO  L93              Difference]: Finished difference Result 218 states and 828 transitions.
[2025-04-28 21:22:05,855 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:22:05,856 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:05,856 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:05,860 INFO  L225             Difference]: With dead ends: 218
[2025-04-28 21:22:05,860 INFO  L226             Difference]: Without dead ends: 218
[2025-04-28 21:22:05,861 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:22:05,861 INFO  L437           NwaCegarLoop]: 236 mSDtfsCounter, 1 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:05,861 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1077 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:22:05,862 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2025-04-28 21:22:05,915 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 204.
[2025-04-28 21:22:05,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 204 states, 50 states have (on average 3.12) internal successors, (156), 153 states have internal predecessors, (156), 121 states have call successors, (121), 18 states have call predecessors, (121), 32 states have return successors, (329), 32 states have call predecessors, (329), 121 states have call successors, (329)
[2025-04-28 21:22:05,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 606 transitions.
[2025-04-28 21:22:05,919 INFO  L79                 Accepts]: Start accepts. Automaton has 204 states and 606 transitions. Word has length 44
[2025-04-28 21:22:05,919 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:05,919 INFO  L485      AbstractCegarLoop]: Abstraction has 204 states and 606 transitions.
[2025-04-28 21:22:05,920 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:05,920 INFO  L278                IsEmpty]: Start isEmpty. Operand 204 states and 606 transitions.
[2025-04-28 21:22:05,925 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:05,925 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:05,925 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:05,926 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-04-28 21:22:05,926 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:05,926 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:05,926 INFO  L85        PathProgramCache]: Analyzing trace with hash -915118360, now seen corresponding path program 1 times
[2025-04-28 21:22:05,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:05,926 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095804988]
[2025-04-28 21:22:05,927 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:05,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:05,953 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:05,962 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:05,963 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:05,963 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:06,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:22:06,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:06,066 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095804988]
[2025-04-28 21:22:06,066 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095804988] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:06,066 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:06,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:22:06,067 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259184259]
[2025-04-28 21:22:06,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:06,067 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:22:06,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:06,067 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:22:06,067 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:22:06,068 INFO  L87              Difference]: Start difference. First operand 204 states and 606 transitions. Second operand  has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:06,831 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:06,831 INFO  L93              Difference]: Finished difference Result 220 states and 754 transitions.
[2025-04-28 21:22:06,832 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:22:06,832 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:06,832 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:06,836 INFO  L225             Difference]: With dead ends: 220
[2025-04-28 21:22:06,836 INFO  L226             Difference]: Without dead ends: 220
[2025-04-28 21:22:06,836 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:22:06,838 INFO  L437           NwaCegarLoop]: 236 mSDtfsCounter, 1 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:06,838 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1079 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:22:06,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 220 states.
[2025-04-28 21:22:06,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210.
[2025-04-28 21:22:06,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 210 states, 53 states have (on average 3.0) internal successors, (159), 156 states have internal predecessors, (159), 121 states have call successors, (121), 18 states have call predecessors, (121), 35 states have return successors, (361), 35 states have call predecessors, (361), 121 states have call successors, (361)
[2025-04-28 21:22:06,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 641 transitions.
[2025-04-28 21:22:06,887 INFO  L79                 Accepts]: Start accepts. Automaton has 210 states and 641 transitions. Word has length 44
[2025-04-28 21:22:06,887 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:06,887 INFO  L485      AbstractCegarLoop]: Abstraction has 210 states and 641 transitions.
[2025-04-28 21:22:06,887 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:06,887 INFO  L278                IsEmpty]: Start isEmpty. Operand 210 states and 641 transitions.
[2025-04-28 21:22:06,891 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:06,892 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:06,892 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:06,892 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-04-28 21:22:06,892 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:06,893 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:06,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 1924413256, now seen corresponding path program 1 times
[2025-04-28 21:22:06,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:06,893 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926482537]
[2025-04-28 21:22:06,893 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:06,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:06,921 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:06,930 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:06,930 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:06,930 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:07,024 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:22:07,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:07,026 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926482537]
[2025-04-28 21:22:07,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926482537] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:07,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:07,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:22:07,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796952491]
[2025-04-28 21:22:07,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:07,026 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:22:07,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:07,027 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:22:07,027 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:22:07,027 INFO  L87              Difference]: Start difference. First operand 210 states and 641 transitions. Second operand  has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:07,797 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:07,798 INFO  L93              Difference]: Finished difference Result 226 states and 872 transitions.
[2025-04-28 21:22:07,798 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:22:07,798 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:07,799 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:07,803 INFO  L225             Difference]: With dead ends: 226
[2025-04-28 21:22:07,804 INFO  L226             Difference]: Without dead ends: 226
[2025-04-28 21:22:07,804 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:22:07,805 INFO  L437           NwaCegarLoop]: 236 mSDtfsCounter, 1 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:07,805 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1074 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:22:07,806 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2025-04-28 21:22:07,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 210.
[2025-04-28 21:22:07,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 210 states, 53 states have (on average 3.0) internal successors, (159), 156 states have internal predecessors, (159), 121 states have call successors, (121), 18 states have call predecessors, (121), 35 states have return successors, (361), 35 states have call predecessors, (361), 121 states have call successors, (361)
[2025-04-28 21:22:07,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 641 transitions.
[2025-04-28 21:22:07,873 INFO  L79                 Accepts]: Start accepts. Automaton has 210 states and 641 transitions. Word has length 44
[2025-04-28 21:22:07,873 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:07,873 INFO  L485      AbstractCegarLoop]: Abstraction has 210 states and 641 transitions.
[2025-04-28 21:22:07,873 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:07,873 INFO  L278                IsEmpty]: Start isEmpty. Operand 210 states and 641 transitions.
[2025-04-28 21:22:07,878 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:07,878 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:07,879 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:07,879 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-04-28 21:22:07,879 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:07,879 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:07,880 INFO  L85        PathProgramCache]: Analyzing trace with hash -1800685136, now seen corresponding path program 1 times
[2025-04-28 21:22:07,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:07,880 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270417489]
[2025-04-28 21:22:07,880 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:07,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:07,907 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:07,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:07,917 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:07,917 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:08,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:22:08,008 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:08,008 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270417489]
[2025-04-28 21:22:08,008 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270417489] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:08,008 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:08,008 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:22:08,008 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582360237]
[2025-04-28 21:22:08,008 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:08,009 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:22:08,009 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:08,009 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:22:08,009 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:08,010 INFO  L87              Difference]: Start difference. First operand 210 states and 641 transitions. Second operand  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:08,718 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:08,718 INFO  L93              Difference]: Finished difference Result 218 states and 758 transitions.
[2025-04-28 21:22:08,719 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:22:08,719 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:08,719 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:08,723 INFO  L225             Difference]: With dead ends: 218
[2025-04-28 21:22:08,723 INFO  L226             Difference]: Without dead ends: 218
[2025-04-28 21:22:08,723 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:08,725 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:08,725 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 842 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:22:08,726 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2025-04-28 21:22:08,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210.
[2025-04-28 21:22:08,785 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 210 states, 53 states have (on average 3.0) internal successors, (159), 156 states have internal predecessors, (159), 121 states have call successors, (121), 18 states have call predecessors, (121), 35 states have return successors, (361), 35 states have call predecessors, (361), 121 states have call successors, (361)
[2025-04-28 21:22:08,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 641 transitions.
[2025-04-28 21:22:08,789 INFO  L79                 Accepts]: Start accepts. Automaton has 210 states and 641 transitions. Word has length 44
[2025-04-28 21:22:08,789 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:08,790 INFO  L485      AbstractCegarLoop]: Abstraction has 210 states and 641 transitions.
[2025-04-28 21:22:08,790 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:08,790 INFO  L278                IsEmpty]: Start isEmpty. Operand 210 states and 641 transitions.
[2025-04-28 21:22:08,796 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:08,796 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:08,796 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:08,796 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-04-28 21:22:08,796 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:08,797 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:08,798 INFO  L85        PathProgramCache]: Analyzing trace with hash -449357086, now seen corresponding path program 1 times
[2025-04-28 21:22:08,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:08,798 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547713200]
[2025-04-28 21:22:08,798 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:08,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:08,830 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:08,838 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:08,838 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:08,838 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:08,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:22:08,929 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:08,929 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547713200]
[2025-04-28 21:22:08,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547713200] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:08,930 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:08,930 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:22:08,930 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808515301]
[2025-04-28 21:22:08,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:08,931 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:22:08,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:08,931 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:22:08,931 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:08,932 INFO  L87              Difference]: Start difference. First operand 210 states and 641 transitions. Second operand  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:09,619 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:09,619 INFO  L93              Difference]: Finished difference Result 218 states and 758 transitions.
[2025-04-28 21:22:09,620 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:22:09,620 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:09,621 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:09,626 INFO  L225             Difference]: With dead ends: 218
[2025-04-28 21:22:09,626 INFO  L226             Difference]: Without dead ends: 218
[2025-04-28 21:22:09,627 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:09,628 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:09,628 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 842 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:22:09,628 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2025-04-28 21:22:09,670 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210.
[2025-04-28 21:22:09,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 210 states, 53 states have (on average 3.0) internal successors, (159), 156 states have internal predecessors, (159), 121 states have call successors, (121), 18 states have call predecessors, (121), 35 states have return successors, (361), 35 states have call predecessors, (361), 121 states have call successors, (361)
[2025-04-28 21:22:09,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 641 transitions.
[2025-04-28 21:22:09,674 INFO  L79                 Accepts]: Start accepts. Automaton has 210 states and 641 transitions. Word has length 44
[2025-04-28 21:22:09,674 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:09,674 INFO  L485      AbstractCegarLoop]: Abstraction has 210 states and 641 transitions.
[2025-04-28 21:22:09,674 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:09,675 INFO  L278                IsEmpty]: Start isEmpty. Operand 210 states and 641 transitions.
[2025-04-28 21:22:09,678 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:09,679 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:09,679 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:09,679 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-04-28 21:22:09,679 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:09,680 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:09,680 INFO  L85        PathProgramCache]: Analyzing trace with hash 1212461494, now seen corresponding path program 1 times
[2025-04-28 21:22:09,680 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:09,680 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576233631]
[2025-04-28 21:22:09,680 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:09,680 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:09,707 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:09,719 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:09,720 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:09,720 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:09,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:22:09,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:09,875 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576233631]
[2025-04-28 21:22:09,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576233631] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:09,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:09,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:22:09,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404927241]
[2025-04-28 21:22:09,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:09,876 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:22:09,876 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:09,877 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:22:09,877 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:09,877 INFO  L87              Difference]: Start difference. First operand 210 states and 641 transitions. Second operand  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:10,577 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:10,577 INFO  L93              Difference]: Finished difference Result 220 states and 675 transitions.
[2025-04-28 21:22:10,578 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:22:10,578 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 44
[2025-04-28 21:22:10,578 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:10,581 INFO  L225             Difference]: With dead ends: 220
[2025-04-28 21:22:10,582 INFO  L226             Difference]: Without dead ends: 220
[2025-04-28 21:22:10,582 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:10,582 INFO  L437           NwaCegarLoop]: 238 mSDtfsCounter, 1 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:10,583 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 803 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:22:10,583 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 220 states.
[2025-04-28 21:22:10,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216.
[2025-04-28 21:22:10,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 216 states, 56 states have (on average 2.892857142857143) internal successors, (162), 159 states have internal predecessors, (162), 121 states have call successors, (121), 18 states have call predecessors, (121), 38 states have return successors, (378), 38 states have call predecessors, (378), 121 states have call successors, (378)
[2025-04-28 21:22:10,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 661 transitions.
[2025-04-28 21:22:10,616 INFO  L79                 Accepts]: Start accepts. Automaton has 216 states and 661 transitions. Word has length 44
[2025-04-28 21:22:10,616 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:10,617 INFO  L485      AbstractCegarLoop]: Abstraction has 216 states and 661 transitions.
[2025-04-28 21:22:10,617 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:22:10,617 INFO  L278                IsEmpty]: Start isEmpty. Operand 216 states and 661 transitions.
[2025-04-28 21:22:10,621 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:10,621 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:10,621 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:10,622 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-04-28 21:22:10,622 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:10,622 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:10,622 INFO  L85        PathProgramCache]: Analyzing trace with hash 1834181788, now seen corresponding path program 1 times
[2025-04-28 21:22:10,622 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:10,622 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094723591]
[2025-04-28 21:22:10,622 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:10,622 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:10,643 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:10,652 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:10,652 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:10,652 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:10,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:22:10,736 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:10,737 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094723591]
[2025-04-28 21:22:10,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094723591] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:10,737 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:10,737 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:22:10,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389230235]
[2025-04-28 21:22:10,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:10,737 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:22:10,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:10,738 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:22:10,738 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:22:10,738 INFO  L87              Difference]: Start difference. First operand 216 states and 661 transitions. Second operand  has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
