/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:25:12,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:25:12,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:25:12,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:25:12,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:25:12,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:25:12,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:25:12,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:25:12,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:25:12,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:25:12,288 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:25:12,289 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:25:12,289 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:25:12,289 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:25:12,289 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:25:12,289 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:25:12,289 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:25:12,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:25:12,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:25:12,289 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:25:12,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:25:12,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:25:12,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:25:12,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:25:12,291 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:25:12,291 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:25:12,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:25:12,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:25:12,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:25:12,512 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:25:12,513 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:25:12,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_4.c.bpl [2025-04-26 16:25:12,514 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_4.c.bpl' [2025-04-26 16:25:12,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:25:12,529 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:25:12,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:25:12,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:25:12,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:25:12,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,566 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:25:12,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:25:12,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:25:12,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:25:12,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:25:12,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,577 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:25:12,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:25:12,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:25:12,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:25:12,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/1) ... [2025-04-26 16:25:12,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:12,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:12,617 INFO L229 MonitoredProcess]: Starting monitored process 1 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:25:12,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:25:12,642 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:25:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:25:12,642 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:25:12,642 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:25:12,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:25:12,643 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:25:12,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:25:12,643 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:25:12,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:25:12,643 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:25:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:25:12,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:25:12,644 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:25:12,681 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:25:12,682 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:25:12,754 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:25:12,755 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:25:12,764 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:25:12,765 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:25:12,766 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:25:12 BoogieIcfgContainer [2025-04-26 16:25:12,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:25:12,767 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:25:12,767 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:25:12,771 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:25:12,772 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:25:12,772 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:12" (1/2) ... [2025-04-26 16:25:12,773 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cb67cae and model type indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:25:12, skipping insertion in model container [2025-04-26 16:25:12,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:25:12,773 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:25:12" (2/2) ... [2025-04-26 16:25:12,774 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_4.c.bpl [2025-04-26 16:25:12,833 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:25:12,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 96 flow [2025-04-26 16:25:12,891 INFO L116 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-04-26 16:25:12,894 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:25:12,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 4/26 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-04-26 16:25:12,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 34 transitions, 96 flow [2025-04-26 16:25:12,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 76 flow [2025-04-26 16:25:12,905 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 26 transitions, 76 flow [2025-04-26 16:25:12,913 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:25:12,914 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:25:12,914 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:25:12,914 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:25:12,914 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:25:12,914 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:25:12,914 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:25:12,914 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:25:12,916 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:25:13,081 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 480 [2025-04-26 16:25:13,081 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:13,081 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:13,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:25:13,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:13,085 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:25:13,085 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 526 states, but on-demand construction may add more states [2025-04-26 16:25:13,098 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 480 [2025-04-26 16:25:13,098 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:13,098 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:13,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:25:13,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:13,107 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:25:13,107 INFO L754 eck$LassoCheckResult]: Loop: "[65] L25-->L27: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[67] L27-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:25:13,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2025-04-26 16:25:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:13,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519937224] [2025-04-26 16:25:13,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:13,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:13,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:13,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:13,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:13,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:13,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:13,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:13,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash 3043, now seen corresponding path program 1 times [2025-04-26 16:25:13,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:13,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33812569] [2025-04-26 16:25:13,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:13,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:13,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:13,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:13,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:13,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:13,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:13,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:13,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash 111636, now seen corresponding path program 1 times [2025-04-26 16:25:13,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:13,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702983118] [2025-04-26 16:25:13,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:13,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:13,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:13,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:13,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:13,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:13,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:13,289 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:13,290 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:13,290 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:13,290 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:13,290 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:13,290 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,290 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:13,290 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:13,290 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:25:13,291 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:13,291 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:13,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:13,339 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:13,339 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:13,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,343 INFO L229 MonitoredProcess]: Starting monitored process 2 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:25:13,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:13,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:13,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:25:13,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:13,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,397 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:25:13,397 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:25:13,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:13,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:13,468 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:13,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:13,472 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:13,472 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:13,472 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:13,472 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:13,472 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:13,472 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,472 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:13,472 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:13,472 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:25:13,472 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:13,472 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:13,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:13,498 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:13,501 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:13,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,504 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:25:13,505 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:25:13,507 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:25:13,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:13,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:13,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:13,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:13,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:13,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:13,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:13,529 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:13,535 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:13,535 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:13,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,538 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:25:13,540 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:25:13,540 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:13,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:25:13,543 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:13,544 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:13,544 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:25:13,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:25:13,552 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:13,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:13,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:13,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:13,580 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:13,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:13,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:13,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:13,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:13,614 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:13,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:13,641 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:25:13,690 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:25:13,708 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 526 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:25:13,878 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 526 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 1469 states and 6262 transitions. Complement of second has 6 states. [2025-04-26 16:25:13,880 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:25:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:25:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-04-26 16:25:13,893 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:25:13,893 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:13,893 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:25:13,894 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:13,894 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:25:13,894 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:13,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1469 states and 6262 transitions. [2025-04-26 16:25:13,931 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 450 [2025-04-26 16:25:13,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1469 states to 1057 states and 4537 transitions. [2025-04-26 16:25:13,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 477 [2025-04-26 16:25:13,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 767 [2025-04-26 16:25:13,965 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1057 states and 4537 transitions. [2025-04-26 16:25:13,966 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:13,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1057 states and 4537 transitions. [2025-04-26 16:25:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states and 4537 transitions. [2025-04-26 16:25:14,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 769. [2025-04-26 16:25:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 769 states have (on average 4.417425227568271) internal successors, (in total 3397), 768 states have internal predecessors, (3397), 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:25:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3397 transitions. [2025-04-26 16:25:14,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 769 states and 3397 transitions. [2025-04-26 16:25:14,036 INFO L438 stractBuchiCegarLoop]: Abstraction has 769 states and 3397 transitions. [2025-04-26 16:25:14,036 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:25:14,036 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 769 states and 3397 transitions. [2025-04-26 16:25:14,044 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 450 [2025-04-26 16:25:14,044 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:14,044 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:14,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:25:14,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:14,045 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] L12-->L34: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:25:14,045 INFO L754 eck$LassoCheckResult]: Loop: "[69] L34-->L36: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[71] L36-->L34: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:25:14,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,046 INFO L85 PathProgramCache]: Analyzing trace with hash 3620, now seen corresponding path program 1 times [2025-04-26 16:25:14,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:14,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257368476] [2025-04-26 16:25:14,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:14,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:14,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:14,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2025-04-26 16:25:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:14,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130410102] [2025-04-26 16:25:14,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:14,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:14,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:14,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 3481030, now seen corresponding path program 1 times [2025-04-26 16:25:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:14,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076022129] [2025-04-26 16:25:14,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:14,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:14,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:14,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:14,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:14,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:14,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:14,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:14,092 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:14,092 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:14,092 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:14,092 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:14,092 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:14,092 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,092 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:14,092 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:14,092 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:25:14,092 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:14,092 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:14,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:14,112 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:14,112 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:14,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,115 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:25:14,116 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:25:14,118 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:14,118 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:14,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:25:14,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,138 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:25:14,139 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:25:14,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:14,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:14,209 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:14,213 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:25:14,213 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:14,214 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:14,214 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:14,214 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:14,214 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:14,214 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,214 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:14,214 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:14,214 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:25:14,214 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:14,214 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:14,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:14,239 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:14,239 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:14,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,241 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:25:14,242 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:25:14,243 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:25:14,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:14,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:14,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:14,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:14,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:14,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:14,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:14,257 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:14,260 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:14,260 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:14,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,262 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:25:14,263 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:25:14,264 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:14,267 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:25:14,267 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:14,267 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:14,267 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:25:14,273 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:25:14,274 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:14,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:14,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:14,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:14,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:14,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:14,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:14,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:14,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:14,319 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:25:14,320 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:25:14,320 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 769 states and 3397 transitions. cyclomatic complexity: 2785 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 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:25:14,398 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 769 states and 3397 transitions. cyclomatic complexity: 2785. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 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) Result 2370 states and 10925 transitions. Complement of second has 6 states. [2025-04-26 16:25:14,399 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:25:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 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:25:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-26 16:25:14,400 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:25:14,400 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:14,400 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:25:14,400 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:14,400 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:25:14,400 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:14,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2370 states and 10925 transitions. [2025-04-26 16:25:14,427 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 386 [2025-04-26 16:25:14,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2370 states to 1656 states and 7637 transitions. [2025-04-26 16:25:14,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 594 [2025-04-26 16:25:14,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 905 [2025-04-26 16:25:14,467 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1656 states and 7637 transitions. [2025-04-26 16:25:14,467 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:14,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1656 states and 7637 transitions. [2025-04-26 16:25:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states and 7637 transitions. [2025-04-26 16:25:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1345. [2025-04-26 16:25:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1345 states have (on average 4.811895910780669) internal successors, (in total 6472), 1344 states have internal predecessors, (6472), 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:25:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 6472 transitions. [2025-04-26 16:25:14,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1345 states and 6472 transitions. [2025-04-26 16:25:14,506 INFO L438 stractBuchiCegarLoop]: Abstraction has 1345 states and 6472 transitions. [2025-04-26 16:25:14,506 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:25:14,506 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1345 states and 6472 transitions. [2025-04-26 16:25:14,516 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 386 [2025-04-26 16:25:14,517 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:14,517 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:14,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:25:14,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:25:14,517 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] L12-->L34: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[89] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:25:14,517 INFO L754 eck$LassoCheckResult]: Loop: "[73] L43-->L45: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[75] L45-->L46: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[76] L46-->L43: Formula: (= v_x4_1 (+ v_x4_2 1)) InVars {x4=v_x4_2} OutVars{x4=v_x4_1} AuxVars[] AssignedVars[x4]" [2025-04-26 16:25:14,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,518 INFO L85 PathProgramCache]: Analyzing trace with hash 112309, now seen corresponding path program 1 times [2025-04-26 16:25:14,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:14,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552499064] [2025-04-26 16:25:14,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:14,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:14,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:14,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:14,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:14,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:14,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:14,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:14,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 1 times [2025-04-26 16:25:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:14,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18892728] [2025-04-26 16:25:14,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:14,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:14,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:14,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:14,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:14,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:14,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:14,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash -949097323, now seen corresponding path program 1 times [2025-04-26 16:25:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:14,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616568675] [2025-04-26 16:25:14,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:14,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:14,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:14,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,539 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:14,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:14,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:14,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:14,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:14,561 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:14,561 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:14,561 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:14,561 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:14,561 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:14,561 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,561 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:14,561 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:14,561 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:25:14,561 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:14,561 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:14,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:14,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:14,590 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:14,590 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:14,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,593 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:25:14,594 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:25:14,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:14,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:14,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:14,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,613 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:25:14,615 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:25:14,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:14,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:14,641 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:25:14,641 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x4=0} Honda state: {x4=0} Generalized eigenvectors: [{x4=2}, {x4=-6}, {x4=5}] Lambdas: [4, 1, 1] Nus: [1, 0] [2025-04-26 16:25:14,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:14,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,650 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:25:14,651 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:25:14,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:14,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:14,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:14,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,671 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:25:14,672 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:25:14,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:14,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:14,738 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:14,742 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:25:14,742 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:14,742 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:14,742 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:14,742 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:14,742 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:14,742 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,742 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:14,742 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:14,742 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:25:14,742 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:14,742 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:14,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:14,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:14,769 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:14,769 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:14,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,773 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:25:14,774 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:25:14,775 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:25:14,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:14,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:14,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:14,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:14,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:14,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:14,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:14,789 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:25:14,795 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:25:14,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,798 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:25:14,799 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:25:14,801 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:25:14,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:14,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:14,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:14,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:14,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:14,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:14,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:14,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:14,816 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:25:14,816 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:25:14,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:14,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:14,818 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:25:14,819 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:25:14,821 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:14,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:14,824 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:14,825 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:14,825 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:25:14,830 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:25:14,831 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:14,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:14,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:14,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:14,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:14,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:14,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:14,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:14,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:14,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:14,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:14,858 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:14,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:14,898 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:25:14,898 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:25:14,899 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1345 states and 6472 transitions. cyclomatic complexity: 5336 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:25:15,002 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1345 states and 6472 transitions. cyclomatic complexity: 5336. 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 3979 states and 19420 transitions. Complement of second has 6 states. [2025-04-26 16:25:15,003 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:25:15,003 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:25:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 16:25:15,004 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:25:15,004 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:15,004 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:25:15,004 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:15,004 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:25:15,004 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:15,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3979 states and 19420 transitions. [2025-04-26 16:25:15,093 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 212 [2025-04-26 16:25:15,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3979 states to 2215 states and 10882 transitions. [2025-04-26 16:25:15,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 685 [2025-04-26 16:25:15,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 832 [2025-04-26 16:25:15,131 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2215 states and 10882 transitions. [2025-04-26 16:25:15,131 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:15,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2215 states and 10882 transitions. [2025-04-26 16:25:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states and 10882 transitions. [2025-04-26 16:25:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1994. [2025-04-26 16:25:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1994 states have (on average 4.984954864593782) internal successors, (in total 9940), 1993 states have internal predecessors, (9940), 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:25:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 9940 transitions. [2025-04-26 16:25:15,190 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1994 states and 9940 transitions. [2025-04-26 16:25:15,190 INFO L438 stractBuchiCegarLoop]: Abstraction has 1994 states and 9940 transitions. [2025-04-26 16:25:15,190 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:25:15,190 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1994 states and 9940 transitions. [2025-04-26 16:25:15,207 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 212 [2025-04-26 16:25:15,207 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:15,207 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:15,208 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:25:15,208 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:15,208 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] L12-->L34: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[89] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[92] L14-->L53: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:25:15,208 INFO L754 eck$LassoCheckResult]: Loop: "[78] L53-->L55: Formula: (< v_x4_3 v_z_7) InVars {x4=v_x4_3, z=v_z_7} OutVars{x4=v_x4_3, z=v_z_7} AuxVars[] AssignedVars[]" "[80] L55-->L53: Formula: (= v_x4_4 (+ v_x4_5 1)) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 16:25:15,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash 3481671, now seen corresponding path program 1 times [2025-04-26 16:25:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:15,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526308624] [2025-04-26 16:25:15,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:15,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:15,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:15,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:15,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:15,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:15,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:15,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:15,216 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-04-26 16:25:15,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:15,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332611341] [2025-04-26 16:25:15,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:15,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:15,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:15,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:15,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:15,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:15,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:15,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:15,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash -949078967, now seen corresponding path program 1 times [2025-04-26 16:25:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:15,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716699128] [2025-04-26 16:25:15,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:15,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:15,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:15,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:15,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:15,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:15,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:15,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:15,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:15,239 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:15,240 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:15,240 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:15,240 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:15,240 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:15,240 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:15,240 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:15,240 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:15,240 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:25:15,240 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:15,240 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:15,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:15,259 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:15,259 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:15,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:15,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:15,262 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:25:15,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:15,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:15,284 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:25:15,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:15,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:15,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:15,303 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:25:15,304 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:25:15,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:15,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:15,372 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:15,377 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:25:15,377 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:15,377 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:15,377 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:15,377 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:15,377 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:15,377 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:15,377 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:15,377 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:15,377 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:25:15,377 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:15,378 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:15,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:15,397 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:15,397 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:15,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:15,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:15,400 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:25:15,400 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:25:15,401 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:25:15,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:15,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:15,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:15,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:15,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:15,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:15,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:15,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:15,418 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:25:15,418 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:25:15,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:15,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:15,421 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:25:15,422 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:25:15,423 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:15,426 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:25:15,427 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:25:15,427 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:15,427 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:15,427 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:25:15,432 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:25:15,433 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:15,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:15,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:15,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:15,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:15,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:15,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:15,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:15,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:15,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:15,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:15,466 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:15,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:15,482 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:25:15,483 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:25:15,483 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1994 states and 9940 transitions. cyclomatic complexity: 8222 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 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:25:15,596 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1994 states and 9940 transitions. cyclomatic complexity: 8222. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 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 7104 states and 34748 transitions. Complement of second has 6 states. [2025-04-26 16:25:15,596 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:25:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 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:25:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 16:25:15,597 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:25:15,597 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:15,597 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:25:15,597 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:15,597 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:25:15,597 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:15,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7104 states and 34748 transitions. [2025-04-26 16:25:15,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:25:15,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7104 states to 0 states and 0 transitions. [2025-04-26 16:25:15,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:25:15,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:25:15,717 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:25:15,717 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:25:15,717 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:25:15,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:25:15,718 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:25:15,718 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:25:15,718 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:25:15,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:25:15,718 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:25:15,724 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:25:15 BoogieIcfgContainer [2025-04-26 16:25:15,724 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:25:15,725 INFO L158 Benchmark]: Toolchain (without parser) took 3195.69ms. Allocated memory was 159.4MB in the beginning and 264.2MB in the end (delta: 104.9MB). Free memory was 88.2MB in the beginning and 156.0MB in the end (delta: -67.8MB). Peak memory consumption was 42.1MB. Max. memory is 8.0GB. [2025-04-26 16:25:15,726 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:25:15,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.33ms. Allocated memory is still 159.4MB. Free memory was 88.2MB in the beginning and 86.3MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:25:15,726 INFO L158 Benchmark]: Boogie Preprocessor took 22.02ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 85.3MB in the end (delta: 988.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:25:15,728 INFO L158 Benchmark]: RCFGBuilder took 174.77ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 76.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:25:15,728 INFO L158 Benchmark]: BuchiAutomizer took 2957.12ms. Allocated memory was 159.4MB in the beginning and 264.2MB in the end (delta: 104.9MB). Free memory was 76.1MB in the beginning and 156.0MB in the end (delta: -79.9MB). Peak memory consumption was 29.5MB. Max. memory is 8.0GB. [2025-04-26 16:25:15,729 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.15ms. Allocated memory is still 159.4MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.33ms. Allocated memory is still 159.4MB. Free memory was 88.2MB in the beginning and 86.3MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.02ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 85.3MB in the end (delta: 988.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 174.77ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 76.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2957.12ms. Allocated memory was 159.4MB in the beginning and 264.2MB in the end (delta: 104.9MB). Free memory was 76.1MB in the beginning and 156.0MB in the end (delta: -79.9MB). Peak memory consumption was 29.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 820 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.3s 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, 176 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 82 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 42ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:25:15,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...