/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/horseshoe.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:35,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:35,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:35,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:35,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:35,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:35,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:35,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:35,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:35,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:35,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:35,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:35,200 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:35,200 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:35,200 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:35,200 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:35,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:35,201 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:35,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:35,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:35,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:35,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:35,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:35,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:35,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:35,202 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:35,202 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:35,202 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:35,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:35,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:35,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:35,501 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:35,502 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:35,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/horseshoe.wvr.bpl [2025-04-26 18:41:35,505 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/horseshoe.wvr.bpl' [2025-04-26 18:41:35,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:35,525 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:35,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:35,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:35,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:35,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,563 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:35,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:35,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:35,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:35,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:35,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:35,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:35,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:35,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:35,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/1) ... [2025-04-26 18:41:35,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:35,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:35,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:35,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:35,643 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:35,644 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:35,644 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:35,644 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:35,645 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:35,687 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:35,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:35,794 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:35,794 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:35,821 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:35,823 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:35,825 INFO L201 PluginConnector]: Adding new model horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:35 BoogieIcfgContainer [2025-04-26 18:41:35,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:35,827 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:35,827 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:35,831 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:35,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:35,832 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:35" (1/2) ... [2025-04-26 18:41:35,833 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fc03afe and model type horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:35, skipping insertion in model container [2025-04-26 18:41:35,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:35,833 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:35" (2/2) ... [2025-04-26 18:41:35,834 INFO L376 chiAutomizerObserver]: Analyzing ICFG horseshoe.wvr.bpl [2025-04-26 18:41:35,887 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:35,925 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:35,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:35,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:35,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:35,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:35,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 36 transitions, 93 flow [2025-04-26 18:41:36,009 INFO L116 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-04-26 18:41:36,012 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:36,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 18:41:36,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 36 transitions, 93 flow [2025-04-26 18:41:36,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2025-04-26 18:41:36,021 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 30 transitions, 78 flow [2025-04-26 18:41:36,022 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 30 transitions, 78 flow [2025-04-26 18:41:36,065 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 355 states, 353 states have (on average 2.943342776203966) internal successors, (in total 1039), 354 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:36,067 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 355 states, 353 states have (on average 2.943342776203966) internal successors, (in total 1039), 354 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:36,068 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:36,195 WARN L140 AmpleReduction]: Number of pruned transitions: 468 [2025-04-26 18:41:36,195 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:36,196 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 74 [2025-04-26 18:41:36,196 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 18:41:36,196 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:253 [2025-04-26 18:41:36,196 WARN L145 AmpleReduction]: Times succ was already a loop node:30 [2025-04-26 18:41:36,196 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:109 [2025-04-26 18:41:36,196 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:36,197 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 355 states, 353 states have (on average 1.6175637393767706) internal successors, (in total 571), 354 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:36,203 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:36,203 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:36,203 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:36,203 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:36,203 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:36,203 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:36,203 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:36,203 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:36,205 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 355 states, 353 states have (on average 1.6175637393767706) internal successors, (in total 571), 354 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:36,236 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 278 [2025-04-26 18:41:36,236 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:36,236 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:36,239 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:41:36,239 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:36,239 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:36,240 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 355 states, 353 states have (on average 1.6175637393767706) internal successors, (in total 571), 354 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:36,248 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 278 [2025-04-26 18:41:36,248 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:36,248 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:36,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:41:36,248 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:36,257 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:36,258 INFO L754 eck$LassoCheckResult]: Loop: "[84] L28-->L29: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[86] L29-->L29-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 2) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[88] L29-1-->L28: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i]" [2025-04-26 18:41:36,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash 3576, now seen corresponding path program 1 times [2025-04-26 18:41:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:36,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025811990] [2025-04-26 18:41:36,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:36,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:36,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:36,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:36,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:36,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:36,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:36,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:36,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:36,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:36,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:36,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:36,370 INFO L85 PathProgramCache]: Analyzing trace with hash 113269, now seen corresponding path program 1 times [2025-04-26 18:41:36,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:36,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299150816] [2025-04-26 18:41:36,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:36,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:36,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:36,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:36,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:36,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:36,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:36,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:36,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:36,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:36,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:36,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash 106616094, now seen corresponding path program 1 times [2025-04-26 18:41:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:36,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735415503] [2025-04-26 18:41:36,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:36,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:36,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:36,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:36,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:36,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:36,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:36,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:36,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:36,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:36,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:36,610 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:36,611 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:36,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:36,612 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:36,612 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:36,612 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:36,612 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:36,612 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:36,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:36,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:36,612 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:36,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:36,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:36,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:36,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:36,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:36,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:36,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:36,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:36,821 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:36,823 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:36,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:36,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:36,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:36,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:36,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:36,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:36,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:36,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:36,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:36,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:36,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:36,850 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:36,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:36,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:36,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:36,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:36,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:36,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:36,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:36,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:36,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:36,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:36,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:36,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:36,878 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:36,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:36,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:36,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:36,886 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:36,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:36,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:36,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:36,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:36,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:36,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:36,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:36,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:36,905 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:36,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:41:36,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:36,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:36,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:36,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:36,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:36,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:36,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:36,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:36,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:36,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:36,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:36,931 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:36,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:36,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:36,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:36,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:36,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:36,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:36,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:36,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:36,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:36,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:36,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:36,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:36,962 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:36,970 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:41:36,970 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:36,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:36,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:36,973 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:36,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:36,976 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:36,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:41:36,992 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:36,993 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:36,993 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:41:36,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:41:37,001 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:37,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:37,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:37,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:37,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:37,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:37,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:37,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:37,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:37,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:37,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:37,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:37,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:37,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:37,072 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:37,074 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 355 states, 353 states have (on average 1.6175637393767706) internal successors, (in total 571), 354 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:37,167 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 355 states, 353 states have (on average 1.6175637393767706) internal successors, (in total 571), 354 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 803 states and 1383 transitions. Complement of second has 7 states. [2025-04-26 18:41:37,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-04-26 18:41:37,179 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:41:37,181 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:37,181 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:41:37,181 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:37,181 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:41:37,181 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:37,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 803 states and 1383 transitions. [2025-04-26 18:41:37,197 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 136 [2025-04-26 18:41:37,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 803 states to 442 states and 722 transitions. [2025-04-26 18:41:37,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2025-04-26 18:41:37,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2025-04-26 18:41:37,208 INFO L74 IsDeterministic]: Start isDeterministic. Operand 442 states and 722 transitions. [2025-04-26 18:41:37,208 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:37,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 442 states and 722 transitions. [2025-04-26 18:41:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 722 transitions. [2025-04-26 18:41:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 390. [2025-04-26 18:41:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 390 states have (on average 1.6871794871794872) internal successors, (in total 658), 389 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 658 transitions. [2025-04-26 18:41:37,247 INFO L240 hiAutomatonCegarLoop]: Abstraction has 390 states and 658 transitions. [2025-04-26 18:41:37,247 INFO L438 stractBuchiCegarLoop]: Abstraction has 390 states and 658 transitions. [2025-04-26 18:41:37,247 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:37,247 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 390 states and 658 transitions. [2025-04-26 18:41:37,249 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 136 [2025-04-26 18:41:37,249 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:37,249 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:37,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:41:37,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:37,250 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L28-->L35: Formula: (<= v_N_2 v_i_4) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" "[85] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[87] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[107] L77-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:41:37,250 INFO L754 eck$LassoCheckResult]: Loop: "[90] L44-->L45: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[92] L45-->L45-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[93] L45-1-->L50: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[94] L50-->L55: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[95] L55-->L44: Formula: (or (and (not v_f_1) (<= v_j_3 0)) (and v_f_1 (< 0 v_j_3))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_1} AuxVars[] AssignedVars[f]" [2025-04-26 18:41:37,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash -989899058, now seen corresponding path program 1 times [2025-04-26 18:41:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:37,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919471293] [2025-04-26 18:41:37,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:37,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:37,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:37,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:37,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:37,260 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:37,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:37,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:37,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:37,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:37,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:37,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:37,267 INFO L85 PathProgramCache]: Analyzing trace with hash 114579195, now seen corresponding path program 1 times [2025-04-26 18:41:37,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:37,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303682367] [2025-04-26 18:41:37,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:37,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:37,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:37,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:37,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:37,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:37,271 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:37,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:37,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:37,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:37,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:37,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:37,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1479788466, now seen corresponding path program 1 times [2025-04-26 18:41:37,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:37,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111212029] [2025-04-26 18:41:37,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:37,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:37,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:37,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:37,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:37,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:37,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:37,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:37,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:37,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:37,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:37,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:37,499 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:37,499 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:37,499 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:37,499 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:37,499 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:37,499 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:37,499 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:37,499 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:37,500 INFO L132 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:37,500 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:37,500 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:37,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:37,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:37,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:37,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:37,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:37,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:37,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:37,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:37,765 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:37,765 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:37,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:37,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:37,768 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:37,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:37,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:37,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:37,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:37,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:37,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:37,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:37,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:37,792 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:37,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:37,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:37,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:37,810 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:37,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:37,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:37,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:37,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:37,824 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:37,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:37,836 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 18:41:37,836 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:37,854 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:37,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:37,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:37,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:37,863 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:37,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:37,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:37,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:37,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:37,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:37,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:37,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:37,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:37,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:37,893 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:37,893 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:41:37,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:37,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:37,896 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:37,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:37,898 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:37,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:37,916 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:37,916 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:37,917 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 18:41:37,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:41:37,924 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:37,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:37,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:37,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:37,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:37,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:37,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:37,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:37,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:37,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:37,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:37,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:37,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:37,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:37,999 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:37,999 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 390 states and 658 transitions. cyclomatic complexity: 297 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:38,034 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 390 states and 658 transitions. cyclomatic complexity: 297. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 628 states and 994 transitions. Complement of second has 5 states. [2025-04-26 18:41:38,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-26 18:41:38,036 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 6 letters. Loop has 5 letters. [2025-04-26 18:41:38,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:38,036 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 11 letters. Loop has 5 letters. [2025-04-26 18:41:38,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:38,036 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 6 letters. Loop has 10 letters. [2025-04-26 18:41:38,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:38,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 628 states and 994 transitions. [2025-04-26 18:41:38,041 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 160 [2025-04-26 18:41:38,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 628 states to 526 states and 858 transitions. [2025-04-26 18:41:38,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2025-04-26 18:41:38,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2025-04-26 18:41:38,045 INFO L74 IsDeterministic]: Start isDeterministic. Operand 526 states and 858 transitions. [2025-04-26 18:41:38,046 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:38,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 526 states and 858 transitions. [2025-04-26 18:41:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states and 858 transitions. [2025-04-26 18:41:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 469. [2025-04-26 18:41:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 469 states have (on average 1.6460554371002132) internal successors, (in total 772), 468 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 772 transitions. [2025-04-26 18:41:38,068 INFO L240 hiAutomatonCegarLoop]: Abstraction has 469 states and 772 transitions. [2025-04-26 18:41:38,068 INFO L438 stractBuchiCegarLoop]: Abstraction has 469 states and 772 transitions. [2025-04-26 18:41:38,068 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:38,068 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 469 states and 772 transitions. [2025-04-26 18:41:38,070 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 136 [2025-04-26 18:41:38,070 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:38,072 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:38,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:38,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:38,074 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[84] L28-->L29: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[86] L29-->L29-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 2) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[107] L77-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[88] L29-1-->L28: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i]" "[83] L28-->L35: Formula: (<= v_N_2 v_i_4) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" "[85] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" [2025-04-26 18:41:38,074 INFO L754 eck$LassoCheckResult]: Loop: "[90] L44-->L45: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[92] L45-->L45-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[93] L45-1-->L50: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[94] L50-->L55: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[95] L55-->L44: Formula: (or (and (not v_f_1) (<= v_j_3 0)) (and v_f_1 (< 0 v_j_3))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_1} AuxVars[] AssignedVars[f]" [2025-04-26 18:41:38,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2075089431, now seen corresponding path program 1 times [2025-04-26 18:41:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628612461] [2025-04-26 18:41:38,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:38,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:38,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:38,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:38,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:38,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:38,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash 114579195, now seen corresponding path program 2 times [2025-04-26 18:41:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925930785] [2025-04-26 18:41:38,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:38,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:38,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:38,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:38,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:38,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:38,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:38,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:38,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash -804838893, now seen corresponding path program 1 times [2025-04-26 18:41:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786073690] [2025-04-26 18:41:38,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:38,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:38,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:38,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:38,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:38,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:38,320 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:38,321 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:38,321 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:38,321 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:38,321 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:38,321 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,321 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:38,321 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:38,321 INFO L132 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:41:38,321 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:38,321 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:38,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:38,587 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:38,587 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:38,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,589 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:38,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:38,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:38,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:38,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:38,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:38,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:38,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:38,605 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:38,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:38,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,613 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:38,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:38,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:38,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:38,626 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:38,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:38,636 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 18:41:38,636 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:38,670 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:38,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:38,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:38,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:38,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:38,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:38,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:38,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:38,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:38,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:38,699 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:38,707 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:41:38,707 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:41:38,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:38,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:38,709 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:38,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:38,712 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:38,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:38,728 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:38,729 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:38,729 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 18:41:38,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:38,737 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:38,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:38,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:38,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:38,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:38,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:38,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:38,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:38,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:38,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:38,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:38,793 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:38,793 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 469 states and 772 transitions. cyclomatic complexity: 335 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:38,819 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 469 states and 772 transitions. cyclomatic complexity: 335. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 781 states and 1290 transitions. Complement of second has 4 states. [2025-04-26 18:41:38,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-26 18:41:38,820 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 18:41:38,821 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:38,821 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 13 letters. Loop has 5 letters. [2025-04-26 18:41:38,821 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:38,821 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 8 letters. Loop has 10 letters. [2025-04-26 18:41:38,821 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:38,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 781 states and 1290 transitions. [2025-04-26 18:41:38,825 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 18:41:38,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 781 states to 515 states and 843 transitions. [2025-04-26 18:41:38,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2025-04-26 18:41:38,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2025-04-26 18:41:38,829 INFO L74 IsDeterministic]: Start isDeterministic. Operand 515 states and 843 transitions. [2025-04-26 18:41:38,829 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:38,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 515 states and 843 transitions. [2025-04-26 18:41:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states and 843 transitions. [2025-04-26 18:41:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 384. [2025-04-26 18:41:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 384 states have (on average 1.7135416666666667) internal successors, (in total 658), 383 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 658 transitions. [2025-04-26 18:41:38,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 384 states and 658 transitions. [2025-04-26 18:41:38,837 INFO L438 stractBuchiCegarLoop]: Abstraction has 384 states and 658 transitions. [2025-04-26 18:41:38,837 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:38,837 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 384 states and 658 transitions. [2025-04-26 18:41:38,838 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 18:41:38,838 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:38,838 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:38,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:38,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:38,839 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[84] L28-->L29: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[86] L29-->L29-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 2) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[107] L77-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[88] L29-1-->L28: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i]" "[84] L28-->L29: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[110] L78-->L62: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:41:38,839 INFO L754 eck$LassoCheckResult]: Loop: "[97] L62-->L63: Formula: v_g_2 InVars {g=v_g_2} OutVars{g=v_g_2} AuxVars[] AssignedVars[]" "[99] L63-->L63-1: Formula: (and (< v_q2_front_9 v_q2_back_12) (= (select v_q2_7 v_q2_front_9) v_k_6) (= (+ v_q2_front_9 1) v_q2_front_8)) InVars {q2=v_q2_7, q2_front=v_q2_front_9, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_8, q2_back=v_q2_back_12} AuxVars[] AssignedVars[k, q2_front]" "[100] L63-1-->L69: Formula: (= (+ v_k_2 v_t_4) v_t_3) InVars {t=v_t_4, k=v_k_2} OutVars{t=v_t_3, k=v_k_2} AuxVars[] AssignedVars[t]" "[101] L69-->L62: Formula: (or (and (<= v_k_3 0) (not v_g_3)) (and v_g_3 (< 0 v_k_3))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_3} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:38,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2075089375, now seen corresponding path program 1 times [2025-04-26 18:41:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061812388] [2025-04-26 18:41:38,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:38,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:38,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:38,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:38,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:38,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:38,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,853 INFO L85 PathProgramCache]: Analyzing trace with hash 3911588, now seen corresponding path program 1 times [2025-04-26 18:41:38,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611054884] [2025-04-26 18:41:38,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:38,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:38,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:38,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:38,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:38,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:38,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:38,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:38,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash 25970116, now seen corresponding path program 1 times [2025-04-26 18:41:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:38,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739785928] [2025-04-26 18:41:38,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:38,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:38,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:38,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:38,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:38,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:38,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739785928] [2025-04-26 18:41:38,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739785928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:38,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:38,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:41:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178829253] [2025-04-26 18:41:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:38,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:38,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:38,969 INFO L87 Difference]: Start difference. First operand 384 states and 658 transitions. cyclomatic complexity: 295 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:38,992 INFO L93 Difference]: Finished difference Result 494 states and 836 transitions. [2025-04-26 18:41:38,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 836 transitions. [2025-04-26 18:41:38,997 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 18:41:39,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 451 states and 772 transitions. [2025-04-26 18:41:39,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2025-04-26 18:41:39,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2025-04-26 18:41:39,000 INFO L74 IsDeterministic]: Start isDeterministic. Operand 451 states and 772 transitions. [2025-04-26 18:41:39,000 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:39,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 451 states and 772 transitions. [2025-04-26 18:41:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states and 772 transitions. [2025-04-26 18:41:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 434. [2025-04-26 18:41:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 434 states have (on average 1.728110599078341) internal successors, (in total 750), 433 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 750 transitions. [2025-04-26 18:41:39,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 434 states and 750 transitions. [2025-04-26 18:41:39,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:39,011 INFO L438 stractBuchiCegarLoop]: Abstraction has 434 states and 750 transitions. [2025-04-26 18:41:39,011 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:39,012 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 750 transitions. [2025-04-26 18:41:39,015 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 18:41:39,015 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:39,015 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:39,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:39,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:39,016 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L28-->L35: Formula: (<= v_N_2 v_i_4) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" "[85] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[87] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[107] L77-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[90] L44-->L45: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[92] L45-->L45-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[93] L45-1-->L50: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[94] L50-->L55: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[110] L78-->L62: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[95] L55-->L44: Formula: (or (and (not v_f_1) (<= v_j_3 0)) (and v_f_1 (< 0 v_j_3))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_1} AuxVars[] AssignedVars[f]" "[89] L44-->thread2FINAL: Formula: (not v_f_2) InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:39,016 INFO L754 eck$LassoCheckResult]: Loop: "[97] L62-->L63: Formula: v_g_2 InVars {g=v_g_2} OutVars{g=v_g_2} AuxVars[] AssignedVars[]" "[99] L63-->L63-1: Formula: (and (< v_q2_front_9 v_q2_back_12) (= (select v_q2_7 v_q2_front_9) v_k_6) (= (+ v_q2_front_9 1) v_q2_front_8)) InVars {q2=v_q2_7, q2_front=v_q2_front_9, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_8, q2_back=v_q2_back_12} AuxVars[] AssignedVars[k, q2_front]" "[100] L63-1-->L69: Formula: (= (+ v_k_2 v_t_4) v_t_3) InVars {t=v_t_4, k=v_k_2} OutVars{t=v_t_3, k=v_k_2} AuxVars[] AssignedVars[t]" "[101] L69-->L62: Formula: (or (and (<= v_k_3 0) (not v_g_3)) (and v_g_3 (< 0 v_k_3))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_3} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:39,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash -442523401, now seen corresponding path program 1 times [2025-04-26 18:41:39,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503692959] [2025-04-26 18:41:39,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:39,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:39,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:39,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:39,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:39,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 3911588, now seen corresponding path program 2 times [2025-04-26 18:41:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336642251] [2025-04-26 18:41:39,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:39,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:39,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:39,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:39,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:39,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,039 INFO L85 PathProgramCache]: Analyzing trace with hash -627710566, now seen corresponding path program 1 times [2025-04-26 18:41:39,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165042157] [2025-04-26 18:41:39,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:39,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:39,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:39,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:39,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,267 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:39,268 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:39,268 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:39,268 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:39,268 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:39,268 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,268 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:39,268 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:39,268 INFO L132 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:39,268 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:39,268 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:39,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:39,570 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:39,570 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:39,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,572 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:41:39,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:39,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:39,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:39,585 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:39,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:39,597 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 18:41:39,597 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:39,617 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:39,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:39,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,627 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:39,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:39,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:39,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:39,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:39,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:39,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:39,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:39,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:39,652 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:39,652 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:39,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:39,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:39,654 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:39,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:41:39,657 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:39,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:41:39,674 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:39,674 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:39,674 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 18:41:39,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:41:39,684 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:39,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:39,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:39,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:39,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:39,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:39,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:39,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:39,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:39,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:39,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:39,744 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:39,744 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 434 states and 750 transitions. cyclomatic complexity: 346 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:39,772 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 434 states and 750 transitions. cyclomatic complexity: 346. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 560 states and 948 transitions. Complement of second has 4 states. [2025-04-26 18:41:39,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 18:41:39,776 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 18:41:39,776 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:39,776 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 17 letters. Loop has 4 letters. [2025-04-26 18:41:39,776 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:39,776 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 13 letters. Loop has 8 letters. [2025-04-26 18:41:39,776 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:39,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 560 states and 948 transitions. [2025-04-26 18:41:39,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-04-26 18:41:39,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 560 states to 152 states and 252 transitions. [2025-04-26 18:41:39,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-04-26 18:41:39,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-04-26 18:41:39,780 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 252 transitions. [2025-04-26 18:41:39,780 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:39,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 252 transitions. [2025-04-26 18:41:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 252 transitions. [2025-04-26 18:41:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2025-04-26 18:41:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.6546762589928057) internal successors, (in total 230), 138 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 230 transitions. [2025-04-26 18:41:39,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 139 states and 230 transitions. [2025-04-26 18:41:39,786 INFO L438 stractBuchiCegarLoop]: Abstraction has 139 states and 230 transitions. [2025-04-26 18:41:39,786 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:39,786 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 230 transitions. [2025-04-26 18:41:39,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-04-26 18:41:39,786 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:39,786 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:39,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:39,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:39,788 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L77: Formula: (and (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) v_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[84] L28-->L29: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[86] L29-->L29-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 2) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[107] L77-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[88] L29-1-->L28: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i]" "[84] L28-->L29: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[90] L44-->L45: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[86] L29-->L29-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 2) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[88] L29-1-->L28: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i]" "[92] L45-->L45-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[84] L28-->L29: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[86] L29-->L29-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 2) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[93] L45-1-->L50: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[88] L29-1-->L28: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i]" "[84] L28-->L29: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[110] L78-->L62: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[94] L50-->L55: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[86] L29-->L29-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 2) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" [2025-04-26 18:41:39,788 INFO L754 eck$LassoCheckResult]: Loop: "[97] L62-->L63: Formula: v_g_2 InVars {g=v_g_2} OutVars{g=v_g_2} AuxVars[] AssignedVars[]" "[99] L63-->L63-1: Formula: (and (< v_q2_front_9 v_q2_back_12) (= (select v_q2_7 v_q2_front_9) v_k_6) (= (+ v_q2_front_9 1) v_q2_front_8)) InVars {q2=v_q2_7, q2_front=v_q2_front_9, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_8, q2_back=v_q2_back_12} AuxVars[] AssignedVars[k, q2_front]" "[100] L63-1-->L69: Formula: (= (+ v_k_2 v_t_4) v_t_3) InVars {t=v_t_4, k=v_k_2} OutVars{t=v_t_3, k=v_k_2} AuxVars[] AssignedVars[t]" "[101] L69-->L62: Formula: (or (and (<= v_k_3 0) (not v_g_3)) (and v_g_3 (< 0 v_k_3))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_3} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:39,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash 76092060, now seen corresponding path program 1 times [2025-04-26 18:41:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7183734] [2025-04-26 18:41:39,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:39,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:39,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:39,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:39,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 3911588, now seen corresponding path program 3 times [2025-04-26 18:41:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294692995] [2025-04-26 18:41:39,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:39,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:39,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:39,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:39,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:39,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:39,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1636565825, now seen corresponding path program 1 times [2025-04-26 18:41:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:39,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058628036] [2025-04-26 18:41:39,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:39,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:39,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:39,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:39,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:39,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:39,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:39,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:39,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:40,131 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:40,131 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:40,131 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:40,131 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:40,131 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:40,131 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:40,131 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:40,131 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:40,131 INFO L132 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:41:40,131 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:40,131 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:40,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:40,429 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:40,429 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:40,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:40,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:40,431 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:40,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:41:40,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:40,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:40,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:40,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:40,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:40,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:40,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:40,447 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:40,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:41:40,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:40,454 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:40,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:41:40,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:40,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:40,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:40,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:40,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:40,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:40,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:40,468 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:40,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:41:40,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:40,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:40,476 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:40,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:41:40,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:40,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:40,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:40,488 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:40,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:40,501 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 18:41:40,501 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:40,520 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:40,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:41:40,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:40,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:40,528 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:40,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:41:40,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:40,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:40,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:40,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:40,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:40,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:40,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:40,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:40,554 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:40,554 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:40,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:40,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:40,556 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:40,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:41:40,558 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:40,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:41:40,573 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:40,573 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:40,573 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 18:41:40,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:40,588 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 18:41:40,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:40,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:40,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:40,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:40,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:40,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:40,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:40,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:40,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:40,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:40,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:40,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:40,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:40,645 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:40,645 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 230 transitions. cyclomatic complexity: 105 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:40,658 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 230 transitions. cyclomatic complexity: 105. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 171 states and 278 transitions. Complement of second has 5 states. [2025-04-26 18:41:40,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-04-26 18:41:40,668 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 18:41:40,668 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:40,668 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:40,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:40,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:40,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:40,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:40,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:40,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:40,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:40,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:40,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:40,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:40,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:40,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:40,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:40,732 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:40,732 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 230 transitions. cyclomatic complexity: 105 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:40,745 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 230 transitions. cyclomatic complexity: 105. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 171 states and 278 transitions. Complement of second has 5 states. [2025-04-26 18:41:40,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-04-26 18:41:40,746 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 18:41:40,746 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:40,746 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:40,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:40,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:40,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:40,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:40,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:40,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:40,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:40,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:40,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:40,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:40,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:40,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:40,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:40,809 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:40,809 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 230 transitions. cyclomatic complexity: 105 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:40,825 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 230 transitions. cyclomatic complexity: 105. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 381 states and 629 transitions. Complement of second has 7 states. [2025-04-26 18:41:40,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-04-26 18:41:40,828 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 18:41:40,828 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:40,828 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 18:41:40,828 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:40,828 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 18:41:40,828 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:40,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 629 transitions. [2025-04-26 18:41:40,830 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:40,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 0 states and 0 transitions. [2025-04-26 18:41:40,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:40,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:40,830 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:40,830 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:40,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:40,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:40,830 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:40,830 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:41:40,830 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:40,830 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:40,830 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:40,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:40,845 INFO L201 PluginConnector]: Adding new model horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:40 BoogieIcfgContainer [2025-04-26 18:41:40,845 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:40,846 INFO L158 Benchmark]: Toolchain (without parser) took 5321.68ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 102.5MB in the end (delta: -19.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:40,846 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.91ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 84.1MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:40,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.81ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 81.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:40,846 INFO L158 Benchmark]: Boogie Preprocessor took 27.70ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 80.1MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:40,846 INFO L158 Benchmark]: RCFGBuilder took 230.00ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 69.3MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:40,846 INFO L158 Benchmark]: BuchiAutomizer took 5017.85ms. Allocated memory is still 155.2MB. Free memory was 69.3MB in the beginning and 102.5MB in the end (delta: -33.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:40,847 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.91ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 84.1MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.81ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 81.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.70ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 80.1MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 230.00ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 69.3MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 5017.85ms. Allocated memory is still 155.2MB. Free memory was 69.3MB in the beginning and 102.5MB in the end (delta: -33.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 270 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 215 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 165 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 124 mSDtfsCounter, 165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital93 mio100 ax100 hnf100 lsp74 ukn90 mio100 lsp67 div100 bol112 ite100 ukn100 eq170 hnf91 smp100 dnf192 smp70 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 276, Number of transitions in reduction automaton: 571, Number of states in reduction automaton: 355, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:40,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...