/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/parallel/misc-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:08,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:08,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:08,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:08,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:08,886 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:08,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:08,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:08,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:08,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:08,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:08,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:08,908 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:08,909 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:08,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:08,909 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:08,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:08,910 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:08,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:08,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:08,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:08,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:08,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:08,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:08,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:08,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:08,910 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:08,911 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:08,911 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:09,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:09,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:09,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:09,139 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:09,139 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:09,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-4.wvr.bpl [2025-04-26 16:55:09,140 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-4.wvr.bpl' [2025-04-26 16:55:09,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:09,159 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:09,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:09,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:09,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:09,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,192 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:09,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:09,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:09,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:09,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:09,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,203 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:09,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:09,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:09,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:09,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:09,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:09,243 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:55:09,246 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:55:09,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:09,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:09,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:09,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:09,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:09,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:09,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:09,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:09,264 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:55:09,295 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:09,296 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:09,373 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:09,373 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:09,382 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:09,383 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:09,383 INFO L201 PluginConnector]: Adding new model misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:09 BoogieIcfgContainer [2025-04-26 16:55:09,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:09,384 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:09,384 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:09,390 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:09,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:09,390 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/2) ... [2025-04-26 16:55:09,391 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b4bf44 and model type misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:09, skipping insertion in model container [2025-04-26 16:55:09,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:09,391 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:09" (2/2) ... [2025-04-26 16:55:09,392 INFO L376 chiAutomizerObserver]: Analyzing ICFG misc-4.wvr.bpl [2025-04-26 16:55:09,439 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:55:09,477 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:09,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:09,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:09,480 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:55:09,481 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:55:09,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 89 flow [2025-04-26 16:55:09,541 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 16:55:09,543 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:55:09,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 4/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-26 16:55:09,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 34 transitions, 89 flow [2025-04-26 16:55:09,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 28 transitions, 74 flow [2025-04-26 16:55:09,549 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 34 places, 28 transitions, 74 flow [2025-04-26 16:55:09,554 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:09,737 WARN L140 AmpleReduction]: Number of pruned transitions: 230 [2025-04-26 16:55:09,737 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:09,737 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 21 [2025-04-26 16:55:09,737 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:56 [2025-04-26 16:55:09,738 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:132 [2025-04-26 16:55:09,738 WARN L145 AmpleReduction]: Times succ was already a loop node:40 [2025-04-26 16:55:09,738 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:62 [2025-04-26 16:55:09,738 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:09,740 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 210 states, 208 states have (on average 1.7836538461538463) internal successors, (in total 371), 209 states have internal predecessors, (371), 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:55:09,745 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:09,745 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:09,745 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:09,745 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:09,745 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:09,745 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:09,745 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:09,745 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:09,747 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 210 states, 208 states have (on average 1.7836538461538463) internal successors, (in total 371), 209 states have internal predecessors, (371), 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:55:09,761 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 167 [2025-04-26 16:55:09,762 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:09,762 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:09,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:09,765 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:55:09,766 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:09,766 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 210 states, 208 states have (on average 1.7836538461538463) internal successors, (in total 371), 209 states have internal predecessors, (371), 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:55:09,771 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 167 [2025-04-26 16:55:09,771 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:09,772 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:09,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:09,772 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:55:09,777 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" [2025-04-26 16:55:09,777 INFO L754 eck$LassoCheckResult]: Loop: "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[73] L18-->L19: Formula: v_d1_1 InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" "[75] L19-->L18-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[77] L18-2-->L17: Formula: (or (and v_d1_3 (not v_d1_4)) (and (not v_d1_3) v_d1_4)) InVars {d1=v_d1_4} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[d1]" [2025-04-26 16:55:09,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash 3041, now seen corresponding path program 1 times [2025-04-26 16:55:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167395507] [2025-04-26 16:55:09,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:09,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:09,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:09,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:09,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:09,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:09,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:09,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash 3111237, now seen corresponding path program 1 times [2025-04-26 16:55:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525922662] [2025-04-26 16:55:09,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:09,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:09,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:09,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:09,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:09,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:09,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1484352219, now seen corresponding path program 1 times [2025-04-26 16:55:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910692341] [2025-04-26 16:55:09,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:09,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:09,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:09,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:09,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:09,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:09,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:09,970 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:09,970 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:09,971 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:09,971 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:09,971 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:09,971 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:09,971 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:09,971 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:09,971 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:55:09,971 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:09,971 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:10,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,055 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:10,055 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:10,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,059 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:55:10,060 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:55:10,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:10,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,091 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:55:10,091 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_1=1} Honda state: {v_rep(ite v_assert 1 0)_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:55:10,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:55:10,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,100 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:55:10,102 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:55:10,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:10,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:10,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,133 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:55:10,134 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:55:10,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:10,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,166 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:55:10,167 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {pos=0} Honda state: {pos=0} Generalized eigenvectors: [{pos=-3}, {pos=2}, {pos=2}] Lambdas: [1, 0, 1] Nus: [0, 1] [2025-04-26 16:55:10,173 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:55:10,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,176 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:55:10,178 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:55:10,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:10,179 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,198 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:55:10,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,201 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:55:10,203 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:55:10,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:10,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,227 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:10,231 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:55:10,231 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:10,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:10,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:10,232 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:10,232 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:10,232 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,232 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:10,232 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:10,232 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:55:10,232 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:10,232 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:10,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,262 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:10,266 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:10,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,270 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:55:10,271 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:55:10,273 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:55:10,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:10,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:10,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:10,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:10,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:10,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:10,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:10,292 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:10,298 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:55:10,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,300 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:55:10,302 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:55:10,303 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:55:10,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:10,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:10,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:10,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:10,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:10,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:10,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:10,315 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:10,321 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:55:10,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,322 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:55:10,323 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:55:10,324 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:55:10,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:10,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:10,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:10,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:10,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:10,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:10,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:10,339 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:10,341 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:55:10,341 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:55:10,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,344 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:55:10,345 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:55:10,346 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:10,349 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:55:10,349 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:10,349 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:10,349 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_2) = 1*v_rep(ite d1 1 0)_2 Supporting invariants [] [2025-04-26 16:55:10,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:55:10,357 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:10,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:10,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:10,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:10,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:10,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:10,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:10,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:10,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:10,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:10,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:10,433 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:55:10,450 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:55:10,452 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 210 states, 208 states have (on average 1.7836538461538463) internal successors, (in total 371), 209 states have internal predecessors, (371), 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 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 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:55:10,550 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 210 states, 208 states have (on average 1.7836538461538463) internal successors, (in total 371), 209 states have internal predecessors, (371), 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 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 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 727 states and 1309 transitions. Complement of second has 8 states. [2025-04-26 16:55:10,552 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:55:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 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:55:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-04-26 16:55:10,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:55:10,559 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:10,559 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:55:10,559 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:10,559 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 16:55:10,559 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:10,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 727 states and 1309 transitions. [2025-04-26 16:55:10,569 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 237 [2025-04-26 16:55:10,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 727 states to 508 states and 933 transitions. [2025-04-26 16:55:10,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2025-04-26 16:55:10,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2025-04-26 16:55:10,585 INFO L74 IsDeterministic]: Start isDeterministic. Operand 508 states and 933 transitions. [2025-04-26 16:55:10,585 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:10,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 508 states and 933 transitions. [2025-04-26 16:55:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states and 933 transitions. [2025-04-26 16:55:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 357. [2025-04-26 16:55:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 357 states have (on average 1.9467787114845938) internal successors, (in total 695), 356 states have internal predecessors, (695), 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:55:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 695 transitions. [2025-04-26 16:55:10,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 357 states and 695 transitions. [2025-04-26 16:55:10,617 INFO L438 stractBuchiCegarLoop]: Abstraction has 357 states and 695 transitions. [2025-04-26 16:55:10,617 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:10,617 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 357 states and 695 transitions. [2025-04-26 16:55:10,619 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 187 [2025-04-26 16:55:10,619 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:10,619 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:10,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:55:10,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:55:10,620 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:10,620 INFO L754 eck$LassoCheckResult]: Loop: "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[81] L34-->L35: Formula: v_d2_1 InVars {d2=v_d2_1} OutVars{d2=v_d2_1} AuxVars[] AssignedVars[]" "[83] L35-->L34-2: Formula: (= (+ 2 v_pos_6) v_pos_5) InVars {pos=v_pos_6} OutVars{pos=v_pos_5} AuxVars[] AssignedVars[pos]" "[85] L34-2-->L33: Formula: (or (and v_d2_3 (not v_d2_4)) (and v_d2_4 (not v_d2_3))) InVars {d2=v_d2_4} OutVars{d2=v_d2_3} AuxVars[] AssignedVars[d2]" [2025-04-26 16:55:10,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash 94361, now seen corresponding path program 1 times [2025-04-26 16:55:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:10,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026499552] [2025-04-26 16:55:10,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:10,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:10,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:10,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:10,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:10,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:10,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:10,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,627 INFO L85 PathProgramCache]: Analyzing trace with hash 3357509, now seen corresponding path program 1 times [2025-04-26 16:55:10,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:10,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309446182] [2025-04-26 16:55:10,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:10,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:10,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:10,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:10,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:10,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:10,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:10,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:10,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1247453149, now seen corresponding path program 1 times [2025-04-26 16:55:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:10,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926358652] [2025-04-26 16:55:10,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:10,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:10,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:10,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:10,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:10,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:10,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:10,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:10,666 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:10,666 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:10,667 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:10,667 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:10,667 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:10,667 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,667 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:10,667 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:10,667 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:55:10,667 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:10,667 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:10,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,693 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:10,693 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:10,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,695 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:55:10,697 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:55:10,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:10,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:55:10,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,716 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:55:10,717 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:55:10,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:10,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,747 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:10,751 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:55:10,751 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:10,751 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:10,751 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:10,752 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:10,752 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:10,752 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,752 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:10,752 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:10,752 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:55:10,752 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:10,752 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:10,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,781 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:10,782 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:10,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,784 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:55:10,786 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:55:10,787 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:55:10,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:10,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:10,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:10,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:10,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:10,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:10,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:10,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:10,802 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:55:10,802 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:55:10,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,804 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:55:10,805 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:55:10,806 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:10,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:10,811 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:10,811 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:10,811 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d2 1 0)_2) = 1*v_rep(ite d2 1 0)_2 Supporting invariants [] [2025-04-26 16:55:10,817 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:55:10,817 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:10,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:10,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:10,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:10,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:10,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:10,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:10,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:10,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:10,843 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:10,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:10,867 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:55:10,868 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:55:10,868 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 357 states and 695 transitions. cyclomatic complexity: 372 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 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:55:10,904 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 357 states and 695 transitions. cyclomatic complexity: 372. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 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 1255 states and 2435 transitions. Complement of second has 7 states. [2025-04-26 16:55:10,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 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:55:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-26 16:55:10,908 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:55:10,908 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:10,908 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:55:10,908 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:10,908 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:55:10,908 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:10,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1255 states and 2435 transitions. [2025-04-26 16:55:10,917 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 307 [2025-04-26 16:55:10,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1255 states to 1015 states and 1989 transitions. [2025-04-26 16:55:10,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 505 [2025-04-26 16:55:10,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 555 [2025-04-26 16:55:10,924 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1989 transitions. [2025-04-26 16:55:10,924 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:10,924 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1989 transitions. [2025-04-26 16:55:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1989 transitions. [2025-04-26 16:55:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 784. [2025-04-26 16:55:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 784 states have (on average 2.0433673469387754) internal successors, (in total 1602), 783 states have internal predecessors, (1602), 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:55:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1602 transitions. [2025-04-26 16:55:10,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 784 states and 1602 transitions. [2025-04-26 16:55:10,948 INFO L438 stractBuchiCegarLoop]: Abstraction has 784 states and 1602 transitions. [2025-04-26 16:55:10,948 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:10,948 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 784 states and 1602 transitions. [2025-04-26 16:55:10,952 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 247 [2025-04-26 16:55:10,952 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:10,952 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:10,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:10,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:55:10,953 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[74] L18-->L23: Formula: (not v_d1_2) InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:10,953 INFO L754 eck$LassoCheckResult]: Loop: "[76] L23-->L18-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[77] L18-2-->L17: Formula: (or (and v_d1_3 (not v_d1_4)) (and (not v_d1_3) v_d1_4)) InVars {d1=v_d1_4} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[d1]" "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[74] L18-->L23: Formula: (not v_d1_2) InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:10,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2924676, now seen corresponding path program 1 times [2025-04-26 16:55:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:10,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597487810] [2025-04-26 16:55:10,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:10,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:10,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:10,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:10,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:10,993 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:55:10,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:10,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597487810] [2025-04-26 16:55:10,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597487810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:10,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:10,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:55:10,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548469478] [2025-04-26 16:55:10,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:10,998 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:10,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 3263909, now seen corresponding path program 1 times [2025-04-26 16:55:10,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:10,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141355612] [2025-04-26 16:55:10,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:11,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:11,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:11,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:11,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:11,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:11,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:11,034 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:11,034 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:11,034 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:11,034 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:11,034 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:11,034 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,034 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:11,034 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:11,034 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:55:11,034 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:11,034 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:11,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,059 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:11,059 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:11,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,061 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:55:11,063 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:55:11,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:11,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:11,082 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:55:11,082 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_5=1} Honda state: {v_rep(ite v_assert 1 0)_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:55:11,088 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:55:11,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,090 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:55:11,091 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:55:11,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:11,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:11,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:55:11,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,111 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:55:11,112 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:55:11,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:11,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:11,136 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:11,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:55:11,140 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:11,140 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:11,140 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:11,141 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:11,141 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:11,141 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,141 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:11,141 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:11,141 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:55:11,141 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:11,141 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:11,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,179 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:11,179 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:11,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,185 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:55:11,187 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:55:11,188 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:55:11,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:11,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:11,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:11,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:11,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:11,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:11,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:11,200 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:11,205 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:55:11,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,207 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:55:11,208 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:55:11,209 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:55:11,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:11,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:11,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:11,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:11,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:11,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:11,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:11,224 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:11,225 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:55:11,225 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:55:11,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,227 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:55:11,227 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:55:11,228 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:11,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:55:11,231 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:11,231 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:11,231 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_4) = 1*v_rep(ite d1 1 0)_4 Supporting invariants [] [2025-04-26 16:55:11,239 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:55:11,240 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:11,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:11,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:11,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:11,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:11,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:11,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:11,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:11,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:11,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:11,262 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:11,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:11,346 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:55:11,347 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:55:11,347 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 784 states and 1602 transitions. cyclomatic complexity: 896 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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:55:11,437 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 784 states and 1602 transitions. cyclomatic complexity: 896. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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 3087 states and 6049 transitions. Complement of second has 8 states. [2025-04-26 16:55:11,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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:55:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2025-04-26 16:55:11,438 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:55:11,439 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:11,439 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:55:11,439 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:11,439 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 8 letters. [2025-04-26 16:55:11,439 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:11,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3087 states and 6049 transitions. [2025-04-26 16:55:11,457 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 624 [2025-04-26 16:55:11,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3087 states to 2574 states and 5083 transitions. [2025-04-26 16:55:11,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 955 [2025-04-26 16:55:11,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1013 [2025-04-26 16:55:11,474 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2574 states and 5083 transitions. [2025-04-26 16:55:11,475 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:11,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2574 states and 5083 transitions. [2025-04-26 16:55:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states and 5083 transitions. [2025-04-26 16:55:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2150. [2025-04-26 16:55:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2150 states, 2150 states have (on average 2.054418604651163) internal successors, (in total 4417), 2149 states have internal predecessors, (4417), 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:55:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 4417 transitions. [2025-04-26 16:55:11,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2150 states and 4417 transitions. [2025-04-26 16:55:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:11,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:11,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:11,523 INFO L87 Difference]: Start difference. First operand 2150 states and 4417 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 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:55:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:11,556 INFO L93 Difference]: Finished difference Result 2400 states and 4834 transitions. [2025-04-26 16:55:11,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2400 states and 4834 transitions. [2025-04-26 16:55:11,568 INFO L131 ngComponentsAnalysis]: Automaton has 68 accepting balls. 554 [2025-04-26 16:55:11,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2400 states to 2372 states and 4799 transitions. [2025-04-26 16:55:11,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 843 [2025-04-26 16:55:11,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 843 [2025-04-26 16:55:11,580 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2372 states and 4799 transitions. [2025-04-26 16:55:11,581 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:11,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2372 states and 4799 transitions. [2025-04-26 16:55:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states and 4799 transitions. [2025-04-26 16:55:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2192. [2025-04-26 16:55:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 2192 states have (on average 2.0583941605839415) internal successors, (in total 4512), 2191 states have internal predecessors, (4512), 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:55:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 4512 transitions. [2025-04-26 16:55:11,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2192 states and 4512 transitions. [2025-04-26 16:55:11,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:11,618 INFO L438 stractBuchiCegarLoop]: Abstraction has 2192 states and 4512 transitions. [2025-04-26 16:55:11,618 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:11,618 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2192 states and 4512 transitions. [2025-04-26 16:55:11,625 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 514 [2025-04-26 16:55:11,626 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:11,626 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:11,626 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:11,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:55:11,626 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[82] L34-->L39: Formula: (not v_d2_2) InVars {d2=v_d2_2} OutVars{d2=v_d2_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:11,626 INFO L754 eck$LassoCheckResult]: Loop: "[84] L39-->L34-2: Formula: (= v_pos_8 (+ 2 v_pos_7)) InVars {pos=v_pos_8} OutVars{pos=v_pos_7} AuxVars[] AssignedVars[pos]" "[85] L34-2-->L33: Formula: (or (and v_d2_3 (not v_d2_4)) (and v_d2_4 (not v_d2_3))) InVars {d2=v_d2_4} OutVars{d2=v_d2_3} AuxVars[] AssignedVars[d2]" "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[82] L34-->L39: Formula: (not v_d2_2) InVars {d2=v_d2_2} OutVars{d2=v_d2_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:11,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash 90683452, now seen corresponding path program 1 times [2025-04-26 16:55:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:11,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13573589] [2025-04-26 16:55:11,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:11,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:11,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:11,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:11,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:11,662 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:55:11,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:11,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13573589] [2025-04-26 16:55:11,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13573589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:11,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:11,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:55:11,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964185431] [2025-04-26 16:55:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:11,663 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:11,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 3510181, now seen corresponding path program 1 times [2025-04-26 16:55:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:11,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264531806] [2025-04-26 16:55:11,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:11,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:11,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:11,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:11,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:11,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:11,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:11,694 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:11,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:11,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:11,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:11,694 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:11,694 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,694 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:11,694 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:11,695 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:55:11,695 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:11,695 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:11,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,721 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:11,721 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:11,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,724 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:55:11,725 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:55:11,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:11,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:11,742 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:55:11,742 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_7=1} Honda state: {v_rep(ite v_assert 1 0)_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:55:11,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:55:11,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,751 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:55:11,751 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:55:11,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:11,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:11,768 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:55:11,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,770 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:55:11,772 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:55:11,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:11,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:11,796 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:55:11,796 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {pos=0} Honda state: {pos=0} Generalized eigenvectors: [{pos=1}, {pos=3}, {pos=-6}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-04-26 16:55:11,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:55:11,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,805 INFO L229 MonitoredProcess]: Starting monitored process 25 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:55:11,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:55:11,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:11,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:11,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:55:11,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,828 INFO L229 MonitoredProcess]: Starting monitored process 26 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:55:11,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:55:11,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:11,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:11,857 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:11,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:55:11,864 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:11,864 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:11,864 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:11,864 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:11,864 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:11,864 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,864 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:11,864 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:11,864 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:55:11,865 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:11,865 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:11,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:11,897 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:11,897 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:11,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,899 INFO L229 MonitoredProcess]: Starting monitored process 27 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:55:11,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:55:11,902 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:55:11,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:11,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:11,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:11,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:11,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:11,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:11,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:11,917 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:11,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:55:11,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,926 INFO L229 MonitoredProcess]: Starting monitored process 28 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:55:11,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:55:11,927 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:55:11,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:11,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:11,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:11,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:11,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:11,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:11,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:11,942 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:11,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:55:11,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,949 INFO L229 MonitoredProcess]: Starting monitored process 29 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:55:11,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:55:11,951 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:55:11,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:11,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:11,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:11,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:11,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:11,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:11,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:11,962 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:11,965 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:55:11,965 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:55:11,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:11,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:11,967 INFO L229 MonitoredProcess]: Starting monitored process 30 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:55:11,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:55:11,970 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:11,972 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:55:11,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:11,973 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:11,973 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:11,973 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d2 1 0)_4) = 1*v_rep(ite d2 1 0)_4 Supporting invariants [] [2025-04-26 16:55:11,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:55:11,980 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:11,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:11,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:12,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:12,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:12,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:12,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:12,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:12,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:12,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:12,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:12,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:12,014 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:12,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:12,073 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:55:12,073 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:55:12,074 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2192 states and 4512 transitions. cyclomatic complexity: 2460 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:55:12,168 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2192 states and 4512 transitions. cyclomatic complexity: 2460. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 7144 states and 14039 transitions. Complement of second has 8 states. [2025-04-26 16:55:12,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:55:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-04-26 16:55:12,170 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:55:12,170 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:12,170 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:55:12,170 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:12,170 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:55:12,170 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:12,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7144 states and 14039 transitions. [2025-04-26 16:55:12,206 INFO L131 ngComponentsAnalysis]: Automaton has 118 accepting balls. 1116 [2025-04-26 16:55:12,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7144 states to 6151 states and 12242 transitions. [2025-04-26 16:55:12,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1722 [2025-04-26 16:55:12,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1791 [2025-04-26 16:55:12,243 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6151 states and 12242 transitions. [2025-04-26 16:55:12,243 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:12,243 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6151 states and 12242 transitions. [2025-04-26 16:55:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6151 states and 12242 transitions. [2025-04-26 16:55:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6151 to 5336. [2025-04-26 16:55:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5336 states, 5336 states have (on average 2.0432908545727138) internal successors, (in total 10903), 5335 states have internal predecessors, (10903), 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:55:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5336 states to 5336 states and 10903 transitions. [2025-04-26 16:55:12,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5336 states and 10903 transitions. [2025-04-26 16:55:12,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:12,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:12,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:12,355 INFO L87 Difference]: Start difference. First operand 5336 states and 10903 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 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:55:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:12,387 INFO L93 Difference]: Finished difference Result 6158 states and 12446 transitions. [2025-04-26 16:55:12,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6158 states and 12446 transitions. [2025-04-26 16:55:12,416 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 1044 [2025-04-26 16:55:12,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6158 states to 6131 states and 12381 transitions. [2025-04-26 16:55:12,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1636 [2025-04-26 16:55:12,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1636 [2025-04-26 16:55:12,449 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6131 states and 12381 transitions. [2025-04-26 16:55:12,449 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:12,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6131 states and 12381 transitions. [2025-04-26 16:55:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states and 12381 transitions. [2025-04-26 16:55:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 5565. [2025-04-26 16:55:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5565 states, 5565 states have (on average 2.0501347708894877) internal successors, (in total 11409), 5564 states have internal predecessors, (11409), 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:55:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5565 states to 5565 states and 11409 transitions. [2025-04-26 16:55:12,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5565 states and 11409 transitions. [2025-04-26 16:55:12,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:12,571 INFO L438 stractBuchiCegarLoop]: Abstraction has 5565 states and 11409 transitions. [2025-04-26 16:55:12,571 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:12,571 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5565 states and 11409 transitions. [2025-04-26 16:55:12,590 INFO L131 ngComponentsAnalysis]: Automaton has 94 accepting balls. 972 [2025-04-26 16:55:12,590 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:12,590 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:12,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:12,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2025-04-26 16:55:12,591 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[73] L18-->L19: Formula: v_d1_1 InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" "[75] L19-->L18-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[77] L18-2-->L17: Formula: (or (and v_d1_3 (not v_d1_4)) (and (not v_d1_3) v_d1_4)) InVars {d1=v_d1_4} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[d1]" "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[74] L18-->L23: Formula: (not v_d1_2) InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" "[76] L23-->L18-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" [2025-04-26 16:55:12,591 INFO L754 eck$LassoCheckResult]: Loop: "[77] L18-2-->L17: Formula: (or (and v_d1_3 (not v_d1_4)) (and (not v_d1_3) v_d1_4)) InVars {d1=v_d1_4} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[d1]" "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[73] L18-->L19: Formula: v_d1_1 InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" "[75] L19-->L18-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[77] L18-2-->L17: Formula: (or (and v_d1_3 (not v_d1_4)) (and (not v_d1_3) v_d1_4)) InVars {d1=v_d1_4} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[d1]" "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[74] L18-->L23: Formula: (not v_d1_2) InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" "[76] L23-->L18-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" [2025-04-26 16:55:12,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash 646393988, now seen corresponding path program 1 times [2025-04-26 16:55:12,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:12,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799095926] [2025-04-26 16:55:12,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:12,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:12,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:12,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:12,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:12,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:12,595 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:12,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:12,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:12,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:12,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:12,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:12,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash -5236327, now seen corresponding path program 1 times [2025-04-26 16:55:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:12,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324037348] [2025-04-26 16:55:12,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:12,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:12,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:12,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:12,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:12,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:12,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:12,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:12,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:12,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:12,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:12,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1661736732, now seen corresponding path program 2 times [2025-04-26 16:55:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:12,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6240232] [2025-04-26 16:55:12,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:12,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-26 16:55:12,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:55:12,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:12,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:12,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:12,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:55:12,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:55:12,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:12,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:12,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:12,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:12,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:12,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:12,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:12,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:12,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:12,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:12,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:12,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:12,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:55:12,754 INFO L201 PluginConnector]: Adding new model misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:12 BoogieIcfgContainer [2025-04-26 16:55:12,754 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:12,755 INFO L158 Benchmark]: Toolchain (without parser) took 3596.00ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 38.9MB in the end (delta: 47.7MB). Peak memory consumption was 49.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:12,755 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 199.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:12,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.41ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:12,755 INFO L158 Benchmark]: Boogie Preprocessor took 22.65ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.5MB in the end (delta: 997.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:12,755 INFO L158 Benchmark]: RCFGBuilder took 165.53ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 73.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:12,756 INFO L158 Benchmark]: BuchiAutomizer took 3370.43ms. Allocated memory is still 159.4MB. Free memory was 73.5MB in the beginning and 38.9MB in the end (delta: 34.7MB). Peak memory consumption was 36.8MB. Max. memory is 8.0GB. [2025-04-26 16:55:12,758 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.20ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 199.7kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.41ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.65ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.5MB in the end (delta: 997.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 165.53ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 73.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3370.43ms. Allocated memory is still 159.4MB. Free memory was 73.5MB in the beginning and 38.9MB in the end (delta: 34.7MB). Peak memory consumption was 36.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 6. Automata minimization 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 2367 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 469 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 221 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp54 ukn100 mio100 lsp100 div100 bol133 ite100 ukn100 eq150 hnf100 smp100 dnf100 smp100 tf116 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 266, Number of transitions in reduction automaton: 371, Number of states in reduction automaton: 210, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (if d1 then 1 else 0) and consists of 5 locations. One deterministic module has affine ranking function (if d2 then 1 else 0) and consists of 4 locations. One deterministic module has affine ranking function (if d1 then 1 else 0) and consists of 5 locations. One deterministic module has affine ranking function (if d2 then 1 else 0) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 5565 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 18]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L55] 0 assume pos == 0 && (d1 == d2 && d1 == true) && v_assert == true; VAL [d1=true, d2=true, pos=0, v_assert=true] [L56] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, pos=0, v_assert=true] [L17] COND TRUE 1 v_assert VAL [d1=true, d2=true, pos=0, v_assert=true] [L18] COND TRUE 1 d1 VAL [d1=true, d2=true, pos=0, v_assert=true] [L19] 1 pos := pos + 1; VAL [d1=true, d2=true, pos=1, v_assert=true] [L26] 1 d1 := !d1; VAL [d1=false, d2=true, pos=1, v_assert=true] [L17] COND TRUE 1 v_assert VAL [d1=false, d2=true, pos=1, v_assert=true] [L18] COND FALSE 1 !(d1) VAL [d1=false, d2=true, pos=1, v_assert=true] [L23] 1 pos := pos - 1; VAL [d1=false, d2=true, pos=0, v_assert=true] Loop: [L26] d1 := !d1; [L17] COND TRUE v_assert [L18] COND TRUE d1 [L19] pos := pos + 1; [L26] d1 := !d1; [L17] COND TRUE v_assert [L18] COND FALSE !(d1) [L23] pos := pos - 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 18]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L55] 0 assume pos == 0 && (d1 == d2 && d1 == true) && v_assert == true; VAL [d1=true, d2=true, pos=0, v_assert=true] [L56] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, pos=0, v_assert=true] [L17] COND TRUE 1 v_assert VAL [d1=true, d2=true, pos=0, v_assert=true] [L18] COND TRUE 1 d1 VAL [d1=true, d2=true, pos=0, v_assert=true] [L19] 1 pos := pos + 1; VAL [d1=true, d2=true, pos=1, v_assert=true] [L26] 1 d1 := !d1; VAL [d1=false, d2=true, pos=1, v_assert=true] [L17] COND TRUE 1 v_assert VAL [d1=false, d2=true, pos=1, v_assert=true] [L18] COND FALSE 1 !(d1) VAL [d1=false, d2=true, pos=1, v_assert=true] [L23] 1 pos := pos - 1; VAL [d1=false, d2=true, pos=0, v_assert=true] Loop: [L26] d1 := !d1; [L17] COND TRUE v_assert [L18] COND TRUE d1 [L19] pos := pos + 1; [L26] d1 := !d1; [L17] COND TRUE v_assert [L18] COND FALSE !(d1) [L23] pos := pos - 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:55:12,771 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...