/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 16:55:59,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:59,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:59,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:59,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:59,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:59,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:59,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:59,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:59,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:59,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:59,881 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:59,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:59,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:59,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:59,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:59,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:59,882 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:59,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:59,882 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:59,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:59,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:59,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:59,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:59,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:59,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:59,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:59,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:59,883 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:59,883 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:59,883 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:00,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:00,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:00,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:00,137 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:00,137 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:00,139 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 16:56:00,139 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 16:56:00,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:00,164 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:00,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:00,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:00,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:00,172 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,197 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,205 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:00,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:00,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:00,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:00,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:00,213 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,213 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,215 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,215 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,217 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,218 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,223 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,226 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,226 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 04:56:00" (1/1) ... [2025-04-26 16:56:00,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:00,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:00,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:00,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:00,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:00" (1/1) ... [2025-04-26 16:56:00,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:00,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:00,269 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 16:56:00,275 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 16:56:00,295 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:00,295 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:00,295 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:00,295 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:00,296 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 16:56:00,338 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:00,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:00,445 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:00,445 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:00,466 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:00,466 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:00,466 INFO L201 PluginConnector]: Adding new model horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:00 BoogieIcfgContainer [2025-04-26 16:56:00,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:00,467 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:00,467 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:00,473 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:00,474 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:00,474 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:00" (1/2) ... [2025-04-26 16:56:00,475 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38366d11 and model type horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:00, skipping insertion in model container [2025-04-26 16:56:00,475 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:00,475 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 04:56:00" (2/2) ... [2025-04-26 16:56:00,476 INFO L376 chiAutomizerObserver]: Analyzing ICFG horseshoe.wvr.bpl [2025-04-26 16:56:00,534 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:56:00,573 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:00,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:00,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:00,576 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 16:56:00,578 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 16:56:00,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 36 transitions, 93 flow [2025-04-26 16:56:00,656 INFO L116 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-04-26 16:56:00,657 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:56:00,661 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 16:56:00,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 36 transitions, 93 flow [2025-04-26 16:56:00,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2025-04-26 16:56:00,664 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 30 transitions, 78 flow [2025-04-26 16:56:00,669 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:00,851 WARN L140 AmpleReduction]: Number of pruned transitions: 468 [2025-04-26 16:56:00,851 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:00,851 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 74 [2025-04-26 16:56:00,851 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 16:56:00,851 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:253 [2025-04-26 16:56:00,851 WARN L145 AmpleReduction]: Times succ was already a loop node:30 [2025-04-26 16:56:00,851 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:109 [2025-04-26 16:56:00,851 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:00,854 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 16:56:00,861 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:00,861 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:00,861 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:00,861 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:00,861 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:00,861 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:00,861 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:00,861 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:00,864 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 16:56:00,882 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 278 [2025-04-26 16:56:00,882 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:00,882 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:00,885 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:00,886 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:00,886 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:00,886 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 16:56:00,894 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 278 [2025-04-26 16:56:00,894 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:00,894 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:00,894 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:00,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:00,901 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 16:56:00,902 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 16:56:00,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash 3576, now seen corresponding path program 1 times [2025-04-26 16:56:00,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:00,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064534621] [2025-04-26 16:56:00,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:00,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:00,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:00,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:00,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:00,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:00,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:00,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:00,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:00,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:00,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:01,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:01,006 INFO L85 PathProgramCache]: Analyzing trace with hash 113269, now seen corresponding path program 1 times [2025-04-26 16:56:01,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:01,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619625860] [2025-04-26 16:56:01,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:01,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:01,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:01,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:01,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:01,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:01,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:01,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:01,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:01,028 INFO L85 PathProgramCache]: Analyzing trace with hash 106616094, now seen corresponding path program 1 times [2025-04-26 16:56:01,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:01,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727730385] [2025-04-26 16:56:01,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:01,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:01,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:01,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:01,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:01,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:01,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:01,223 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:01,224 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:01,224 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:01,224 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:01,225 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:01,225 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:01,225 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:01,225 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:01,225 INFO L132 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:01,225 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:01,225 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:01,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:01,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:01,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:01,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:01,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:01,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:01,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:01,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:01,416 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:01,419 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:01,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:01,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:01,424 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 16:56:01,425 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 16:56:01,426 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 16:56:01,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:01,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:01,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:01,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:01,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:01,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:01,452 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:01,459 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 16:56:01,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:01,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:01,461 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 16:56:01,463 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 16:56:01,464 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 16:56:01,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:01,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:01,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:01,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:01,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:01,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:01,481 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:01,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:56:01,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:01,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:01,488 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 16:56:01,490 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 16:56:01,491 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 16:56:01,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:01,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:01,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:01,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:01,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:01,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:01,506 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:01,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:01,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:01,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:01,515 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 16:56:01,516 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 16:56:01,518 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 16:56:01,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:01,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:01,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:01,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:01,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:01,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:01,533 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:01,539 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 16:56:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:01,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:01,541 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 16:56:01,543 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 16:56:01,546 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 16:56:01,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:01,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:01,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:01,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:01,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:01,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:01,569 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:01,577 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:56:01,577 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:01,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:01,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:01,601 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 16:56:01,603 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 16:56:01,605 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:01,625 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 16:56:01,625 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:01,625 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:01,626 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:56:01,631 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 16:56:01,634 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:01,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:01,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:01,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:01,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:01,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:01,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:01,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:01,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:01,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:01,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:01,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:01,700 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 16:56:01,718 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 16:56:01,720 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 16:56:01,826 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 16:56:01,829 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 16:56:01,834 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 16:56:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-04-26 16:56:01,838 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:56:01,839 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:01,839 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:01,839 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:01,839 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 58 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:56:01,839 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:01,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 803 states and 1383 transitions. [2025-04-26 16:56:01,852 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 136 [2025-04-26 16:56:01,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 803 states to 442 states and 722 transitions. [2025-04-26 16:56:01,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2025-04-26 16:56:01,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2025-04-26 16:56:01,864 INFO L74 IsDeterministic]: Start isDeterministic. Operand 442 states and 722 transitions. [2025-04-26 16:56:01,864 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:01,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 442 states and 722 transitions. [2025-04-26 16:56:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 722 transitions. [2025-04-26 16:56:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 390. [2025-04-26 16:56:01,901 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 16:56:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 658 transitions. [2025-04-26 16:56:01,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 390 states and 658 transitions. [2025-04-26 16:56:01,904 INFO L438 stractBuchiCegarLoop]: Abstraction has 390 states and 658 transitions. [2025-04-26 16:56:01,904 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:01,904 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 390 states and 658 transitions. [2025-04-26 16:56:01,906 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 136 [2025-04-26 16:56:01,906 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:01,906 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:01,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:01,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:01,907 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 16:56:01,908 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 16:56:01,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:01,908 INFO L85 PathProgramCache]: Analyzing trace with hash -989899058, now seen corresponding path program 1 times [2025-04-26 16:56:01,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:01,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647324938] [2025-04-26 16:56:01,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:01,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:01,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:01,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:01,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:01,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:01,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:01,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:01,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash 114579195, now seen corresponding path program 1 times [2025-04-26 16:56:01,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:01,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509656785] [2025-04-26 16:56:01,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:01,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:01,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:01,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:01,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:01,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:01,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:01,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:01,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1479788466, now seen corresponding path program 1 times [2025-04-26 16:56:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:01,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166363553] [2025-04-26 16:56:01,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:01,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:01,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:01,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:01,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:01,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:01,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:01,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:01,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:02,180 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:02,180 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:02,180 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:02,180 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:02,180 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:02,180 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:02,180 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:02,180 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:02,180 INFO L132 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:56:02,180 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:02,180 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:02,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:02,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:02,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:02,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:02,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:02,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:02,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:02,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:02,488 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:02,488 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:02,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:02,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:02,490 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 16:56:02,491 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 16:56:02,492 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 16:56:02,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:02,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:02,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:02,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:02,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:02,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:02,512 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:02,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:56:02,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:02,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:02,521 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 16:56:02,524 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 16:56:02,525 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 16:56:02,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:02,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:02,536 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:56:02,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:02,554 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:56:02,554 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:56:02,572 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:02,578 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 16:56:02,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:02,581 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 16:56:02,582 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 16:56:02,583 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 16:56:02,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:02,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:02,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:02,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:02,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:02,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:02,601 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:02,610 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:02,610 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:56:02,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:02,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:02,612 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 16:56:02,614 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 16:56:02,614 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:02,632 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 16:56:02,633 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:02,633 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:02,633 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 16:56:02,639 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 16:56:02,640 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:02,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:02,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:02,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:02,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:02,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:02,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:02,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:02,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:02,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:02,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:02,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:02,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:02,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:02,706 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 16:56:02,706 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 16:56:02,707 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 16:56:02,732 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 16:56:02,733 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 16:56:02,733 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 16:56:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-26 16:56:02,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 6 letters. Loop has 5 letters. [2025-04-26 16:56:02,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:02,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 11 letters. Loop has 5 letters. [2025-04-26 16:56:02,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:02,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 6 letters. Loop has 10 letters. [2025-04-26 16:56:02,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:02,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 628 states and 994 transitions. [2025-04-26 16:56:02,738 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 160 [2025-04-26 16:56:02,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 628 states to 526 states and 858 transitions. [2025-04-26 16:56:02,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2025-04-26 16:56:02,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2025-04-26 16:56:02,742 INFO L74 IsDeterministic]: Start isDeterministic. Operand 526 states and 858 transitions. [2025-04-26 16:56:02,742 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:02,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 526 states and 858 transitions. [2025-04-26 16:56:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states and 858 transitions. [2025-04-26 16:56:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 469. [2025-04-26 16:56:02,758 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 16:56:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 772 transitions. [2025-04-26 16:56:02,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 469 states and 772 transitions. [2025-04-26 16:56:02,761 INFO L438 stractBuchiCegarLoop]: Abstraction has 469 states and 772 transitions. [2025-04-26 16:56:02,761 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:02,761 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 469 states and 772 transitions. [2025-04-26 16:56:02,763 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 136 [2025-04-26 16:56:02,763 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:02,763 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:02,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:02,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:02,764 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 16:56:02,764 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 16:56:02,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2075089431, now seen corresponding path program 1 times [2025-04-26 16:56:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:02,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4730391] [2025-04-26 16:56:02,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:02,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:02,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:02,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:02,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:02,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:02,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:02,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:02,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:02,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash 114579195, now seen corresponding path program 2 times [2025-04-26 16:56:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:02,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588798768] [2025-04-26 16:56:02,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:02,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:02,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:02,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:02,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:02,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:02,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:02,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:02,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:02,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:02,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:02,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:02,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -804838893, now seen corresponding path program 1 times [2025-04-26 16:56:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:02,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454382979] [2025-04-26 16:56:02,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:02,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:02,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:02,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:02,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:02,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:02,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:02,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:02,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:02,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:02,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:02,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:03,026 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:03,026 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:03,026 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:03,027 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:03,027 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:03,027 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:03,027 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:03,027 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:03,027 INFO L132 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:03,027 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:03,027 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:03,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:03,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:03,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:03,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:03,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:03,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:03,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:03,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:03,309 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:03,309 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:03,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:03,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:03,314 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 16:56:03,317 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 16:56:03,317 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 16:56:03,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:03,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:03,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:03,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:03,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:03,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:03,335 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:03,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:56:03,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:03,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:03,344 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 16:56:03,346 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 16:56:03,347 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 16:56:03,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:03,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:03,357 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:56:03,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:03,370 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:56:03,370 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:56:03,388 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:03,395 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 16:56:03,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:03,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:03,397 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 16:56:03,399 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 16:56:03,400 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 16:56:03,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:03,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:03,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:03,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:03,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:03,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:03,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:03,426 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:56:03,426 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:56:03,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:03,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:03,428 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 16:56:03,428 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 16:56:03,429 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:03,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:56:03,445 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:03,446 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:03,446 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 16:56:03,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:56:03,454 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:03,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:03,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:03,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:03,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:03,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:03,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:03,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:03,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:03,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:03,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:03,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:03,517 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 16:56:03,517 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 16:56:03,518 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 16:56:03,554 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 16:56:03,556 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 16:56:03,557 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 16:56:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-26 16:56:03,557 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 16:56:03,558 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:03,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 13 letters. Loop has 5 letters. [2025-04-26 16:56:03,558 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:03,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 8 letters. Loop has 10 letters. [2025-04-26 16:56:03,558 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:03,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 781 states and 1290 transitions. [2025-04-26 16:56:03,566 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:56:03,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 781 states to 515 states and 843 transitions. [2025-04-26 16:56:03,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2025-04-26 16:56:03,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 262 [2025-04-26 16:56:03,571 INFO L74 IsDeterministic]: Start isDeterministic. Operand 515 states and 843 transitions. [2025-04-26 16:56:03,571 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:03,571 INFO L218 hiAutomatonCegarLoop]: Abstraction has 515 states and 843 transitions. [2025-04-26 16:56:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states and 843 transitions. [2025-04-26 16:56:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 384. [2025-04-26 16:56:03,585 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 16:56:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 658 transitions. [2025-04-26 16:56:03,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 384 states and 658 transitions. [2025-04-26 16:56:03,587 INFO L438 stractBuchiCegarLoop]: Abstraction has 384 states and 658 transitions. [2025-04-26 16:56:03,587 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:03,587 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 384 states and 658 transitions. [2025-04-26 16:56:03,588 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:56:03,589 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:03,589 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:03,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:03,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:03,589 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 16:56:03,590 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 16:56:03,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2075089375, now seen corresponding path program 1 times [2025-04-26 16:56:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:03,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675892178] [2025-04-26 16:56:03,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:03,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:03,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:03,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:03,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:03,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:03,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:03,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:03,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:03,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:03,611 INFO L85 PathProgramCache]: Analyzing trace with hash 3911588, now seen corresponding path program 1 times [2025-04-26 16:56:03,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:03,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091586270] [2025-04-26 16:56:03,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:03,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:03,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:03,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:03,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:03,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:03,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:03,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:03,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:03,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:03,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 25970116, now seen corresponding path program 1 times [2025-04-26 16:56:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:03,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559320155] [2025-04-26 16:56:03,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:03,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:03,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:56:03,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:56:03,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:03,678 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 16:56:03,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:03,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559320155] [2025-04-26 16:56:03,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559320155] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:03,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:03,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:56:03,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054198386] [2025-04-26 16:56:03,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:03,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:03,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:03,734 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 16:56:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:03,761 INFO L93 Difference]: Finished difference Result 494 states and 836 transitions. [2025-04-26 16:56:03,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 836 transitions. [2025-04-26 16:56:03,770 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:56:03,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 451 states and 772 transitions. [2025-04-26 16:56:03,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2025-04-26 16:56:03,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2025-04-26 16:56:03,773 INFO L74 IsDeterministic]: Start isDeterministic. Operand 451 states and 772 transitions. [2025-04-26 16:56:03,773 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:03,773 INFO L218 hiAutomatonCegarLoop]: Abstraction has 451 states and 772 transitions. [2025-04-26 16:56:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states and 772 transitions. [2025-04-26 16:56:03,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 434. [2025-04-26 16:56:03,782 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 16:56:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 750 transitions. [2025-04-26 16:56:03,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 434 states and 750 transitions. [2025-04-26 16:56:03,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:03,785 INFO L438 stractBuchiCegarLoop]: Abstraction has 434 states and 750 transitions. [2025-04-26 16:56:03,785 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:03,785 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 750 transitions. [2025-04-26 16:56:03,787 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:56:03,787 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:03,787 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:03,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:03,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:03,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]" "[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 16:56:03,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 16:56:03,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:03,788 INFO L85 PathProgramCache]: Analyzing trace with hash -442523401, now seen corresponding path program 1 times [2025-04-26 16:56:03,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:03,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904491117] [2025-04-26 16:56:03,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:03,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:03,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:03,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:03,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:03,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:03,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:03,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:03,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:03,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:03,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:03,825 INFO L85 PathProgramCache]: Analyzing trace with hash 3911588, now seen corresponding path program 2 times [2025-04-26 16:56:03,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:03,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228563701] [2025-04-26 16:56:03,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:03,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:03,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:03,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:03,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:03,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:03,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:03,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:03,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:03,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:03,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:03,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash -627710566, now seen corresponding path program 1 times [2025-04-26 16:56:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:03,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985642555] [2025-04-26 16:56:03,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:03,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:56:03,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:56:03,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:03,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:03,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:56:03,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:56:03,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:03,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:03,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:04,138 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:04,138 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:04,138 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:04,138 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:04,138 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:04,138 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:04,138 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:04,138 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:04,138 INFO L132 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:56:04,138 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:04,138 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:04,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:04,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:04,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:04,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:04,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:04,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:04,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:04,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:04,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:04,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:04,482 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:04,482 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:04,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:04,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:04,484 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 16:56:04,485 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 16:56:04,487 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 16:56:04,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:04,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:04,497 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:56:04,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:04,512 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:56:04,512 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:56:04,533 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:04,542 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 16:56:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:04,545 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 16:56:04,549 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 16:56:04,549 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 16:56:04,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:04,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:04,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:04,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:04,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:04,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:04,566 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:04,575 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:04,575 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:04,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:04,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:04,577 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 16:56:04,581 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 16:56:04,581 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:04,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:04,599 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:04,599 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:04,599 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 16:56:04,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:04,610 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:04,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:04,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:04,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:04,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:04,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:04,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:04,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:04,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:04,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:04,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:04,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:04,663 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 16:56:04,663 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 16:56:04,663 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 16:56:04,702 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 16:56:04,703 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 16:56:04,704 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 16:56:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 16:56:04,704 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:56:04,704 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:04,704 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 17 letters. Loop has 4 letters. [2025-04-26 16:56:04,704 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:04,704 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 13 letters. Loop has 8 letters. [2025-04-26 16:56:04,704 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:04,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 560 states and 948 transitions. [2025-04-26 16:56:04,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-04-26 16:56:04,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 560 states to 152 states and 252 transitions. [2025-04-26 16:56:04,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-04-26 16:56:04,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-04-26 16:56:04,712 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 252 transitions. [2025-04-26 16:56:04,712 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:04,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 252 transitions. [2025-04-26 16:56:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 252 transitions. [2025-04-26 16:56:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2025-04-26 16:56:04,714 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 16:56:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 230 transitions. [2025-04-26 16:56:04,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 139 states and 230 transitions. [2025-04-26 16:56:04,715 INFO L438 stractBuchiCegarLoop]: Abstraction has 139 states and 230 transitions. [2025-04-26 16:56:04,715 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:56:04,715 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 230 transitions. [2025-04-26 16:56:04,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-04-26 16:56:04,716 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:04,716 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:04,716 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:04,716 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:04,718 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 16:56:04,719 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 16:56:04,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 76092060, now seen corresponding path program 1 times [2025-04-26 16:56:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:04,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531363303] [2025-04-26 16:56:04,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:04,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:04,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:04,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:04,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:04,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:04,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:04,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:04,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:04,744 INFO L85 PathProgramCache]: Analyzing trace with hash 3911588, now seen corresponding path program 3 times [2025-04-26 16:56:04,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:04,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300808488] [2025-04-26 16:56:04,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:56:04,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:04,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:04,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:04,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:56:04,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:04,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:04,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:04,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:04,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:04,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1636565825, now seen corresponding path program 1 times [2025-04-26 16:56:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:04,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124947849] [2025-04-26 16:56:04,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:04,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:04,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:04,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,765 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:04,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:56:04,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:56:04,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:05,075 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:05,075 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:05,075 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:05,075 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:05,075 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:05,075 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,075 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:05,075 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:05,075 INFO L132 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:56:05,075 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:05,075 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:05,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,409 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:05,409 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:05,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,411 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 16:56:05,413 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 16:56:05,414 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 16:56:05,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:05,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:05,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:05,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:05,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:05,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:05,428 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:05,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:05,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,436 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 16:56:05,438 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 16:56:05,439 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 16:56:05,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:05,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:05,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:05,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:05,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:05,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:05,453 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:05,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:05,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,462 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 16:56:05,464 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 16:56:05,464 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 16:56:05,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:05,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:05,475 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:56:05,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:05,486 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:56:05,486 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:56:05,506 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:05,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:05,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,516 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 16:56:05,517 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 16:56:05,518 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 16:56:05,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:05,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:05,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:05,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:05,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:05,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:05,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:05,551 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:05,551 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:05,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,554 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 16:56:05,556 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 16:56:05,557 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:05,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:05,575 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:05,575 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:05,575 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 16:56:05,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:56:05,593 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 16:56:05,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:05,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:05,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:05,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:05,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:05,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:05,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:05,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:05,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:05,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:05,659 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 16:56:05,660 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 16:56:05,660 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 16:56:05,680 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 16:56:05,680 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 16:56:05,681 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 16:56:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-04-26 16:56:05,681 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:56:05,681 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:05,681 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:05,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:05,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:05,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:05,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:05,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:05,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:05,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:05,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:05,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:05,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:05,752 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 16:56:05,752 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 16:56:05,752 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 16:56:05,767 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 16:56:05,767 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 16:56:05,768 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 16:56:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-04-26 16:56:05,768 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:56:05,768 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:05,768 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:56:05,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:56:05,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:56:05,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:05,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:05,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:05,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:05,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:05,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:05,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:05,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:05,832 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 16:56:05,833 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 16:56:05,833 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 16:56:05,855 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 16:56:05,857 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 16:56:05,858 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 16:56:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-04-26 16:56:05,858 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:56:05,858 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:05,858 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 16:56:05,858 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:05,858 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 16:56:05,859 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:05,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 629 transitions. [2025-04-26 16:56:05,864 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:05,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 0 states and 0 transitions. [2025-04-26 16:56:05,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:05,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:05,864 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:05,864 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:05,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:05,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:05,865 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:05,865 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:56:05,865 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:05,865 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:05,865 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:05,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:05,877 INFO L201 PluginConnector]: Adding new model horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:05 BoogieIcfgContainer [2025-04-26 16:56:05,877 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:05,878 INFO L158 Benchmark]: Toolchain (without parser) took 5714.37ms. Allocated memory was 155.2MB in the beginning and 176.2MB in the end (delta: 21.0MB). Free memory was 84.5MB in the beginning and 115.4MB in the end (delta: -30.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:05,878 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:05,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.55ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 82.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:05,879 INFO L158 Benchmark]: Boogie Preprocessor took 26.99ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 81.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:05,879 INFO L158 Benchmark]: RCFGBuilder took 231.70ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 70.8MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:56:05,879 INFO L158 Benchmark]: BuchiAutomizer took 5410.17ms. Allocated memory was 155.2MB in the beginning and 176.2MB in the end (delta: 21.0MB). Free memory was 70.8MB in the beginning and 115.4MB in the end (delta: -44.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:05,880 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.22ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.55ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 82.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.99ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 81.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 231.70ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 70.8MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5410.17ms. Allocated memory was 155.2MB in the beginning and 176.2MB in the end (delta: 21.0MB). Free memory was 70.8MB in the beginning and 115.4MB in the end (delta: -44.6MB). 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 5.2s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 4.0s. 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.2s 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: 52ms 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]: 284, 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 16:56:05,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...