./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/ultimate/Lia-NonLinArrays/44_Solaris_space_map_sliced_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:28:11,400 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:28:11,436 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32fd40b-2fe9-4475-b20a-a6a063ebb1e2/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:28:11,439 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:28:11,439 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:28:11,453 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:28:11,453 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:28:11,453 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:28:11,453 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:28:11,453 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:28:11,454 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:28:11,454 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:28:11,454 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:11,454 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:28:11,454 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:28:11,455 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:28:11,455 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:28:11,639 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:28:11,647 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:28:11,649 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:28:11,650 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:28:11,650 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:28:11,651 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32fd40b-2fe9-4475-b20a-a6a063ebb1e2/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/ultimate/Lia-NonLinArrays/44_Solaris_space_map_sliced_000.smt2
[2025-05-07 17:28:11,652 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:28:11,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:28:12,328 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f32fd40b-2fe9-4475-b20a-a6a063ebb1e2/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/ultimate/Lia-NonLinArrays/44_Solaris_space_map_sliced_000.smt2
[2025-05-07 17:28:12,330 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:28:12,331 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:28:12,332 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:28:12,332 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:28:12,332 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:28:12,334 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,369 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12 Unit
[2025-05-07 17:28:12,369 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:28:12,370 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:28:12,370 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:28:12,370 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:28:12,381 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,381 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,404 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,405 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,424 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,428 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,433 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,438 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,441 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,454 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:28:12,455 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:28:12,455 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:28:12,455 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:28:12,456 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (1/1) ...
[2025-05-07 17:28:12,458 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:12,468 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:12,478 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-05-07 17:28:12,480 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:28:12,491 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:28:12,491 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:28:12,492 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:28:12,492 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure CHC_COMP_FALSE given in one single declaration
[2025-05-07 17:28:12,492 INFO  L130     BoogieDeclarations]: Found specification of procedure CHC_COMP_FALSE
[2025-05-07 17:28:12,492 INFO  L138     BoogieDeclarations]: Found implementation of procedure CHC_COMP_FALSE
[2025-05-07 17:28:12,492 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Inv given in one single declaration
[2025-05-07 17:28:12,492 INFO  L130     BoogieDeclarations]: Found specification of procedure Inv
[2025-05-07 17:28:12,492 INFO  L138     BoogieDeclarations]: Found implementation of procedure Inv
[2025-05-07 17:28:12,492 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:28:12,492 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:28:12,493 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:28:12,549 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:28:12,552 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:28:13,580 INFO  L?                        ?]: Removed 33 outVars from TransFormulas that were not future-live.
[2025-05-07 17:28:13,581 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:28:13,593 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:28:13,593 INFO  L312             CfgBuilder]: Removed 2 assume(true) statements.
[2025-05-07 17:28:13,594 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:13 BoogieIcfgContainer
[2025-05-07 17:28:13,594 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:28:13,595 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:28:13,595 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:28:13,598 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:28:13,598 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:12" (1/3) ...
[2025-05-07 17:28:13,598 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b839fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:28:13, skipping insertion in model container
[2025-05-07 17:28:13,599 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:12" (2/3) ...
[2025-05-07 17:28:13,599 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b839fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:28:13, skipping insertion in model container
[2025-05-07 17:28:13,599 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:13" (3/3) ...
[2025-05-07 17:28:13,600 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:28:13,610 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:28:13,612 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 4 procedures, 295 locations, 1103 edges, 4 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:28:13,645 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:28:13,654 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;@fde9b7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:28:13,654 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:28:13,657 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 295 states, 8 states have (on average 31.375) internal successors, (251), 251 states have internal predecessors, (251), 284 states have call successors, (284), 3 states have call predecessors, (284), 3 states have return successors, (284), 42 states have call predecessors, (284), 284 states have call successors, (284)
[2025-05-07 17:28:13,836 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2025-05-07 17:28:13,836 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:13,836 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2025-05-07 17:28:13,837 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:13,840 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:13,840 INFO  L85        PathProgramCache]: Analyzing trace with hash 1743352866, now seen corresponding path program 1 times
[2025-05-07 17:28:13,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:13,846 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289326504]
[2025-05-07 17:28:13,847 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:13,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:13,863 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-05-07 17:28:13,864 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-05-07 17:28:13,864 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:13,864 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:13,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:13,887 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:13,887 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289326504]
[2025-05-07 17:28:13,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289326504] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:13,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:13,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-05-07 17:28:13,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155624348]
[2025-05-07 17:28:13,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:13,894 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-05-07 17:28:13,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:13,913 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-05-07 17:28:13,913 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-05-07 17:28:13,915 INFO  L87              Difference]: Start difference. First operand  has 295 states, 8 states have (on average 31.375) internal successors, (251), 251 states have internal predecessors, (251), 284 states have call successors, (284), 3 states have call predecessors, (284), 3 states have return successors, (284), 42 states have call predecessors, (284), 284 states have call successors, (284) Second operand  has 2 states, 2 states have (on average 1.5) internal successors, (3), 1 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2025-05-07 17:28:13,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:13,999 INFO  L93              Difference]: Finished difference Result 293 states and 816 transitions.
[2025-05-07 17:28:13,999 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-05-07 17:28:14,000 INFO  L79                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 1.5) internal successors, (3), 1 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5
[2025-05-07 17:28:14,000 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:14,036 INFO  L225             Difference]: With dead ends: 293
[2025-05-07 17:28:14,036 INFO  L226             Difference]: Without dead ends: 293
[2025-05-07 17:28:14,037 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-05-07 17:28:14,039 INFO  L437           NwaCegarLoop]: 816 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:14,040 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:14,050 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 293 states.
[2025-05-07 17:28:14,208 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293.
[2025-05-07 17:28:14,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 293 states, 6 states have (on average 41.333333333333336) internal successors, (248), 248 states have internal predecessors, (248), 284 states have call successors, (284), 3 states have call predecessors, (284), 3 states have return successors, (284), 42 states have call predecessors, (284), 284 states have call successors, (284)
[2025-05-07 17:28:14,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 816 transitions.
[2025-05-07 17:28:14,240 INFO  L79                 Accepts]: Start accepts. Automaton has 293 states and 816 transitions. Word has length 5
[2025-05-07 17:28:14,241 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:14,241 INFO  L485      AbstractCegarLoop]: Abstraction has 293 states and 816 transitions.
[2025-05-07 17:28:14,241 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 1.5) internal successors, (3), 1 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2025-05-07 17:28:14,241 INFO  L278                IsEmpty]: Start isEmpty. Operand 293 states and 816 transitions.
[2025-05-07 17:28:14,419 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-05-07 17:28:14,419 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:14,419 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:14,420 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:28:14,420 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:14,420 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:14,420 INFO  L85        PathProgramCache]: Analyzing trace with hash -627590625, now seen corresponding path program 1 times
[2025-05-07 17:28:14,420 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:14,421 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502359083]
[2025-05-07 17:28:14,421 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:14,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:14,425 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-05-07 17:28:14,438 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-05-07 17:28:14,438 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:14,438 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:14,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:14,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:14,494 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502359083]
[2025-05-07 17:28:14,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502359083] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:14,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:14,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:14,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609335279]
[2025-05-07 17:28:14,494 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:14,495 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:14,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:14,495 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:14,495 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:14,496 INFO  L87              Difference]: Start difference. First operand 293 states and 816 transitions. Second operand  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:28:17,550 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:17,550 INFO  L93              Difference]: Finished difference Result 384 states and 1337 transitions.
[2025-05-07 17:28:17,550 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:17,550 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-05-07 17:28:17,550 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:17,594 INFO  L225             Difference]: With dead ends: 384
[2025-05-07 17:28:17,594 INFO  L226             Difference]: Without dead ends: 384
[2025-05-07 17:28:17,594 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:17,595 INFO  L437           NwaCegarLoop]: 692 mSDtfsCounter, 49 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:17,595 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1424 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-05-07 17:28:17,596 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 384 states.
[2025-05-07 17:28:17,770 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382.
[2025-05-07 17:28:17,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 382 states, 8 states have (on average 37.25) internal successors, (298), 297 states have internal predecessors, (298), 371 states have call successors, (371), 4 states have call predecessors, (371), 4 states have return successors, (666), 81 states have call predecessors, (666), 371 states have call successors, (666)
[2025-05-07 17:28:17,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1335 transitions.
[2025-05-07 17:28:17,795 INFO  L79                 Accepts]: Start accepts. Automaton has 382 states and 1335 transitions. Word has length 12
[2025-05-07 17:28:17,795 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:17,796 INFO  L485      AbstractCegarLoop]: Abstraction has 382 states and 1335 transitions.
[2025-05-07 17:28:17,796 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:28:17,796 INFO  L278                IsEmpty]: Start isEmpty. Operand 382 states and 1335 transitions.
[2025-05-07 17:28:17,918 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-05-07 17:28:17,918 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:17,918 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:17,918 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:28:17,918 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:17,919 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:17,920 INFO  L85        PathProgramCache]: Analyzing trace with hash -382339772, now seen corresponding path program 1 times
[2025-05-07 17:28:17,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:17,920 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384826239]
[2025-05-07 17:28:17,920 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:17,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:17,924 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-05-07 17:28:17,929 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-05-07 17:28:17,929 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:17,929 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:17,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:17,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:17,961 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384826239]
[2025-05-07 17:28:17,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384826239] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:17,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:17,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:17,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090121547]
[2025-05-07 17:28:17,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:17,961 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:17,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:17,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:17,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:17,962 INFO  L87              Difference]: Start difference. First operand 382 states and 1335 transitions. Second operand  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:28:20,838 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:20,838 INFO  L93              Difference]: Finished difference Result 382 states and 1333 transitions.
[2025-05-07 17:28:20,839 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:20,839 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-05-07 17:28:20,839 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:20,883 INFO  L225             Difference]: With dead ends: 382
[2025-05-07 17:28:20,883 INFO  L226             Difference]: Without dead ends: 382
[2025-05-07 17:28:20,883 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:20,884 INFO  L437           NwaCegarLoop]: 692 mSDtfsCounter, 49 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:20,884 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1422 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-05-07 17:28:20,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 382 states.
[2025-05-07 17:28:21,030 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382.
[2025-05-07 17:28:21,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 382 states, 8 states have (on average 37.25) internal successors, (298), 297 states have internal predecessors, (298), 371 states have call successors, (371), 4 states have call predecessors, (371), 4 states have return successors, (664), 81 states have call predecessors, (664), 371 states have call successors, (664)
[2025-05-07 17:28:21,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1333 transitions.
[2025-05-07 17:28:21,054 INFO  L79                 Accepts]: Start accepts. Automaton has 382 states and 1333 transitions. Word has length 12
[2025-05-07 17:28:21,054 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:21,054 INFO  L485      AbstractCegarLoop]: Abstraction has 382 states and 1333 transitions.
[2025-05-07 17:28:21,054 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:28:21,054 INFO  L278                IsEmpty]: Start isEmpty. Operand 382 states and 1333 transitions.
[2025-05-07 17:28:21,178 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-05-07 17:28:21,178 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:21,178 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:21,178 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:28:21,179 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:21,181 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:21,181 INFO  L85        PathProgramCache]: Analyzing trace with hash -310523766, now seen corresponding path program 1 times
[2025-05-07 17:28:21,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:21,181 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15476853]
[2025-05-07 17:28:21,181 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:21,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:21,186 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-05-07 17:28:21,194 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-05-07 17:28:21,194 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:21,194 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:21,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:28:21,243 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:21,243 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15476853]
[2025-05-07 17:28:21,243 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15476853] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:21,243 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268804969]
[2025-05-07 17:28:21,243 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:21,243 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:21,246 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:21,248 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:21,249 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:28:21,294 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-05-07 17:28:21,319 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-05-07 17:28:21,319 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:21,319 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:21,321 INFO  L256         TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:21,326 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:21,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:28:21,362 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:21,472 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:28:21,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [268804969] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:21,472 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:21,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6
[2025-05-07 17:28:21,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961815370]
[2025-05-07 17:28:21,473 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:21,473 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:21,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:21,473 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:21,474 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:21,474 INFO  L87              Difference]: Start difference. First operand 382 states and 1333 transitions. Second operand  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:28:31,496 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:31,496 INFO  L93              Difference]: Finished difference Result 926 states and 5138 transitions.
[2025-05-07 17:28:31,496 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:31,497 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 15
[2025-05-07 17:28:31,497 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:31,671 INFO  L225             Difference]: With dead ends: 926
[2025-05-07 17:28:31,671 INFO  L226             Difference]: Without dead ends: 926
[2025-05-07 17:28:31,671 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:31,672 INFO  L437           NwaCegarLoop]: 1211 mSDtfsCounter, 284 mSDsluCounter, 2063 mSDsCounter, 0 mSdLazyCounter, 4772 mSolverCounterSat, 1298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 6070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1298 IncrementalHoareTripleChecker+Valid, 4772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:31,672 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 3274 Invalid, 6070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1298 Valid, 4772 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time]
[2025-05-07 17:28:31,673 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 926 states.
[2025-05-07 17:28:32,434 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 746.
[2025-05-07 17:28:32,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 746 states, 12 states have (on average 48.666666666666664) internal successors, (584), 581 states have internal predecessors, (584), 731 states have call successors, (731), 6 states have call predecessors, (731), 6 states have return successors, (2033), 159 states have call predecessors, (2033), 731 states have call successors, (2033)
[2025-05-07 17:28:32,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 3348 transitions.
[2025-05-07 17:28:32,493 INFO  L79                 Accepts]: Start accepts. Automaton has 746 states and 3348 transitions. Word has length 15
[2025-05-07 17:28:32,494 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:32,494 INFO  L485      AbstractCegarLoop]: Abstraction has 746 states and 3348 transitions.
[2025-05-07 17:28:32,494 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:28:32,494 INFO  L278                IsEmpty]: Start isEmpty. Operand 746 states and 3348 transitions.
[2025-05-07 17:28:32,752 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:28:32,752 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:32,752 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:32,756 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:28:32,953 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:32,953 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:32,954 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:32,955 INFO  L85        PathProgramCache]: Analyzing trace with hash 588584492, now seen corresponding path program 1 times
[2025-05-07 17:28:32,955 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:32,955 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353326196]
[2025-05-07 17:28:32,955 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:32,955 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:32,966 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:28:32,970 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:28:32,970 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:32,970 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:33,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-05-07 17:28:33,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:33,024 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353326196]
[2025-05-07 17:28:33,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353326196] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:33,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:33,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:33,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527956301]
[2025-05-07 17:28:33,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:33,024 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:33,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:33,025 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:33,025 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:33,025 INFO  L87              Difference]: Start difference. First operand 746 states and 3348 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:28:36,426 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:36,427 INFO  L93              Difference]: Finished difference Result 1104 states and 6853 transitions.
[2025-05-07 17:28:36,427 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:36,427 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:28:36,427 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:36,693 INFO  L225             Difference]: With dead ends: 1104
[2025-05-07 17:28:36,694 INFO  L226             Difference]: Without dead ends: 1104
[2025-05-07 17:28:36,694 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:36,694 INFO  L437           NwaCegarLoop]: 944 mSDtfsCounter, 49 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:36,694 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 2092 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time]
[2025-05-07 17:28:36,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1104 states.
[2025-05-07 17:28:38,057 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1102.
[2025-05-07 17:28:38,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1102 states, 20 states have (on average 40.6) internal successors, (812), 777 states have internal predecessors, (812), 1079 states have call successors, (1079), 10 states have call predecessors, (1079), 10 states have return successors, (4960), 315 states have call predecessors, (4960), 1079 states have call successors, (4960)
[2025-05-07 17:28:38,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 6851 transitions.
[2025-05-07 17:28:38,198 INFO  L79                 Accepts]: Start accepts. Automaton has 1102 states and 6851 transitions. Word has length 16
[2025-05-07 17:28:38,198 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:38,198 INFO  L485      AbstractCegarLoop]: Abstraction has 1102 states and 6851 transitions.
[2025-05-07 17:28:38,198 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:28:38,198 INFO  L278                IsEmpty]: Start isEmpty. Operand 1102 states and 6851 transitions.
[2025-05-07 17:28:38,557 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:28:38,557 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:38,557 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:38,558 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:28:38,558 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:38,558 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:38,559 INFO  L85        PathProgramCache]: Analyzing trace with hash 675513637, now seen corresponding path program 1 times
[2025-05-07 17:28:38,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:38,559 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426140507]
[2025-05-07 17:28:38,559 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:38,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:38,562 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:28:38,565 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:28:38,565 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:38,565 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:38,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:28:38,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:38,592 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426140507]
[2025-05-07 17:28:38,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426140507] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:38,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:38,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:38,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551302007]
[2025-05-07 17:28:38,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:38,592 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:38,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:38,592 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:38,592 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:38,593 INFO  L87              Difference]: Start difference. First operand 1102 states and 6851 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:28:41,872 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:41,872 INFO  L93              Difference]: Finished difference Result 1460 states and 11392 transitions.
[2025-05-07 17:28:41,873 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:41,873 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:28:41,873 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:42,377 INFO  L225             Difference]: With dead ends: 1460
[2025-05-07 17:28:42,377 INFO  L226             Difference]: Without dead ends: 1460
[2025-05-07 17:28:42,377 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:42,378 INFO  L437           NwaCegarLoop]: 950 mSDtfsCounter, 49 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:42,378 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1980 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-05-07 17:28:42,379 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1460 states.
[2025-05-07 17:28:45,007 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1458.
[2025-05-07 17:28:45,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1458 states, 28 states have (on average 41.642857142857146) internal successors, (1166), 973 states have internal predecessors, (1166), 1427 states have call successors, (1427), 14 states have call predecessors, (1427), 14 states have return successors, (8797), 471 states have call predecessors, (8797), 1427 states have call successors, (8797)
[2025-05-07 17:28:45,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 11390 transitions.
[2025-05-07 17:28:45,285 INFO  L79                 Accepts]: Start accepts. Automaton has 1458 states and 11390 transitions. Word has length 16
[2025-05-07 17:28:45,285 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:45,285 INFO  L485      AbstractCegarLoop]: Abstraction has 1458 states and 11390 transitions.
[2025-05-07 17:28:45,285 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:28:45,286 INFO  L278                IsEmpty]: Start isEmpty. Operand 1458 states and 11390 transitions.
[2025-05-07 17:28:45,707 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:28:45,708 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:45,708 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:45,708 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:28:45,708 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:45,710 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:45,710 INFO  L85        PathProgramCache]: Analyzing trace with hash -649041967, now seen corresponding path program 1 times
[2025-05-07 17:28:45,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:45,710 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826038434]
[2025-05-07 17:28:45,710 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:45,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:45,714 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:28:45,716 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:28:45,716 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:45,716 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:45,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:28:45,741 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:45,741 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826038434]
[2025-05-07 17:28:45,741 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826038434] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:45,741 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:45,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:45,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711120853]
[2025-05-07 17:28:45,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:45,742 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:45,742 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:45,742 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:45,742 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:45,742 INFO  L87              Difference]: Start difference. First operand 1458 states and 11390 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:28:48,734 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:48,734 INFO  L93              Difference]: Finished difference Result 1460 states and 11388 transitions.
[2025-05-07 17:28:48,735 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:48,735 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:28:48,735 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:49,275 INFO  L225             Difference]: With dead ends: 1460
[2025-05-07 17:28:49,275 INFO  L226             Difference]: Without dead ends: 1460
[2025-05-07 17:28:49,276 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:49,276 INFO  L437           NwaCegarLoop]: 967 mSDtfsCounter, 49 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:49,276 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2146 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-05-07 17:28:49,277 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1460 states.
[2025-05-07 17:28:51,891 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1458.
[2025-05-07 17:28:51,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1458 states, 28 states have (on average 41.642857142857146) internal successors, (1166), 973 states have internal predecessors, (1166), 1427 states have call successors, (1427), 14 states have call predecessors, (1427), 14 states have return successors, (8793), 471 states have call predecessors, (8793), 1427 states have call successors, (8793)
[2025-05-07 17:28:52,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 11386 transitions.
[2025-05-07 17:28:52,199 INFO  L79                 Accepts]: Start accepts. Automaton has 1458 states and 11386 transitions. Word has length 16
[2025-05-07 17:28:52,199 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:52,199 INFO  L485      AbstractCegarLoop]: Abstraction has 1458 states and 11386 transitions.
[2025-05-07 17:28:52,199 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:28:52,200 INFO  L278                IsEmpty]: Start isEmpty. Operand 1458 states and 11386 transitions.
[2025-05-07 17:28:52,639 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:28:52,639 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:52,639 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:52,639 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:28:52,639 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:52,641 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:52,641 INFO  L85        PathProgramCache]: Analyzing trace with hash -1726288660, now seen corresponding path program 1 times
[2025-05-07 17:28:52,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:52,641 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813306987]
[2025-05-07 17:28:52,641 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:52,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:52,644 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:28:52,647 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:28:52,647 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:52,647 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:52,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:28:52,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:52,670 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813306987]
[2025-05-07 17:28:52,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813306987] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:52,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:52,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:52,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105815063]
[2025-05-07 17:28:52,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:52,670 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:52,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:52,671 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:52,671 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:52,671 INFO  L87              Difference]: Start difference. First operand 1458 states and 11386 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:28:56,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:56,145 INFO  L93              Difference]: Finished difference Result 1460 states and 11386 transitions.
[2025-05-07 17:28:56,146 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:56,146 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:28:56,146 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:56,691 INFO  L225             Difference]: With dead ends: 1460
[2025-05-07 17:28:56,691 INFO  L226             Difference]: Without dead ends: 1460
[2025-05-07 17:28:56,692 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:56,692 INFO  L437           NwaCegarLoop]: 938 mSDtfsCounter, 49 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:56,692 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1954 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-05-07 17:28:56,693 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1460 states.
[2025-05-07 17:28:59,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1458.
[2025-05-07 17:28:59,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1458 states, 28 states have (on average 41.642857142857146) internal successors, (1166), 973 states have internal predecessors, (1166), 1427 states have call successors, (1427), 14 states have call predecessors, (1427), 14 states have return successors, (8791), 471 states have call predecessors, (8791), 1427 states have call successors, (8791)
[2025-05-07 17:28:59,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 11384 transitions.
[2025-05-07 17:28:59,607 INFO  L79                 Accepts]: Start accepts. Automaton has 1458 states and 11384 transitions. Word has length 16
[2025-05-07 17:28:59,607 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:59,607 INFO  L485      AbstractCegarLoop]: Abstraction has 1458 states and 11384 transitions.
[2025-05-07 17:28:59,607 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:28:59,607 INFO  L278                IsEmpty]: Start isEmpty. Operand 1458 states and 11384 transitions.
[2025-05-07 17:29:00,104 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:29:00,104 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:00,104 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:00,104 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:29:00,104 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:00,108 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:00,108 INFO  L85        PathProgramCache]: Analyzing trace with hash -1886668426, now seen corresponding path program 1 times
[2025-05-07 17:29:00,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:00,108 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951792802]
[2025-05-07 17:29:00,108 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:00,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:00,111 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:29:00,114 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:29:00,114 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:00,114 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:00,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:00,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:00,139 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951792802]
[2025-05-07 17:29:00,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951792802] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:00,139 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:00,139 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:00,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011012265]
[2025-05-07 17:29:00,139 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:00,139 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:00,139 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:00,139 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:00,140 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:00,140 INFO  L87              Difference]: Start difference. First operand 1458 states and 11384 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:03,370 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:03,370 INFO  L93              Difference]: Finished difference Result 1458 states and 11382 transitions.
[2025-05-07 17:29:03,371 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:03,371 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:29:03,371 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:03,929 INFO  L225             Difference]: With dead ends: 1458
[2025-05-07 17:29:03,929 INFO  L226             Difference]: Without dead ends: 1458
[2025-05-07 17:29:03,929 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:03,930 INFO  L437           NwaCegarLoop]: 950 mSDtfsCounter, 49 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:03,930 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 2100 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-05-07 17:29:03,932 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1458 states.
[2025-05-07 17:29:06,172 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458.
[2025-05-07 17:29:06,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1458 states, 28 states have (on average 41.642857142857146) internal successors, (1166), 973 states have internal predecessors, (1166), 1427 states have call successors, (1427), 14 states have call predecessors, (1427), 14 states have return successors, (8789), 471 states have call predecessors, (8789), 1427 states have call successors, (8789)
[2025-05-07 17:29:06,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 11382 transitions.
[2025-05-07 17:29:06,458 INFO  L79                 Accepts]: Start accepts. Automaton has 1458 states and 11382 transitions. Word has length 16
[2025-05-07 17:29:06,458 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:06,458 INFO  L485      AbstractCegarLoop]: Abstraction has 1458 states and 11382 transitions.
[2025-05-07 17:29:06,459 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:06,459 INFO  L278                IsEmpty]: Start isEmpty. Operand 1458 states and 11382 transitions.
[2025-05-07 17:29:06,894 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:29:06,894 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:06,894 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:06,894 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:29:06,894 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:06,898 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:06,898 INFO  L85        PathProgramCache]: Analyzing trace with hash 93425718, now seen corresponding path program 1 times
[2025-05-07 17:29:06,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:06,898 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644347119]
[2025-05-07 17:29:06,898 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:06,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:06,901 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:29:06,903 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:29:06,904 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:06,904 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:06,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:06,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:06,923 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644347119]
[2025-05-07 17:29:06,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644347119] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:06,923 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:06,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:06,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103302456]
[2025-05-07 17:29:06,924 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:06,924 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:06,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:06,924 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:06,924 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:06,924 INFO  L87              Difference]: Start difference. First operand 1458 states and 11382 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:10,151 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:10,151 INFO  L93              Difference]: Finished difference Result 1458 states and 11376 transitions.
[2025-05-07 17:29:10,152 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:10,152 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:29:10,152 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:10,816 INFO  L225             Difference]: With dead ends: 1458
[2025-05-07 17:29:10,816 INFO  L226             Difference]: Without dead ends: 1458
[2025-05-07 17:29:10,816 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:10,816 INFO  L437           NwaCegarLoop]: 944 mSDtfsCounter, 49 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:10,816 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1962 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-05-07 17:29:10,817 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1458 states.
[2025-05-07 17:29:13,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458.
[2025-05-07 17:29:13,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1458 states, 28 states have (on average 41.642857142857146) internal successors, (1166), 973 states have internal predecessors, (1166), 1427 states have call successors, (1427), 14 states have call predecessors, (1427), 14 states have return successors, (8783), 471 states have call predecessors, (8783), 1427 states have call successors, (8783)
[2025-05-07 17:29:13,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 11376 transitions.
[2025-05-07 17:29:13,938 INFO  L79                 Accepts]: Start accepts. Automaton has 1458 states and 11376 transitions. Word has length 16
[2025-05-07 17:29:13,938 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:13,938 INFO  L485      AbstractCegarLoop]: Abstraction has 1458 states and 11376 transitions.
[2025-05-07 17:29:13,938 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:13,938 INFO  L278                IsEmpty]: Start isEmpty. Operand 1458 states and 11376 transitions.
[2025-05-07 17:29:14,498 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:29:14,498 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:14,498 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:14,498 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:29:14,498 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:14,499 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:14,499 INFO  L85        PathProgramCache]: Analyzing trace with hash 470177499, now seen corresponding path program 1 times
[2025-05-07 17:29:14,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:14,499 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588080606]
[2025-05-07 17:29:14,499 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:14,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:14,502 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:29:14,504 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:29:14,504 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:14,504 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:14,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:14,527 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:14,528 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588080606]
[2025-05-07 17:29:14,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588080606] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:14,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:14,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:14,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001815761]
[2025-05-07 17:29:14,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:14,528 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:14,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:14,528 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:14,528 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:14,529 INFO  L87              Difference]: Start difference. First operand 1458 states and 11376 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:18,435 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:18,435 INFO  L93              Difference]: Finished difference Result 1816 states and 17023 transitions.
[2025-05-07 17:29:18,436 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:18,436 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:29:18,437 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:19,436 INFO  L225             Difference]: With dead ends: 1816
[2025-05-07 17:29:19,437 INFO  L226             Difference]: Without dead ends: 1816
[2025-05-07 17:29:19,437 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:19,437 INFO  L437           NwaCegarLoop]: 948 mSDtfsCounter, 49 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:19,438 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1790 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2025-05-07 17:29:19,439 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1816 states.
[2025-05-07 17:29:24,162 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1814.
[2025-05-07 17:29:24,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1814 states, 36 states have (on average 47.5) internal successors, (1710), 1169 states have internal predecessors, (1710), 1775 states have call successors, (1775), 18 states have call predecessors, (1775), 18 states have return successors, (13536), 627 states have call predecessors, (13536), 1775 states have call successors, (13536)
[2025-05-07 17:29:24,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 17021 transitions.
[2025-05-07 17:29:24,648 INFO  L79                 Accepts]: Start accepts. Automaton has 1814 states and 17021 transitions. Word has length 16
[2025-05-07 17:29:24,648 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:24,648 INFO  L485      AbstractCegarLoop]: Abstraction has 1814 states and 17021 transitions.
[2025-05-07 17:29:24,648 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:24,648 INFO  L278                IsEmpty]: Start isEmpty. Operand 1814 states and 17021 transitions.
[2025-05-07 17:29:25,378 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:29:25,378 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:25,378 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:25,378 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:29:25,378 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:25,382 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:25,382 INFO  L85        PathProgramCache]: Analyzing trace with hash 1059586596, now seen corresponding path program 1 times
[2025-05-07 17:29:25,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:25,382 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214850533]
[2025-05-07 17:29:25,382 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:25,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:25,385 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:29:25,388 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:29:25,388 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:25,388 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:25,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:25,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:25,407 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214850533]
[2025-05-07 17:29:25,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214850533] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:25,407 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:25,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:25,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981789418]
[2025-05-07 17:29:25,408 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:25,408 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:25,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:25,408 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:25,408 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:25,408 INFO  L87              Difference]: Start difference. First operand 1814 states and 17021 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:29,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:29,284 INFO  L93              Difference]: Finished difference Result 2172 states and 23482 transitions.
[2025-05-07 17:29:29,285 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:29,285 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:29:29,285 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:30,784 INFO  L225             Difference]: With dead ends: 2172
[2025-05-07 17:29:30,784 INFO  L226             Difference]: Without dead ends: 2172
[2025-05-07 17:29:30,784 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:30,785 INFO  L437           NwaCegarLoop]: 932 mSDtfsCounter, 49 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:30,785 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1838 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-05-07 17:29:30,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2172 states.
[2025-05-07 17:29:37,115 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2170.
[2025-05-07 17:29:37,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2170 states, 44 states have (on average 49.22727272727273) internal successors, (2166), 1365 states have internal predecessors, (2166), 2123 states have call successors, (2123), 22 states have call predecessors, (2123), 22 states have return successors, (19191), 783 states have call predecessors, (19191), 2123 states have call successors, (19191)
[2025-05-07 17:29:37,811 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 23480 transitions.
[2025-05-07 17:29:37,811 INFO  L79                 Accepts]: Start accepts. Automaton has 2170 states and 23480 transitions. Word has length 16
[2025-05-07 17:29:37,811 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:37,811 INFO  L485      AbstractCegarLoop]: Abstraction has 2170 states and 23480 transitions.
[2025-05-07 17:29:37,811 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:37,811 INFO  L278                IsEmpty]: Start isEmpty. Operand 2170 states and 23480 transitions.
[2025-05-07 17:29:38,604 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:29:38,604 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:38,604 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:38,604 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:29:38,604 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:38,608 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:38,608 INFO  L85        PathProgramCache]: Analyzing trace with hash -2005075419, now seen corresponding path program 1 times
[2025-05-07 17:29:38,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:38,608 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466712954]
[2025-05-07 17:29:38,608 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:38,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:38,612 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:29:38,614 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:29:38,614 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:38,614 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:38,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:38,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:38,635 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466712954]
[2025-05-07 17:29:38,635 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466712954] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:38,635 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:38,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:38,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438055014]
[2025-05-07 17:29:38,636 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:38,636 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:38,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:38,636 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:38,636 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:38,636 INFO  L87              Difference]: Start difference. First operand 2170 states and 23480 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:43,044 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:43,045 INFO  L93              Difference]: Finished difference Result 2172 states and 23464 transitions.
[2025-05-07 17:29:43,045 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:43,045 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:29:43,045 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:44,544 INFO  L225             Difference]: With dead ends: 2172
[2025-05-07 17:29:44,544 INFO  L226             Difference]: Without dead ends: 2172
[2025-05-07 17:29:44,544 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:44,545 INFO  L437           NwaCegarLoop]: 935 mSDtfsCounter, 49 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:44,545 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1756 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time]
[2025-05-07 17:29:44,547 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2172 states.
[2025-05-07 17:29:50,661 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2170.
[2025-05-07 17:29:50,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2170 states, 44 states have (on average 49.22727272727273) internal successors, (2166), 1365 states have internal predecessors, (2166), 2123 states have call successors, (2123), 22 states have call predecessors, (2123), 22 states have return successors, (19173), 783 states have call predecessors, (19173), 2123 states have call successors, (19173)
[2025-05-07 17:29:51,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 23462 transitions.
[2025-05-07 17:29:51,448 INFO  L79                 Accepts]: Start accepts. Automaton has 2170 states and 23462 transitions. Word has length 16
[2025-05-07 17:29:51,448 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:51,448 INFO  L485      AbstractCegarLoop]: Abstraction has 2170 states and 23462 transitions.
[2025-05-07 17:29:51,448 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:51,448 INFO  L278                IsEmpty]: Start isEmpty. Operand 2170 states and 23462 transitions.
[2025-05-07 17:29:52,327 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:29:52,327 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:52,327 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:52,327 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:29:52,327 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:52,331 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:52,331 INFO  L85        PathProgramCache]: Analyzing trace with hash 1868183724, now seen corresponding path program 1 times
[2025-05-07 17:29:52,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:52,331 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457821380]
[2025-05-07 17:29:52,331 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:52,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:52,334 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:29:52,336 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:29:52,336 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:52,336 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:52,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:52,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:52,357 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457821380]
[2025-05-07 17:29:52,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457821380] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:52,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:52,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:52,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984578877]
[2025-05-07 17:29:52,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:52,357 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:52,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:52,357 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:52,358 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:52,358 INFO  L87              Difference]: Start difference. First operand 2170 states and 23462 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:29:56,583 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:56,583 INFO  L93              Difference]: Finished difference Result 2172 states and 23462 transitions.
[2025-05-07 17:29:56,583 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:56,583 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:29:56,583 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:58,254 INFO  L225             Difference]: With dead ends: 2172
[2025-05-07 17:29:58,254 INFO  L226             Difference]: Without dead ends: 2172
[2025-05-07 17:29:58,254 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:58,255 INFO  L437           NwaCegarLoop]: 943 mSDtfsCounter, 49 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:58,255 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1861 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2025-05-07 17:29:58,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2172 states.
[2025-05-07 17:30:03,584 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2170.
[2025-05-07 17:30:03,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2170 states, 44 states have (on average 49.22727272727273) internal successors, (2166), 1365 states have internal predecessors, (2166), 2123 states have call successors, (2123), 22 states have call predecessors, (2123), 22 states have return successors, (19171), 783 states have call predecessors, (19171), 2123 states have call successors, (19171)
[2025-05-07 17:30:04,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 23460 transitions.
[2025-05-07 17:30:04,309 INFO  L79                 Accepts]: Start accepts. Automaton has 2170 states and 23460 transitions. Word has length 16
[2025-05-07 17:30:04,309 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:04,309 INFO  L485      AbstractCegarLoop]: Abstraction has 2170 states and 23460 transitions.
[2025-05-07 17:30:04,309 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:30:04,309 INFO  L278                IsEmpty]: Start isEmpty. Operand 2170 states and 23460 transitions.
[2025-05-07 17:30:05,121 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:30:05,121 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:05,121 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:05,121 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:30:05,121 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:05,125 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:05,125 INFO  L85        PathProgramCache]: Analyzing trace with hash -111910420, now seen corresponding path program 1 times
[2025-05-07 17:30:05,126 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:05,126 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147436429]
[2025-05-07 17:30:05,126 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:05,126 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:05,129 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:30:05,131 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:30:05,131 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:05,131 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:05,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:30:05,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:05,155 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147436429]
[2025-05-07 17:30:05,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147436429] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:05,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:05,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:30:05,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429770060]
[2025-05-07 17:30:05,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:05,155 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:30:05,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:05,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:30:05,156 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:05,156 INFO  L87              Difference]: Start difference. First operand 2170 states and 23460 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:30:08,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:08,702 INFO  L93              Difference]: Finished difference Result 2172 states and 23460 transitions.
[2025-05-07 17:30:08,702 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:30:08,702 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:30:08,703 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:10,058 INFO  L225             Difference]: With dead ends: 2172
[2025-05-07 17:30:10,058 INFO  L226             Difference]: Without dead ends: 2172
[2025-05-07 17:30:10,058 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:10,058 INFO  L437           NwaCegarLoop]: 936 mSDtfsCounter, 49 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:10,059 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1758 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-05-07 17:30:10,060 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2172 states.
[2025-05-07 17:30:16,261 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2170.
[2025-05-07 17:30:16,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2170 states, 44 states have (on average 49.22727272727273) internal successors, (2166), 1365 states have internal predecessors, (2166), 2123 states have call successors, (2123), 22 states have call predecessors, (2123), 22 states have return successors, (19169), 783 states have call predecessors, (19169), 2123 states have call successors, (19169)
[2025-05-07 17:30:16,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 23458 transitions.
[2025-05-07 17:30:16,985 INFO  L79                 Accepts]: Start accepts. Automaton has 2170 states and 23458 transitions. Word has length 16
[2025-05-07 17:30:16,985 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:16,985 INFO  L485      AbstractCegarLoop]: Abstraction has 2170 states and 23458 transitions.
[2025-05-07 17:30:16,985 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:30:16,985 INFO  L278                IsEmpty]: Start isEmpty. Operand 2170 states and 23458 transitions.
[2025-05-07 17:30:17,786 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:30:17,786 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:17,786 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:17,786 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:30:17,787 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:17,787 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:17,787 INFO  L85        PathProgramCache]: Analyzing trace with hash 630557265, now seen corresponding path program 1 times
[2025-05-07 17:30:17,787 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:17,787 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005790682]
[2025-05-07 17:30:17,787 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:17,787 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:17,791 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:30:17,793 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:30:17,793 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:17,793 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:17,812 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:30:17,812 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:17,812 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005790682]
[2025-05-07 17:30:17,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005790682] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:17,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:17,813 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:30:17,813 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255918497]
[2025-05-07 17:30:17,813 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:17,813 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:30:17,813 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:17,813 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:30:17,813 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:17,813 INFO  L87              Difference]: Start difference. First operand 2170 states and 23458 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:30:22,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:22,035 INFO  L93              Difference]: Finished difference Result 2170 states and 23456 transitions.
[2025-05-07 17:30:22,035 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:30:22,035 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:30:22,035 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:23,446 INFO  L225             Difference]: With dead ends: 2170
[2025-05-07 17:30:23,446 INFO  L226             Difference]: Without dead ends: 2170
[2025-05-07 17:30:23,447 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:23,447 INFO  L437           NwaCegarLoop]: 944 mSDtfsCounter, 49 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:23,447 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1860 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2025-05-07 17:30:23,448 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2170 states.
[2025-05-07 17:30:28,586 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170.
[2025-05-07 17:30:28,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2170 states, 44 states have (on average 49.22727272727273) internal successors, (2166), 1365 states have internal predecessors, (2166), 2123 states have call successors, (2123), 22 states have call predecessors, (2123), 22 states have return successors, (19167), 783 states have call predecessors, (19167), 2123 states have call successors, (19167)
[2025-05-07 17:30:29,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 23456 transitions.
[2025-05-07 17:30:29,333 INFO  L79                 Accepts]: Start accepts. Automaton has 2170 states and 23456 transitions. Word has length 16
[2025-05-07 17:30:29,334 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:29,334 INFO  L485      AbstractCegarLoop]: Abstraction has 2170 states and 23456 transitions.
[2025-05-07 17:30:29,334 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:30:29,334 INFO  L278                IsEmpty]: Start isEmpty. Operand 2170 states and 23456 transitions.
[2025-05-07 17:30:30,077 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:30:30,077 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:30,077 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:30,077 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-05-07 17:30:30,077 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:30,081 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:30,081 INFO  L85        PathProgramCache]: Analyzing trace with hash -1349536879, now seen corresponding path program 1 times
[2025-05-07 17:30:30,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:30,081 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717505180]
[2025-05-07 17:30:30,082 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:30,082 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:30,084 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:30:30,086 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:30:30,086 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:30,086 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:30,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:30:30,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:30,104 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717505180]
[2025-05-07 17:30:30,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717505180] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:30,104 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:30,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:30:30,104 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580996547]
[2025-05-07 17:30:30,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:30,104 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:30:30,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:30,104 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:30:30,105 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:30,105 INFO  L87              Difference]: Start difference. First operand 2170 states and 23456 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:30:33,521 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:33,521 INFO  L93              Difference]: Finished difference Result 2170 states and 23454 transitions.
[2025-05-07 17:30:33,522 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:30:33,522 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:30:33,522 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:35,012 INFO  L225             Difference]: With dead ends: 2170
[2025-05-07 17:30:35,012 INFO  L226             Difference]: Without dead ends: 2170
[2025-05-07 17:30:35,012 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:35,012 INFO  L437           NwaCegarLoop]: 937 mSDtfsCounter, 49 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:35,013 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1758 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-05-07 17:30:35,013 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2170 states.
[2025-05-07 17:30:40,885 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170.
[2025-05-07 17:30:40,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2170 states, 44 states have (on average 49.22727272727273) internal successors, (2166), 1365 states have internal predecessors, (2166), 2123 states have call successors, (2123), 22 states have call predecessors, (2123), 22 states have return successors, (19165), 783 states have call predecessors, (19165), 2123 states have call successors, (19165)
[2025-05-07 17:30:41,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 23454 transitions.
[2025-05-07 17:30:41,617 INFO  L79                 Accepts]: Start accepts. Automaton has 2170 states and 23454 transitions. Word has length 16
[2025-05-07 17:30:41,617 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:41,617 INFO  L485      AbstractCegarLoop]: Abstraction has 2170 states and 23454 transitions.
[2025-05-07 17:30:41,617 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:30:41,617 INFO  L278                IsEmpty]: Start isEmpty. Operand 2170 states and 23454 transitions.
[2025-05-07 17:30:42,474 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:30:42,474 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:42,474 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:42,474 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-05-07 17:30:42,474 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:42,478 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:42,478 INFO  L85        PathProgramCache]: Analyzing trace with hash 977390641, now seen corresponding path program 1 times
[2025-05-07 17:30:42,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:42,478 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884781854]
[2025-05-07 17:30:42,478 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:42,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:42,481 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:30:42,482 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:30:42,482 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:42,482 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:42,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:30:42,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:42,498 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884781854]
[2025-05-07 17:30:42,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884781854] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:42,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:42,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:30:42,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501575699]
[2025-05-07 17:30:42,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:42,498 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:30:42,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:42,498 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:30:42,498 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:42,499 INFO  L87              Difference]: Start difference. First operand 2170 states and 23454 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:30:46,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:46,374 INFO  L93              Difference]: Finished difference Result 2528 states and 29057 transitions.
[2025-05-07 17:30:46,374 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:30:46,374 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:30:46,374 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:48,221 INFO  L225             Difference]: With dead ends: 2528
[2025-05-07 17:30:48,222 INFO  L226             Difference]: Without dead ends: 2528
[2025-05-07 17:30:48,222 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:48,222 INFO  L437           NwaCegarLoop]: 677 mSDtfsCounter, 49 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:48,222 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1394 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-05-07 17:30:48,223 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2528 states.
[2025-05-07 17:30:56,329 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2526.
[2025-05-07 17:30:56,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2526 states, 52 states have (on average 45.65384615384615) internal successors, (2374), 1561 states have internal predecessors, (2374), 2471 states have call successors, (2471), 26 states have call predecessors, (2471), 26 states have return successors, (24210), 939 states have call predecessors, (24210), 2471 states have call successors, (24210)
[2025-05-07 17:30:57,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 29055 transitions.
[2025-05-07 17:30:57,283 INFO  L79                 Accepts]: Start accepts. Automaton has 2526 states and 29055 transitions. Word has length 16
[2025-05-07 17:30:57,283 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:57,283 INFO  L485      AbstractCegarLoop]: Abstraction has 2526 states and 29055 transitions.
[2025-05-07 17:30:57,283 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:30:57,283 INFO  L278                IsEmpty]: Start isEmpty. Operand 2526 states and 29055 transitions.
[2025-05-07 17:30:58,324 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:30:58,324 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:58,324 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:58,325 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-05-07 17:30:58,325 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:58,325 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:58,325 INFO  L85        PathProgramCache]: Analyzing trace with hash 321852101, now seen corresponding path program 1 times
[2025-05-07 17:30:58,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:58,326 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919354755]
[2025-05-07 17:30:58,326 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:58,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:58,329 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:30:58,331 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:30:58,331 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:58,331 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:58,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:30:58,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:58,347 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919354755]
[2025-05-07 17:30:58,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919354755] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:58,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:58,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:30:58,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634654908]
[2025-05-07 17:30:58,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:58,347 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:30:58,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:58,348 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:30:58,348 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:58,348 INFO  L87              Difference]: Start difference. First operand 2526 states and 29055 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:31:02,425 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:02,425 INFO  L93              Difference]: Finished difference Result 2528 states and 29051 transitions.
[2025-05-07 17:31:02,426 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:31:02,426 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:31:02,426 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:04,186 INFO  L225             Difference]: With dead ends: 2528
[2025-05-07 17:31:04,186 INFO  L226             Difference]: Without dead ends: 2528
[2025-05-07 17:31:04,186 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:04,187 INFO  L437           NwaCegarLoop]: 672 mSDtfsCounter, 49 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:04,187 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1377 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-05-07 17:31:04,188 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2528 states.
[2025-05-07 17:31:12,167 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2526.
[2025-05-07 17:31:12,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2526 states, 52 states have (on average 45.65384615384615) internal successors, (2374), 1561 states have internal predecessors, (2374), 2471 states have call successors, (2471), 26 states have call predecessors, (2471), 26 states have return successors, (24204), 939 states have call predecessors, (24204), 2471 states have call successors, (24204)
[2025-05-07 17:31:13,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 29049 transitions.
[2025-05-07 17:31:13,117 INFO  L79                 Accepts]: Start accepts. Automaton has 2526 states and 29049 transitions. Word has length 16
[2025-05-07 17:31:13,117 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:13,117 INFO  L485      AbstractCegarLoop]: Abstraction has 2526 states and 29049 transitions.
[2025-05-07 17:31:13,117 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:31:13,117 INFO  L278                IsEmpty]: Start isEmpty. Operand 2526 states and 29049 transitions.
[2025-05-07 17:31:14,360 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:31:14,360 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:14,360 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:31:14,360 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-05-07 17:31:14,360 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:14,364 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:14,364 INFO  L85        PathProgramCache]: Analyzing trace with hash 2141566479, now seen corresponding path program 1 times
[2025-05-07 17:31:14,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:14,364 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056375384]
[2025-05-07 17:31:14,364 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:31:14,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:14,368 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:31:14,369 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:31:14,369 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:31:14,369 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:14,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:31:14,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:14,388 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056375384]
[2025-05-07 17:31:14,388 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056375384] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:31:14,388 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:31:14,388 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:31:14,388 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77530496]
[2025-05-07 17:31:14,388 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:31:14,388 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:31:14,388 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:14,389 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:31:14,389 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:14,389 INFO  L87              Difference]: Start difference. First operand 2526 states and 29049 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:31:19,396 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:19,396 INFO  L93              Difference]: Finished difference Result 3240 states and 44161 transitions.
[2025-05-07 17:31:19,396 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:31:19,397 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:31:19,397 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:22,572 INFO  L225             Difference]: With dead ends: 3240
[2025-05-07 17:31:22,573 INFO  L226             Difference]: Without dead ends: 3240
[2025-05-07 17:31:22,573 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:22,573 INFO  L437           NwaCegarLoop]: 940 mSDtfsCounter, 49 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:22,573 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1757 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-05-07 17:31:22,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3240 states.
[2025-05-07 17:31:35,030 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 3238.
[2025-05-07 17:31:35,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3238 states, 68 states have (on average 46.088235294117645) internal successors, (3134), 1953 states have internal predecessors, (3134), 3167 states have call successors, (3167), 34 states have call predecessors, (3167), 34 states have return successors, (37858), 1251 states have call predecessors, (37858), 3167 states have call successors, (37858)
[2025-05-07 17:31:36,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 44159 transitions.
[2025-05-07 17:31:36,907 INFO  L79                 Accepts]: Start accepts. Automaton has 3238 states and 44159 transitions. Word has length 16
[2025-05-07 17:31:36,907 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:36,907 INFO  L485      AbstractCegarLoop]: Abstraction has 3238 states and 44159 transitions.
[2025-05-07 17:31:36,907 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:31:36,907 INFO  L278                IsEmpty]: Start isEmpty. Operand 3238 states and 44159 transitions.
[2025-05-07 17:31:38,214 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:31:38,214 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:38,214 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:31:38,214 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-05-07 17:31:38,214 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:38,218 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:38,218 INFO  L85        PathProgramCache]: Analyzing trace with hash 168793513, now seen corresponding path program 1 times
[2025-05-07 17:31:38,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:38,218 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927946023]
[2025-05-07 17:31:38,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:31:38,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:38,222 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:31:38,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:31:38,225 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:31:38,225 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:38,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:31:38,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:38,242 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927946023]
[2025-05-07 17:31:38,242 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927946023] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:31:38,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:31:38,242 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:31:38,242 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332100929]
[2025-05-07 17:31:38,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:31:38,243 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:31:38,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:38,243 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:31:38,243 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:38,243 INFO  L87              Difference]: Start difference. First operand 3238 states and 44159 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-05-07 17:31:48,025 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:48,025 INFO  L93              Difference]: Finished difference Result 3484 states and 87949 transitions.
[2025-05-07 17:31:48,026 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:31:48,026 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-05-07 17:31:48,026 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:54,304 INFO  L225             Difference]: With dead ends: 3484
[2025-05-07 17:31:54,304 INFO  L226             Difference]: Without dead ends: 3484
[2025-05-07 17:31:54,304 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:31:54,305 INFO  L437           NwaCegarLoop]: 1068 mSDtfsCounter, 49 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:54,305 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 2083 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time]
[2025-05-07 17:31:54,306 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3484 states.
[2025-05-07 17:32:24,592 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 3416.
[2025-05-07 17:32:24,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3416 states, 72 states have (on average 44.916666666666664) internal successors, (3234), 2051 states have internal predecessors, (3234), 3341 states have call successors, (3341), 36 states have call predecessors, (3341), 36 states have return successors, (40671), 1329 states have call predecessors, (40671), 3341 states have call successors, (40671)
[2025-05-07 17:32:26,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 47246 transitions.
[2025-05-07 17:32:26,367 INFO  L79                 Accepts]: Start accepts. Automaton has 3416 states and 47246 transitions. Word has length 16
[2025-05-07 17:32:26,367 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:32:26,367 INFO  L485      AbstractCegarLoop]: Abstraction has 3416 states and 47246 transitions.
[2025-05-07 17:32:26,367 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-05-07 17:32:26,367 INFO  L278                IsEmpty]: Start isEmpty. Operand 3416 states and 47246 transitions.
[2025-05-07 17:32:27,748 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:32:27,748 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:32:27,748 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:32:27,748 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-05-07 17:32:27,748 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:32:27,754 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:32:27,755 INFO  L85        PathProgramCache]: Analyzing trace with hash 1260130335, now seen corresponding path program 1 times
[2025-05-07 17:32:27,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:32:27,755 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926467036]
[2025-05-07 17:32:27,755 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:32:27,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:32:27,757 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:32:27,759 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:32:27,759 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:32:27,759 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:32:27,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:32:27,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:32:27,773 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926467036]
[2025-05-07 17:32:27,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926467036] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:32:27,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:32:27,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:32:27,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510344546]
[2025-05-07 17:32:27,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:32:27,773 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:32:27,773 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:32:27,774 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:32:27,774 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:32:27,774 INFO  L87              Difference]: Start difference. First operand 3416 states and 47246 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:32:32,858 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:32:32,858 INFO  L93              Difference]: Finished difference Result 3418 states and 46804 transitions.
[2025-05-07 17:32:32,859 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:32:32,859 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:32:32,859 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:32:36,195 INFO  L225             Difference]: With dead ends: 3418
[2025-05-07 17:32:36,195 INFO  L226             Difference]: Without dead ends: 3418
[2025-05-07 17:32:36,195 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:32:36,196 INFO  L437           NwaCegarLoop]: 874 mSDtfsCounter, 49 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:32:36,196 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1625 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-05-07 17:32:36,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3418 states.
[2025-05-07 17:32:51,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3416.
[2025-05-07 17:32:51,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3416 states, 72 states have (on average 44.888888888888886) internal successors, (3232), 2051 states have internal predecessors, (3232), 3341 states have call successors, (3341), 36 states have call predecessors, (3341), 36 states have return successors, (40229), 1329 states have call predecessors, (40229), 3341 states have call successors, (40229)
[2025-05-07 17:32:52,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 46802 transitions.
[2025-05-07 17:32:52,844 INFO  L79                 Accepts]: Start accepts. Automaton has 3416 states and 46802 transitions. Word has length 16
[2025-05-07 17:32:52,844 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:32:52,844 INFO  L485      AbstractCegarLoop]: Abstraction has 3416 states and 46802 transitions.
[2025-05-07 17:32:52,844 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:32:52,844 INFO  L278                IsEmpty]: Start isEmpty. Operand 3416 states and 46802 transitions.
[2025-05-07 17:32:54,218 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:32:54,218 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:32:54,218 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:32:54,218 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-05-07 17:32:54,218 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:32:54,222 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:32:54,222 INFO  L85        PathProgramCache]: Analyzing trace with hash -559584043, now seen corresponding path program 1 times
[2025-05-07 17:32:54,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:32:54,222 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566379353]
[2025-05-07 17:32:54,222 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:32:54,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:32:54,226 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:32:54,228 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:32:54,228 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:32:54,228 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:32:54,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:32:54,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:32:54,247 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566379353]
[2025-05-07 17:32:54,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566379353] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:32:54,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:32:54,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:32:54,247 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883384829]
[2025-05-07 17:32:54,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:32:54,248 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:32:54,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:32:54,248 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:32:54,248 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:32:54,248 INFO  L87              Difference]: Start difference. First operand 3416 states and 46802 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:32:59,333 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:32:59,333 INFO  L93              Difference]: Finished difference Result 3774 states and 54189 transitions.
[2025-05-07 17:32:59,333 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:32:59,333 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:32:59,333 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:33:03,553 INFO  L225             Difference]: With dead ends: 3774
[2025-05-07 17:33:03,553 INFO  L226             Difference]: Without dead ends: 3774
[2025-05-07 17:33:03,553 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:33:03,553 INFO  L437           NwaCegarLoop]: 762 mSDtfsCounter, 49 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:33:03,553 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1632 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-05-07 17:33:03,554 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3774 states.
[2025-05-07 17:33:23,017 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3772.
[2025-05-07 17:33:23,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3772 states, 80 states have (on average 42.875) internal successors, (3430), 2247 states have internal predecessors, (3430), 3689 states have call successors, (3689), 40 states have call predecessors, (3689), 40 states have return successors, (47068), 1485 states have call predecessors, (47068), 3689 states have call successors, (47068)
[2025-05-07 17:33:25,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 54187 transitions.
[2025-05-07 17:33:25,340 INFO  L79                 Accepts]: Start accepts. Automaton has 3772 states and 54187 transitions. Word has length 16
[2025-05-07 17:33:25,340 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:33:25,340 INFO  L485      AbstractCegarLoop]: Abstraction has 3772 states and 54187 transitions.
[2025-05-07 17:33:25,340 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:33:25,340 INFO  L278                IsEmpty]: Start isEmpty. Operand 3772 states and 54187 transitions.
[2025-05-07 17:33:26,809 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:33:26,809 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:33:26,809 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:33:26,809 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-05-07 17:33:26,810 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:33:26,813 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:33:26,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 1842218254, now seen corresponding path program 1 times
[2025-05-07 17:33:26,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:33:26,813 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26052077]
[2025-05-07 17:33:26,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:33:26,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:33:26,816 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:33:26,818 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:33:26,818 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:33:26,818 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:26,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:33:26,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:33:26,832 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26052077]
[2025-05-07 17:33:26,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26052077] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:33:26,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:33:26,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:33:26,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314867538]
[2025-05-07 17:33:26,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:33:26,833 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:33:26,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:33:26,833 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:33:26,833 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:33:26,833 INFO  L87              Difference]: Start difference. First operand 3772 states and 54187 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:33:32,273 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:33:32,273 INFO  L93              Difference]: Finished difference Result 3774 states and 54187 transitions.
[2025-05-07 17:33:32,274 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:33:32,274 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:33:32,274 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:33:36,542 INFO  L225             Difference]: With dead ends: 3774
[2025-05-07 17:33:36,542 INFO  L226             Difference]: Without dead ends: 3774
[2025-05-07 17:33:36,542 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:33:36,542 INFO  L437           NwaCegarLoop]: 761 mSDtfsCounter, 49 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:33:36,542 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1628 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-05-07 17:33:36,544 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3774 states.
[2025-05-07 17:33:54,965 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3772.
[2025-05-07 17:33:54,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3772 states, 80 states have (on average 42.875) internal successors, (3430), 2247 states have internal predecessors, (3430), 3689 states have call successors, (3689), 40 states have call predecessors, (3689), 40 states have return successors, (47066), 1485 states have call predecessors, (47066), 3689 states have call successors, (47066)
[2025-05-07 17:33:57,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 54185 transitions.
[2025-05-07 17:33:57,321 INFO  L79                 Accepts]: Start accepts. Automaton has 3772 states and 54185 transitions. Word has length 16
[2025-05-07 17:33:57,321 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:33:57,321 INFO  L485      AbstractCegarLoop]: Abstraction has 3772 states and 54185 transitions.
[2025-05-07 17:33:57,321 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:33:57,321 INFO  L278                IsEmpty]: Start isEmpty. Operand 3772 states and 54185 transitions.
[2025-05-07 17:33:58,792 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:33:58,792 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:33:58,792 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:33:58,792 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-05-07 17:33:58,792 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:33:58,796 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:33:58,796 INFO  L85        PathProgramCache]: Analyzing trace with hash -1215122583, now seen corresponding path program 1 times
[2025-05-07 17:33:58,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:33:58,796 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297440847]
[2025-05-07 17:33:58,796 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:33:58,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:33:58,799 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:33:58,801 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:33:58,801 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:33:58,801 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:58,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:33:58,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:33:58,816 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297440847]
[2025-05-07 17:33:58,816 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297440847] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:33:58,816 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:33:58,816 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:33:58,816 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207880226]
[2025-05-07 17:33:58,816 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:33:58,816 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:33:58,816 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:33:58,816 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:33:58,816 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:33:58,816 INFO  L87              Difference]: Start difference. First operand 3772 states and 54185 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-05-07 17:34:07,776 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:34:07,776 INFO  L93              Difference]: Finished difference Result 3848 states and 100495 transitions.
[2025-05-07 17:34:07,777 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:34:07,777 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-05-07 17:34:07,777 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:34:15,145 INFO  L225             Difference]: With dead ends: 3848
[2025-05-07 17:34:15,145 INFO  L226             Difference]: Without dead ends: 3848
[2025-05-07 17:34:15,146 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:34:15,146 INFO  L437           NwaCegarLoop]: 1073 mSDtfsCounter, 50 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:34:15,146 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1947 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time]
[2025-05-07 17:34:15,147 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3848 states.
[2025-05-07 17:34:45,362 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 3772.
[2025-05-07 17:34:45,378 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3772 states, 80 states have (on average 42.875) internal successors, (3430), 2247 states have internal predecessors, (3430), 3689 states have call successors, (3689), 40 states have call predecessors, (3689), 40 states have return successors, (46670), 1485 states have call predecessors, (46670), 3689 states have call successors, (46670)
[2025-05-07 17:34:47,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 53789 transitions.
[2025-05-07 17:34:47,673 INFO  L79                 Accepts]: Start accepts. Automaton has 3772 states and 53789 transitions. Word has length 16
[2025-05-07 17:34:47,673 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:34:47,673 INFO  L485      AbstractCegarLoop]: Abstraction has 3772 states and 53789 transitions.
[2025-05-07 17:34:47,673 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-05-07 17:34:47,673 INFO  L278                IsEmpty]: Start isEmpty. Operand 3772 states and 53789 transitions.
[2025-05-07 17:34:49,143 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:34:49,143 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:34:49,144 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:34:49,144 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-05-07 17:34:49,144 INFO  L403      AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:34:49,149 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:34:49,149 INFO  L85        PathProgramCache]: Analyzing trace with hash 2142081477, now seen corresponding path program 1 times
[2025-05-07 17:34:49,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:34:49,149 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346015325]
[2025-05-07 17:34:49,149 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:34:49,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:34:49,152 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:34:49,155 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:34:49,155 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:34:49,155 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:34:49,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:34:49,173 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:34:49,173 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346015325]
[2025-05-07 17:34:49,173 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346015325] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:34:49,173 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:34:49,173 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:34:49,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117154117]
[2025-05-07 17:34:49,173 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:34:49,173 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:34:49,173 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:34:49,174 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:34:49,174 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:34:49,174 INFO  L87              Difference]: Start difference. First operand 3772 states and 53789 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:34:55,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:34:55,460 INFO  L93              Difference]: Finished difference Result 4130 states and 63742 transitions.
[2025-05-07 17:34:55,462 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:34:55,462 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:34:55,462 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:35:00,831 INFO  L225             Difference]: With dead ends: 4130
[2025-05-07 17:35:00,831 INFO  L226             Difference]: Without dead ends: 4130
[2025-05-07 17:35:00,831 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:35:00,831 INFO  L437           NwaCegarLoop]: 782 mSDtfsCounter, 49 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:35:00,832 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1449 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-05-07 17:35:00,833 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4130 states.
[2025-05-07 17:35:23,673 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 4128.
[2025-05-07 17:35:23,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4128 states, 88 states have (on average 45.18181818181818) internal successors, (3976), 2443 states have internal predecessors, (3976), 4037 states have call successors, (4037), 44 states have call predecessors, (4037), 44 states have return successors, (55727), 1641 states have call predecessors, (55727), 4037 states have call successors, (55727)
[2025-05-07 17:35:26,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 63740 transitions.
[2025-05-07 17:35:26,671 INFO  L79                 Accepts]: Start accepts. Automaton has 4128 states and 63740 transitions. Word has length 16
[2025-05-07 17:35:26,671 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:35:26,671 INFO  L485      AbstractCegarLoop]: Abstraction has 4128 states and 63740 transitions.
[2025-05-07 17:35:26,671 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:35:26,671 INFO  L278                IsEmpty]: Start isEmpty. Operand 4128 states and 63740 transitions.
[2025-05-07 17:35:28,480 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:35:28,480 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:35:28,480 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:35:28,480 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-05-07 17:35:28,480 INFO  L403      AbstractCegarLoop]: === Iteration 27 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:35:28,484 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:35:28,484 INFO  L85        PathProgramCache]: Analyzing trace with hash -106662232, now seen corresponding path program 1 times
[2025-05-07 17:35:28,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:35:28,484 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709860410]
[2025-05-07 17:35:28,484 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:35:28,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:35:28,486 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:35:28,488 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:35:28,488 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:35:28,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:35:28,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:35:28,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:35:28,505 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709860410]
[2025-05-07 17:35:28,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709860410] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:35:28,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:35:28,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:35:28,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948466887]
[2025-05-07 17:35:28,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:35:28,505 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:35:28,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:35:28,505 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:35:28,505 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:35:28,506 INFO  L87              Difference]: Start difference. First operand 4128 states and 63740 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:35:34,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:35:34,250 INFO  L93              Difference]: Finished difference Result 4130 states and 63738 transitions.
[2025-05-07 17:35:34,250 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:35:34,250 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:35:34,250 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:35:39,633 INFO  L225             Difference]: With dead ends: 4130
[2025-05-07 17:35:39,633 INFO  L226             Difference]: Without dead ends: 4130
[2025-05-07 17:35:39,633 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:35:39,633 INFO  L437           NwaCegarLoop]: 781 mSDtfsCounter, 49 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:35:39,634 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1443 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-05-07 17:35:39,635 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4130 states.
[2025-05-07 17:36:03,580 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 4128.
[2025-05-07 17:36:03,599 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4128 states, 88 states have (on average 45.18181818181818) internal successors, (3976), 2443 states have internal predecessors, (3976), 4037 states have call successors, (4037), 44 states have call predecessors, (4037), 44 states have return successors, (55723), 1641 states have call predecessors, (55723), 4037 states have call successors, (55723)
[2025-05-07 17:36:06,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 63736 transitions.
[2025-05-07 17:36:06,565 INFO  L79                 Accepts]: Start accepts. Automaton has 4128 states and 63736 transitions. Word has length 16
[2025-05-07 17:36:06,565 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:36:06,565 INFO  L485      AbstractCegarLoop]: Abstraction has 4128 states and 63736 transitions.
[2025-05-07 17:36:06,565 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:36:06,565 INFO  L278                IsEmpty]: Start isEmpty. Operand 4128 states and 63736 transitions.
[2025-05-07 17:36:08,255 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:36:08,256 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:36:08,256 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:36:08,256 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-05-07 17:36:08,256 INFO  L403      AbstractCegarLoop]: === Iteration 28 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:36:08,256 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:36:08,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 1057513606, now seen corresponding path program 1 times
[2025-05-07 17:36:08,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:36:08,256 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770074079]
[2025-05-07 17:36:08,256 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:36:08,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:36:08,260 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:36:08,262 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:36:08,262 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:36:08,262 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:36:08,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:36:08,279 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:36:08,279 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770074079]
[2025-05-07 17:36:08,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770074079] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:36:08,279 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:36:08,279 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:36:08,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994867939]
[2025-05-07 17:36:08,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:36:08,279 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:36:08,279 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:36:08,280 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:36:08,280 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:36:08,280 INFO  L87              Difference]: Start difference. First operand 4128 states and 63736 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:36:14,041 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:36:14,041 INFO  L93              Difference]: Finished difference Result 4130 states and 63736 transitions.
[2025-05-07 17:36:14,042 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:36:14,042 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:36:14,042 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:36:19,297 INFO  L225             Difference]: With dead ends: 4130
[2025-05-07 17:36:19,297 INFO  L226             Difference]: Without dead ends: 4130
[2025-05-07 17:36:19,297 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:36:19,297 INFO  L437           NwaCegarLoop]: 784 mSDtfsCounter, 49 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:36:19,298 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1451 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-05-07 17:36:19,300 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4130 states.
[2025-05-07 17:36:43,762 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 4128.
[2025-05-07 17:36:43,781 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4128 states, 88 states have (on average 45.18181818181818) internal successors, (3976), 2443 states have internal predecessors, (3976), 4037 states have call successors, (4037), 44 states have call predecessors, (4037), 44 states have return successors, (55721), 1641 states have call predecessors, (55721), 4037 states have call successors, (55721)
[2025-05-07 17:36:46,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 63734 transitions.
[2025-05-07 17:36:46,838 INFO  L79                 Accepts]: Start accepts. Automaton has 4128 states and 63734 transitions. Word has length 16
[2025-05-07 17:36:46,838 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:36:46,838 INFO  L485      AbstractCegarLoop]: Abstraction has 4128 states and 63734 transitions.
[2025-05-07 17:36:46,838 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:36:46,838 INFO  L278                IsEmpty]: Start isEmpty. Operand 4128 states and 63734 transitions.
[2025-05-07 17:36:48,576 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:36:48,576 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:36:48,576 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:36:48,576 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-05-07 17:36:48,576 INFO  L403      AbstractCegarLoop]: === Iteration 29 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:36:48,580 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:36:48,580 INFO  L85        PathProgramCache]: Analyzing trace with hash -1344288691, now seen corresponding path program 1 times
[2025-05-07 17:36:48,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:36:48,580 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253109370]
[2025-05-07 17:36:48,580 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:36:48,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:36:48,583 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:36:48,585 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:36:48,585 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:36:48,585 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:36:48,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:36:48,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:36:48,599 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253109370]
[2025-05-07 17:36:48,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253109370] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:36:48,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:36:48,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:36:48,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60765018]
[2025-05-07 17:36:48,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:36:48,600 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:36:48,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:36:48,600 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:36:48,600 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:36:48,600 INFO  L87              Difference]: Start difference. First operand 4128 states and 63734 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:36:54,350 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:36:54,350 INFO  L93              Difference]: Finished difference Result 4130 states and 63734 transitions.
[2025-05-07 17:36:54,351 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:36:54,351 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:36:54,351 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:36:59,817 INFO  L225             Difference]: With dead ends: 4130
[2025-05-07 17:36:59,817 INFO  L226             Difference]: Without dead ends: 4130
[2025-05-07 17:36:59,817 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:36:59,818 INFO  L437           NwaCegarLoop]: 966 mSDtfsCounter, 49 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:36:59,818 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1825 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-05-07 17:36:59,819 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4130 states.
[2025-05-07 17:37:22,573 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 4128.
[2025-05-07 17:37:22,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4128 states, 88 states have (on average 45.18181818181818) internal successors, (3976), 2443 states have internal predecessors, (3976), 4037 states have call successors, (4037), 44 states have call predecessors, (4037), 44 states have return successors, (55719), 1641 states have call predecessors, (55719), 4037 states have call successors, (55719)
[2025-05-07 17:37:25,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 63732 transitions.
[2025-05-07 17:37:25,097 INFO  L79                 Accepts]: Start accepts. Automaton has 4128 states and 63732 transitions. Word has length 16
[2025-05-07 17:37:25,097 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:37:25,097 INFO  L485      AbstractCegarLoop]: Abstraction has 4128 states and 63732 transitions.
[2025-05-07 17:37:25,097 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:37:25,097 INFO  L278                IsEmpty]: Start isEmpty. Operand 4128 states and 63732 transitions.
[2025-05-07 17:37:26,670 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:37:26,670 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:37:26,670 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:37:26,671 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-05-07 17:37:26,671 INFO  L403      AbstractCegarLoop]: === Iteration 30 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:37:26,671 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:37:26,671 INFO  L85        PathProgramCache]: Analyzing trace with hash 1713052146, now seen corresponding path program 1 times
[2025-05-07 17:37:26,671 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:37:26,671 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39552907]
[2025-05-07 17:37:26,671 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:37:26,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:37:26,675 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:37:26,677 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:37:26,677 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:37:26,677 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:37:26,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:37:26,697 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:37:26,697 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39552907]
[2025-05-07 17:37:26,697 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39552907] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:37:26,697 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:37:26,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:37:26,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395983786]
[2025-05-07 17:37:26,697 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:37:26,697 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:37:26,697 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:37:26,697 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:37:26,698 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:37:26,698 INFO  L87              Difference]: Start difference. First operand 4128 states and 63732 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:37:32,538 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:37:32,538 INFO  L93              Difference]: Finished difference Result 4128 states and 63730 transitions.
[2025-05-07 17:37:32,539 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:37:32,539 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:37:32,539 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:37:38,167 INFO  L225             Difference]: With dead ends: 4128
[2025-05-07 17:37:38,167 INFO  L226             Difference]: Without dead ends: 4128
[2025-05-07 17:37:38,167 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:37:38,167 INFO  L437           NwaCegarLoop]: 782 mSDtfsCounter, 49 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:37:38,167 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1443 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-05-07 17:37:38,168 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4128 states.
[2025-05-07 17:37:59,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 4128.
[2025-05-07 17:37:59,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4128 states, 88 states have (on average 45.18181818181818) internal successors, (3976), 2443 states have internal predecessors, (3976), 4037 states have call successors, (4037), 44 states have call predecessors, (4037), 44 states have return successors, (55717), 1641 states have call predecessors, (55717), 4037 states have call successors, (55717)
[2025-05-07 17:38:02,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 63730 transitions.
[2025-05-07 17:38:02,203 INFO  L79                 Accepts]: Start accepts. Automaton has 4128 states and 63730 transitions. Word has length 16
[2025-05-07 17:38:02,203 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:38:02,203 INFO  L485      AbstractCegarLoop]: Abstraction has 4128 states and 63730 transitions.
[2025-05-07 17:38:02,203 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:38:02,203 INFO  L278                IsEmpty]: Start isEmpty. Operand 4128 states and 63730 transitions.
[2025-05-07 17:38:04,008 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:38:04,008 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:38:04,008 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:38:04,009 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-05-07 17:38:04,009 INFO  L403      AbstractCegarLoop]: === Iteration 31 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:38:04,011 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:38:04,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 2146238742, now seen corresponding path program 1 times
[2025-05-07 17:38:04,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:38:04,012 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020922943]
[2025-05-07 17:38:04,012 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:38:04,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:38:04,015 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:38:04,016 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:38:04,016 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:38:04,017 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:38:04,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:38:04,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:38:04,031 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020922943]
[2025-05-07 17:38:04,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020922943] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:38:04,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:38:04,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:38:04,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506947457]
[2025-05-07 17:38:04,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:38:04,031 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:38:04,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:38:04,031 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:38:04,032 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:38:04,032 INFO  L87              Difference]: Start difference. First operand 4128 states and 63730 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:38:10,306 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:38:10,306 INFO  L93              Difference]: Finished difference Result 4484 states and 74583 transitions.
[2025-05-07 17:38:10,307 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:38:10,307 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-05-07 17:38:10,307 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:38:17,645 INFO  L225             Difference]: With dead ends: 4484
[2025-05-07 17:38:17,645 INFO  L226             Difference]: Without dead ends: 4484
[2025-05-07 17:38:17,645 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:38:17,645 INFO  L437           NwaCegarLoop]: 782 mSDtfsCounter, 49 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:38:17,645 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1434 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-05-07 17:38:17,647 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4484 states.
[2025-05-07 17:38:39,438 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 4484.
[2025-05-07 17:38:39,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4484 states, 96 states have (on average 47.145833333333336) internal successors, (4526), 2639 states have internal predecessors, (4526), 4385 states have call successors, (4385), 48 states have call predecessors, (4385), 48 states have return successors, (65672), 1797 states have call predecessors, (65672), 4385 states have call successors, (65672)
[2025-05-07 17:38:42,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 74583 transitions.
[2025-05-07 17:38:42,943 INFO  L79                 Accepts]: Start accepts. Automaton has 4484 states and 74583 transitions. Word has length 16
[2025-05-07 17:38:42,943 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:38:42,943 INFO  L485      AbstractCegarLoop]: Abstraction has 4484 states and 74583 transitions.
[2025-05-07 17:38:42,943 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:38:42,943 INFO  L278                IsEmpty]: Start isEmpty. Operand 4484 states and 74583 transitions.
[2025-05-07 17:38:45,535 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-05-07 17:38:45,535 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:38:45,535 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:38:45,535 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-05-07 17:38:45,535 INFO  L403      AbstractCegarLoop]: === Iteration 32 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:38:45,536 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:38:45,536 INFO  L85        PathProgramCache]: Analyzing trace with hash 2058746988, now seen corresponding path program 1 times
[2025-05-07 17:38:45,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:38:45,536 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260631919]
[2025-05-07 17:38:45,536 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:38:45,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:38:45,539 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-05-07 17:38:45,541 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-05-07 17:38:45,541 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:38:45,542 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:38:45,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:38:45,563 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:38:45,564 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260631919]
[2025-05-07 17:38:45,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260631919] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:38:45,564 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89172579]
[2025-05-07 17:38:45,564 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:38:45,564 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:38:45,565 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:38:45,567 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:38:45,568 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:38:45,609 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-05-07 17:38:45,636 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-05-07 17:38:45,636 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:38:45,636 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:38:45,637 INFO  L256         TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-05-07 17:38:45,638 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:38:45,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:38:45,650 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:38:45,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:38:45,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [89172579] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:38:45,876 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:38:45,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6
[2025-05-07 17:38:45,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734304456]
[2025-05-07 17:38:45,876 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:38:45,876 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:38:45,876 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:38:45,876 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:38:45,876 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:38:45,876 INFO  L87              Difference]: Start difference. First operand 4484 states and 74583 transitions. Second operand  has 6 states, 4 states have (on average 2.5) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:39:58,115 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:39:58,116 INFO  L93              Difference]: Finished difference Result 4668 states and 165812 transitions.
[2025-05-07 17:39:58,117 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:39:58,117 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.5) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 19
[2025-05-07 17:39:58,117 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:40:13,617 INFO  L225             Difference]: With dead ends: 4668
[2025-05-07 17:40:13,617 INFO  L226             Difference]: Without dead ends: 4668
[2025-05-07 17:40:13,617 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:40:13,617 INFO  L437           NwaCegarLoop]: 1280 mSDtfsCounter, 288 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 8930 mSolverCounterSat, 1563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2975 SdHoareTripleChecker+Invalid, 10493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1563 IncrementalHoareTripleChecker+Valid, 8930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:40:13,617 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2975 Invalid, 10493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1563 Valid, 8930 Invalid, 0 Unknown, 0 Unchecked, 64.1s Time]
[2025-05-07 17:40:13,626 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4668 states.
[2025-05-07 17:40:55,108 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4484.
[2025-05-07 17:40:55,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4484 states, 96 states have (on average 47.145833333333336) internal successors, (4526), 2639 states have internal predecessors, (4526), 4385 states have call successors, (4385), 48 states have call predecessors, (4385), 48 states have return successors, (52271), 1797 states have call predecessors, (52271), 4385 states have call successors, (52271)
[2025-05-07 17:40:57,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 61182 transitions.
[2025-05-07 17:40:57,925 INFO  L79                 Accepts]: Start accepts. Automaton has 4484 states and 61182 transitions. Word has length 19
[2025-05-07 17:40:57,925 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:40:57,925 INFO  L485      AbstractCegarLoop]: Abstraction has 4484 states and 61182 transitions.
[2025-05-07 17:40:57,925 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.5) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:40:57,925 INFO  L278                IsEmpty]: Start isEmpty. Operand 4484 states and 61182 transitions.
[2025-05-07 17:41:00,252 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:41:00,253 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:41:00,253 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:41:00,257 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-05-07 17:41:00,453 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:41:00,454 INFO  L403      AbstractCegarLoop]: === Iteration 33 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:41:00,469 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:41:00,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 1127641240, now seen corresponding path program 1 times
[2025-05-07 17:41:00,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:41:00,470 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159773496]
[2025-05-07 17:41:00,470 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:41:00,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:41:00,481 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:41:00,483 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:41:00,483 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:41:00,483 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:41:00,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:41:00,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:41:00,503 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159773496]
[2025-05-07 17:41:00,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159773496] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:41:00,504 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:41:00,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:41:00,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760037488]
[2025-05-07 17:41:00,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:41:00,504 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:41:00,504 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:41:00,504 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:41:00,504 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:41:00,505 INFO  L87              Difference]: Start difference. First operand 4484 states and 61182 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:41:14,365 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:41:14,365 INFO  L93              Difference]: Finished difference Result 4940 states and 131737 transitions.
[2025-05-07 17:41:14,366 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:41:14,366 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:41:14,366 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:41:28,225 INFO  L225             Difference]: With dead ends: 4940
[2025-05-07 17:41:28,225 INFO  L226             Difference]: Without dead ends: 4940
[2025-05-07 17:41:28,226 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:41:28,226 INFO  L437           NwaCegarLoop]: 933 mSDtfsCounter, 49 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:41:28,226 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1728 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time]
[2025-05-07 17:41:28,227 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4940 states.
[2025-05-07 17:42:00,464 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4840.
[2025-05-07 17:42:00,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4840 states, 104 states have (on average 45.55769230769231) internal successors, (4738), 2835 states have internal predecessors, (4738), 4733 states have call successors, (4733), 52 states have call predecessors, (4733), 52 states have return successors, (61109), 1953 states have call predecessors, (61109), 4733 states have call successors, (61109)
[2025-05-07 17:42:03,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 70580 transitions.
[2025-05-07 17:42:03,512 INFO  L79                 Accepts]: Start accepts. Automaton has 4840 states and 70580 transitions. Word has length 20
[2025-05-07 17:42:03,512 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:42:03,512 INFO  L485      AbstractCegarLoop]: Abstraction has 4840 states and 70580 transitions.
[2025-05-07 17:42:03,512 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:42:03,512 INFO  L278                IsEmpty]: Start isEmpty. Operand 4840 states and 70580 transitions.
[2025-05-07 17:42:05,988 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:42:05,988 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:42:05,989 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:42:05,989 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-05-07 17:42:05,989 INFO  L403      AbstractCegarLoop]: === Iteration 34 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:42:05,989 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:42:05,989 INFO  L85        PathProgramCache]: Analyzing trace with hash -694829943, now seen corresponding path program 1 times
[2025-05-07 17:42:05,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:42:05,989 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404474183]
[2025-05-07 17:42:05,989 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:42:05,989 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:42:05,993 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:42:05,994 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:42:05,995 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:42:05,995 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:42:06,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:42:06,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:42:06,011 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404474183]
[2025-05-07 17:42:06,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404474183] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:42:06,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:42:06,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:42:06,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298852012]
[2025-05-07 17:42:06,011 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:42:06,011 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:42:06,011 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:42:06,012 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:42:06,012 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:42:06,012 INFO  L87              Difference]: Start difference. First operand 4840 states and 70580 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:42:12,967 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:42:12,967 INFO  L93              Difference]: Finished difference Result 5198 states and 78299 transitions.
[2025-05-07 17:42:12,968 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:42:12,968 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:42:12,968 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:42:21,658 INFO  L225             Difference]: With dead ends: 5198
[2025-05-07 17:42:21,658 INFO  L226             Difference]: Without dead ends: 5198
[2025-05-07 17:42:21,658 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:42:21,659 INFO  L437           NwaCegarLoop]: 873 mSDtfsCounter, 49 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:42:21,659 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1946 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-05-07 17:42:21,660 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5198 states.
[2025-05-07 17:42:41,051 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5198 to 5196.
[2025-05-07 17:42:41,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5196 states, 112 states have (on average 44.089285714285715) internal successors, (4938), 3031 states have internal predecessors, (4938), 5081 states have call successors, (5081), 56 states have call predecessors, (5081), 56 states have return successors, (68278), 2109 states have call predecessors, (68278), 5081 states have call successors, (68278)
[2025-05-07 17:42:44,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5196 states to 5196 states and 78297 transitions.
[2025-05-07 17:42:44,637 INFO  L79                 Accepts]: Start accepts. Automaton has 5196 states and 78297 transitions. Word has length 20
[2025-05-07 17:42:44,637 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:42:44,637 INFO  L485      AbstractCegarLoop]: Abstraction has 5196 states and 78297 transitions.
[2025-05-07 17:42:44,637 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:42:44,637 INFO  L278                IsEmpty]: Start isEmpty. Operand 5196 states and 78297 transitions.
[2025-05-07 17:42:47,297 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:42:47,298 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:42:47,298 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:42:47,298 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-05-07 17:42:47,298 INFO  L403      AbstractCegarLoop]: === Iteration 35 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:42:47,299 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:42:47,299 INFO  L85        PathProgramCache]: Analyzing trace with hash -1242488892, now seen corresponding path program 1 times
[2025-05-07 17:42:47,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:42:47,299 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380356046]
[2025-05-07 17:42:47,299 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:42:47,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:42:47,303 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:42:47,304 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:42:47,304 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:42:47,304 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:42:47,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:42:47,320 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:42:47,320 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380356046]
[2025-05-07 17:42:47,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380356046] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:42:47,320 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:42:47,320 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:42:47,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411440664]
[2025-05-07 17:42:47,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:42:47,321 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:42:47,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:42:47,321 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:42:47,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:42:47,321 INFO  L87              Difference]: Start difference. First operand 5196 states and 78297 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:42:58,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:42:58,347 INFO  L93              Difference]: Finished difference Result 5304 states and 145805 transitions.
[2025-05-07 17:42:58,348 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:42:58,348 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:42:58,348 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:43:13,343 INFO  L225             Difference]: With dead ends: 5304
[2025-05-07 17:43:13,343 INFO  L226             Difference]: Without dead ends: 5304
[2025-05-07 17:43:13,344 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:43:13,344 INFO  L437           NwaCegarLoop]: 1264 mSDtfsCounter, 49 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:43:13,344 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 2458 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time]
[2025-05-07 17:43:13,346 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5304 states.
[2025-05-07 17:43:45,531 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5304 to 5196.
[2025-05-07 17:43:45,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5196 states, 112 states have (on average 44.089285714285715) internal successors, (4938), 3031 states have internal predecessors, (4938), 5081 states have call successors, (5081), 56 states have call predecessors, (5081), 56 states have return successors, (67867), 2109 states have call predecessors, (67867), 5081 states have call successors, (67867)
[2025-05-07 17:43:49,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5196 states to 5196 states and 77886 transitions.
[2025-05-07 17:43:49,153 INFO  L79                 Accepts]: Start accepts. Automaton has 5196 states and 77886 transitions. Word has length 20
[2025-05-07 17:43:49,153 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:43:49,153 INFO  L485      AbstractCegarLoop]: Abstraction has 5196 states and 77886 transitions.
[2025-05-07 17:43:49,153 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:43:49,153 INFO  L278                IsEmpty]: Start isEmpty. Operand 5196 states and 77886 transitions.
[2025-05-07 17:43:52,086 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:43:52,087 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:43:52,087 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:43:52,087 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-05-07 17:43:52,087 INFO  L403      AbstractCegarLoop]: === Iteration 36 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:43:52,087 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:43:52,087 INFO  L85        PathProgramCache]: Analyzing trace with hash 612569362, now seen corresponding path program 1 times
[2025-05-07 17:43:52,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:43:52,087 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516085097]
[2025-05-07 17:43:52,087 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:43:52,087 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:43:52,091 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:43:52,092 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:43:52,092 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:43:52,092 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:43:52,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:43:52,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:43:52,106 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516085097]
[2025-05-07 17:43:52,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516085097] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:43:52,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:43:52,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:43:52,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780226674]
[2025-05-07 17:43:52,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:43:52,106 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:43:52,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:43:52,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:43:52,107 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:43:52,107 INFO  L87              Difference]: Start difference. First operand 5196 states and 77886 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:43:59,711 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:43:59,711 INFO  L93              Difference]: Finished difference Result 5554 states and 88799 transitions.
[2025-05-07 17:43:59,712 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:43:59,713 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:43:59,713 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:44:10,022 INFO  L225             Difference]: With dead ends: 5554
[2025-05-07 17:44:10,022 INFO  L226             Difference]: Without dead ends: 5554
[2025-05-07 17:44:10,022 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:44:10,023 INFO  L437           NwaCegarLoop]: 775 mSDtfsCounter, 49 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:44:10,023 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1422 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-05-07 17:44:10,024 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5554 states.
[2025-05-07 17:44:32,424 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5554 to 5552.
[2025-05-07 17:44:32,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5552 states, 120 states have (on average 45.75) internal successors, (5490), 3227 states have internal predecessors, (5490), 5429 states have call successors, (5429), 60 states have call predecessors, (5429), 60 states have return successors, (77878), 2265 states have call predecessors, (77878), 5429 states have call successors, (77878)
[2025-05-07 17:44:36,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 88797 transitions.
[2025-05-07 17:44:36,737 INFO  L79                 Accepts]: Start accepts. Automaton has 5552 states and 88797 transitions. Word has length 20
[2025-05-07 17:44:36,737 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:44:36,737 INFO  L485      AbstractCegarLoop]: Abstraction has 5552 states and 88797 transitions.
[2025-05-07 17:44:36,737 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:44:36,737 INFO  L278                IsEmpty]: Start isEmpty. Operand 5552 states and 88797 transitions.
[2025-05-07 17:44:39,545 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:44:39,545 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:44:39,545 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:44:39,545 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-05-07 17:44:39,545 INFO  L403      AbstractCegarLoop]: === Iteration 37 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:44:39,547 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:44:39,547 INFO  L85        PathProgramCache]: Analyzing trace with hash 316567678, now seen corresponding path program 1 times
[2025-05-07 17:44:39,547 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:44:39,547 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620360467]
[2025-05-07 17:44:39,547 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:44:39,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:44:39,551 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:44:39,552 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:44:39,552 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:44:39,552 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:44:39,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:44:39,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:44:39,568 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620360467]
[2025-05-07 17:44:39,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620360467] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:44:39,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:44:39,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:44:39,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500558256]
[2025-05-07 17:44:39,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:44:39,569 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:44:39,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:44:39,569 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:44:39,569 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:44:39,569 INFO  L87              Difference]: Start difference. First operand 5552 states and 88797 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:44:52,767 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:44:52,768 INFO  L93              Difference]: Finished difference Result 5668 states and 166713 transitions.
[2025-05-07 17:44:52,769 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:44:52,769 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:44:52,769 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:45:11,291 INFO  L225             Difference]: With dead ends: 5668
[2025-05-07 17:45:11,291 INFO  L226             Difference]: Without dead ends: 5668
[2025-05-07 17:45:11,291 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:45:11,292 INFO  L437           NwaCegarLoop]: 1264 mSDtfsCounter, 49 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:45:11,292 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 2444 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time]
[2025-05-07 17:45:11,293 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5668 states.
[2025-05-07 17:45:52,646 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5668 to 5552.
[2025-05-07 17:45:52,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5552 states, 120 states have (on average 45.75) internal successors, (5490), 3227 states have internal predecessors, (5490), 5429 states have call successors, (5429), 60 states have call predecessors, (5429), 60 states have return successors, (77869), 2265 states have call predecessors, (77869), 5429 states have call successors, (77869)
[2025-05-07 17:45:56,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 88788 transitions.
[2025-05-07 17:45:56,863 INFO  L79                 Accepts]: Start accepts. Automaton has 5552 states and 88788 transitions. Word has length 20
[2025-05-07 17:45:56,864 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:45:56,864 INFO  L485      AbstractCegarLoop]: Abstraction has 5552 states and 88788 transitions.
[2025-05-07 17:45:56,864 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:45:56,864 INFO  L278                IsEmpty]: Start isEmpty. Operand 5552 states and 88788 transitions.
[2025-05-07 17:46:00,325 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:46:00,325 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:46:00,325 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:46:00,325 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-05-07 17:46:00,325 INFO  L403      AbstractCegarLoop]: === Iteration 38 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:46:00,325 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:46:00,325 INFO  L85        PathProgramCache]: Analyzing trace with hash -1117575244, now seen corresponding path program 1 times
[2025-05-07 17:46:00,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:46:00,326 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929710120]
[2025-05-07 17:46:00,326 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:46:00,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:46:00,329 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:46:00,330 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:46:00,330 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:46:00,330 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:46:00,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:46:00,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:46:00,346 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929710120]
[2025-05-07 17:46:00,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929710120] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:46:00,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:46:00,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:46:00,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83423208]
[2025-05-07 17:46:00,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:46:00,346 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:46:00,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:46:00,347 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:46:00,347 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:46:00,347 INFO  L87              Difference]: Start difference. First operand 5552 states and 88788 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:46:08,247 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:46:08,247 INFO  L93              Difference]: Finished difference Result 5554 states and 88788 transitions.
[2025-05-07 17:46:08,248 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:46:08,248 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:46:08,248 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:46:18,387 INFO  L225             Difference]: With dead ends: 5554
[2025-05-07 17:46:18,387 INFO  L226             Difference]: Without dead ends: 5554
[2025-05-07 17:46:18,387 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:46:18,388 INFO  L437           NwaCegarLoop]: 777 mSDtfsCounter, 49 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:46:18,388 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1425 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-05-07 17:46:18,389 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5554 states.
[2025-05-07 17:46:39,493 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5554 to 5552.
[2025-05-07 17:46:39,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5552 states, 120 states have (on average 45.75) internal successors, (5490), 3227 states have internal predecessors, (5490), 5429 states have call successors, (5429), 60 states have call predecessors, (5429), 60 states have return successors, (77867), 2265 states have call predecessors, (77867), 5429 states have call successors, (77867)
[2025-05-07 17:46:43,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 88786 transitions.
[2025-05-07 17:46:43,836 INFO  L79                 Accepts]: Start accepts. Automaton has 5552 states and 88786 transitions. Word has length 20
[2025-05-07 17:46:43,837 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:46:43,837 INFO  L485      AbstractCegarLoop]: Abstraction has 5552 states and 88786 transitions.
[2025-05-07 17:46:43,837 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:46:43,837 INFO  L278                IsEmpty]: Start isEmpty. Operand 5552 states and 88786 transitions.
[2025-05-07 17:46:47,450 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:46:47,451 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:46:47,451 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:46:47,451 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-05-07 17:46:47,451 INFO  L403      AbstractCegarLoop]: === Iteration 39 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:46:47,451 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:46:47,451 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345717357, now seen corresponding path program 1 times
[2025-05-07 17:46:47,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:46:47,451 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303185548]
[2025-05-07 17:46:47,451 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:46:47,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:46:47,455 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:46:47,456 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:46:47,457 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:46:47,457 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:46:47,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:46:47,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:46:47,471 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303185548]
[2025-05-07 17:46:47,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303185548] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:46:47,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:46:47,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:46:47,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12917242]
[2025-05-07 17:46:47,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:46:47,472 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:46:47,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:46:47,472 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:46:47,472 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:46:47,472 INFO  L87              Difference]: Start difference. First operand 5552 states and 88786 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:46:55,515 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:46:55,515 INFO  L93              Difference]: Finished difference Result 5910 states and 97217 transitions.
[2025-05-07 17:46:55,515 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:46:55,515 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:46:55,516 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:47:07,575 INFO  L225             Difference]: With dead ends: 5910
[2025-05-07 17:47:07,575 INFO  L226             Difference]: Without dead ends: 5910
[2025-05-07 17:47:07,575 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:47:07,576 INFO  L437           NwaCegarLoop]: 865 mSDtfsCounter, 49 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:47:07,576 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1934 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-05-07 17:47:07,577 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5910 states.
[2025-05-07 17:47:32,974 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5910 to 5908.
[2025-05-07 17:47:33,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5908 states, 128 states have (on average 44.484375) internal successors, (5694), 3423 states have internal predecessors, (5694), 5777 states have call successors, (5777), 64 states have call predecessors, (5777), 64 states have return successors, (85744), 2421 states have call predecessors, (85744), 5777 states have call successors, (85744)
[2025-05-07 17:47:37,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5908 states to 5908 states and 97215 transitions.
[2025-05-07 17:47:37,884 INFO  L79                 Accepts]: Start accepts. Automaton has 5908 states and 97215 transitions. Word has length 20
[2025-05-07 17:47:37,884 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:47:37,885 INFO  L485      AbstractCegarLoop]: Abstraction has 5908 states and 97215 transitions.
[2025-05-07 17:47:37,885 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:47:37,885 INFO  L278                IsEmpty]: Start isEmpty. Operand 5908 states and 97215 transitions.
[2025-05-07 17:47:41,460 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:47:41,460 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:47:41,461 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:47:41,461 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-05-07 17:47:41,461 INFO  L403      AbstractCegarLoop]: === Iteration 40 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:47:41,461 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:47:41,461 INFO  L85        PathProgramCache]: Analyzing trace with hash 137500844, now seen corresponding path program 1 times
[2025-05-07 17:47:41,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:47:41,461 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018507817]
[2025-05-07 17:47:41,462 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:47:41,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:47:41,465 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:47:41,466 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:47:41,467 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:47:41,467 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:47:41,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:47:41,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:47:41,481 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018507817]
[2025-05-07 17:47:41,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018507817] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:47:41,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:47:41,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:47:41,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533987995]
[2025-05-07 17:47:41,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:47:41,481 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:47:41,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:47:41,482 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:47:41,482 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:47:41,482 INFO  L87              Difference]: Start difference. First operand 5908 states and 97215 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:47:50,338 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:47:50,338 INFO  L93              Difference]: Finished difference Result 6266 states and 109266 transitions.
[2025-05-07 17:47:50,339 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:47:50,339 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:47:50,339 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:48:04,793 INFO  L225             Difference]: With dead ends: 6266
[2025-05-07 17:48:04,793 INFO  L226             Difference]: Without dead ends: 6266
[2025-05-07 17:48:04,793 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:48:04,794 INFO  L437           NwaCegarLoop]: 775 mSDtfsCounter, 49 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:48:04,794 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1420 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-05-07 17:48:04,795 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6266 states.
[2025-05-07 17:48:34,550 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6266 to 6264.
[2025-05-07 17:48:34,583 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6264 states, 136 states have (on average 45.94117647058823) internal successors, (6248), 3619 states have internal predecessors, (6248), 6125 states have call successors, (6125), 68 states have call predecessors, (6125), 68 states have return successors, (96891), 2577 states have call predecessors, (96891), 6125 states have call successors, (96891)
[2025-05-07 17:48:40,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6264 states to 6264 states and 109264 transitions.
[2025-05-07 17:48:40,439 INFO  L79                 Accepts]: Start accepts. Automaton has 6264 states and 109264 transitions. Word has length 20
[2025-05-07 17:48:40,439 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:48:40,439 INFO  L485      AbstractCegarLoop]: Abstraction has 6264 states and 109264 transitions.
[2025-05-07 17:48:40,439 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:48:40,439 INFO  L278                IsEmpty]: Start isEmpty. Operand 6264 states and 109264 transitions.
[2025-05-07 17:48:44,755 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:48:44,755 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:48:44,755 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:48:44,755 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2025-05-07 17:48:44,755 INFO  L403      AbstractCegarLoop]: === Iteration 41 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:48:44,756 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:48:44,756 INFO  L85        PathProgramCache]: Analyzing trace with hash -1622632740, now seen corresponding path program 1 times
[2025-05-07 17:48:44,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:48:44,756 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194768297]
[2025-05-07 17:48:44,756 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:48:44,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:48:44,759 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:48:44,761 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:48:44,761 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:48:44,761 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:48:44,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-05-07 17:48:44,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:48:44,776 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194768297]
[2025-05-07 17:48:44,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194768297] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:48:44,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:48:44,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:48:44,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470015784]
[2025-05-07 17:48:44,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:48:44,776 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:48:44,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:48:44,776 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:48:44,776 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:48:44,776 INFO  L87              Difference]: Start difference. First operand 6264 states and 109264 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:48:54,366 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:48:54,366 INFO  L93              Difference]: Finished difference Result 6622 states and 118825 transitions.
[2025-05-07 17:48:54,367 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:48:54,367 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:48:54,367 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:49:08,770 INFO  L225             Difference]: With dead ends: 6622
[2025-05-07 17:49:08,770 INFO  L226             Difference]: Without dead ends: 6622
[2025-05-07 17:49:08,770 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:49:08,771 INFO  L437           NwaCegarLoop]: 868 mSDtfsCounter, 49 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:49:08,771 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1943 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-05-07 17:49:08,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6622 states.
[2025-05-07 17:49:41,904 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 6620.
[2025-05-07 17:49:41,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6620 states, 144 states have (on average 44.791666666666664) internal successors, (6450), 3815 states have internal predecessors, (6450), 6473 states have call successors, (6473), 72 states have call predecessors, (6473), 72 states have return successors, (105900), 2733 states have call predecessors, (105900), 6473 states have call successors, (105900)
[2025-05-07 17:49:48,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 118823 transitions.
[2025-05-07 17:49:48,637 INFO  L79                 Accepts]: Start accepts. Automaton has 6620 states and 118823 transitions. Word has length 20
[2025-05-07 17:49:48,637 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:49:48,637 INFO  L485      AbstractCegarLoop]: Abstraction has 6620 states and 118823 transitions.
[2025-05-07 17:49:48,637 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:49:48,637 INFO  L278                IsEmpty]: Start isEmpty. Operand 6620 states and 118823 transitions.
[2025-05-07 17:49:52,814 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:49:52,814 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:49:52,814 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:49:52,814 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-05-07 17:49:52,815 INFO  L403      AbstractCegarLoop]: === Iteration 42 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:49:52,815 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:49:52,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 1914982387, now seen corresponding path program 1 times
[2025-05-07 17:49:52,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:49:52,815 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560423795]
[2025-05-07 17:49:52,815 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:49:52,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:49:52,819 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:49:52,820 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:49:52,820 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:49:52,820 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:49:52,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:49:52,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:49:52,835 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560423795]
[2025-05-07 17:49:52,835 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560423795] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:49:52,835 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:49:52,835 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:49:52,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184137767]
[2025-05-07 17:49:52,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:49:52,835 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:49:52,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:49:52,836 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:49:52,836 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:49:52,836 INFO  L87              Difference]: Start difference. First operand 6620 states and 118823 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:50:12,908 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:50:12,908 INFO  L93              Difference]: Finished difference Result 7124 states and 249805 transitions.
[2025-05-07 17:50:12,909 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:50:12,909 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:50:12,909 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:50:46,394 INFO  L225             Difference]: With dead ends: 7124
[2025-05-07 17:50:46,394 INFO  L226             Difference]: Without dead ends: 7124
[2025-05-07 17:50:46,394 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:50:46,394 INFO  L437           NwaCegarLoop]: 1265 mSDtfsCounter, 49 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:50:46,394 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 2438 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time]
[2025-05-07 17:50:46,396 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7124 states.
[2025-05-07 17:51:49,332 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7124 to 6976.
[2025-05-07 17:51:49,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6976 states, 152 states have (on average 44.89473684210526) internal successors, (6824), 4011 states have internal predecessors, (6824), 6821 states have call successors, (6821), 76 states have call predecessors, (6821), 76 states have return successors, (118044), 2889 states have call predecessors, (118044), 6821 states have call successors, (118044)
[2025-05-07 17:51:57,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6976 states to 6976 states and 131689 transitions.
[2025-05-07 17:51:57,488 INFO  L79                 Accepts]: Start accepts. Automaton has 6976 states and 131689 transitions. Word has length 20
[2025-05-07 17:51:57,488 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:51:57,488 INFO  L485      AbstractCegarLoop]: Abstraction has 6976 states and 131689 transitions.
[2025-05-07 17:51:57,488 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:51:57,488 INFO  L278                IsEmpty]: Start isEmpty. Operand 6976 states and 131689 transitions.
[2025-05-07 17:52:02,687 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-05-07 17:52:02,687 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:52:02,687 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:52:02,687 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-05-07 17:52:02,688 INFO  L403      AbstractCegarLoop]: === Iteration 43 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:52:02,688 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:52:02,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 1103908825, now seen corresponding path program 1 times
[2025-05-07 17:52:02,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:52:02,688 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933069462]
[2025-05-07 17:52:02,688 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:52:02,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:52:02,692 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-05-07 17:52:02,693 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-05-07 17:52:02,693 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:52:02,693 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:52:02,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:52:02,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:52:02,708 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933069462]
[2025-05-07 17:52:02,708 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933069462] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:52:02,708 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:52:02,709 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:52:02,709 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835518858]
[2025-05-07 17:52:02,709 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:52:02,709 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:52:02,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:52:02,709 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:52:02,709 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:52:02,709 INFO  L87              Difference]: Start difference. First operand 6976 states and 131689 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:52:20,941 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:52:20,941 INFO  L93              Difference]: Finished difference Result 7488 states and 221295 transitions.
[2025-05-07 17:52:20,942 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:52:20,942 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-05-07 17:52:20,942 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:52:46,592 INFO  L225             Difference]: With dead ends: 7488
[2025-05-07 17:52:46,592 INFO  L226             Difference]: Without dead ends: 7488
[2025-05-07 17:52:46,592 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:52:46,593 INFO  L437           NwaCegarLoop]: 977 mSDtfsCounter, 49 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:52:46,593 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1703 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time]
[2025-05-07 17:52:46,596 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7488 states.
