/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_6.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:25:18,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:25:18,837 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:18,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:25:18,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:25:18,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:25:18,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:25:18,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:25:18,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:25:18,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:25:18,863 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:25:18,863 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:25:18,863 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:25:18,863 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:25:18,863 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:25:18,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:25:18,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:25:18,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:25:18,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:25:18,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:25:18,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:25:18,865 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:25:18,865 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:25:19,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:25:19,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:25:19,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:25:19,074 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:25:19,074 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:25:19,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_6.c.bpl [2025-04-26 16:25:19,075 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_6.c.bpl' [2025-04-26 16:25:19,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:25:19,095 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:25:19,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:25:19,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:25:19,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:25:19,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,131 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:25:19,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:25:19,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:25:19,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:25:19,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:25:19,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:25:19,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:25:19,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:25:19,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:25:19,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/1) ... [2025-04-26 16:25:19,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:19,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:19,198 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:19,204 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:19,227 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:25:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:25:19,227 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:25:19,227 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:25:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:25:19,227 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:25:19,227 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:25:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:25:19,227 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:25:19,227 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:25:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:25:19,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:25:19,227 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:25:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:25:19,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:25:19,228 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:25:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:25:19,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:25:19,228 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:25:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:25:19,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:25:19,230 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:19,268 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:25:19,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:25:19,373 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:25:19,374 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:25:19,384 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:25:19,384 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:25:19,385 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:25:19 BoogieIcfgContainer [2025-04-26 16:25:19,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:25:19,386 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:25:19,386 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:25:19,391 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:25:19,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:25:19,392 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:19" (1/2) ... [2025-04-26 16:25:19,393 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30561cdd and model type indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:25:19, skipping insertion in model container [2025-04-26 16:25:19,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:25:19,393 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:25:19" (2/2) ... [2025-04-26 16:25:19,394 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_6.c.bpl [2025-04-26 16:25:19,464 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:25:19,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 142 flow [2025-04-26 16:25:19,510 INFO L116 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-04-26 16:25:19,512 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:25:19,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 38 events. 6/38 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2025-04-26 16:25:19,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 142 flow [2025-04-26 16:25:19,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 112 flow [2025-04-26 16:25:19,519 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 51 places, 38 transitions, 112 flow [2025-04-26 16:25:19,526 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:25:19,527 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:25:19,527 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:25:19,527 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:25:19,527 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:25:19,527 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:25:19,527 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:25:19,527 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:25:19,530 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:25:20,448 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 8256 [2025-04-26 16:25:20,449 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:20,449 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:20,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:25:20,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:20,452 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:25:20,452 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 8446 states, but on-demand construction may add more states [2025-04-26 16:25:20,607 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 8256 [2025-04-26 16:25:20,608 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:20,608 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:20,608 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:25:20,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:20,613 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:25:20,613 INFO L754 eck$LassoCheckResult]: Loop: "[95] L29-->L31: 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[]" "[97] L31-->L29: 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:20,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2025-04-26 16:25:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:20,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467925496] [2025-04-26 16:25:20,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:20,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:20,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:20,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:20,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:20,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:20,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:20,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:20,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:20,698 INFO L85 PathProgramCache]: Analyzing trace with hash 4003, now seen corresponding path program 1 times [2025-04-26 16:25:20,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:20,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689481976] [2025-04-26 16:25:20,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:20,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:20,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:20,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:20,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:20,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:20,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:20,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:20,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash 149114, now seen corresponding path program 1 times [2025-04-26 16:25:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:20,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889138049] [2025-04-26 16:25:20,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:20,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:20,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:20,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:20,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:20,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:20,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:20,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:20,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:20,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:20,785 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:20,786 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:20,786 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:20,786 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:20,786 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:20,786 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,786 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:20,786 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:20,786 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:25:20,787 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:20,787 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:20,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:20,832 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:20,833 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:20,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:20,837 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:20,838 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:20,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:20,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:20,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:25:20,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:20,859 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:20,860 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:20,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:20,861 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:20,928 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:20,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:25:20,932 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:20,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:20,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:20,932 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:20,933 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:20,933 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,933 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:20,933 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:20,933 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:25:20,933 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:20,933 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:20,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:20,952 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:20,954 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:20,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:20,957 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:20,958 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:20,960 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:20,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:20,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:20,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:20,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:20,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:20,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:20,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:20,980 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:20,984 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:20,984 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:20,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:20,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:20,987 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:20,989 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:20,990 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:20,992 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:25:20,993 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:20,993 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:20,994 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:20,994 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:25:21,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:21,002 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:21,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:21,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:21,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:21,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:21,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:21,055 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:21,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:21,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:21,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:21,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:21,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:21,076 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:21,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:21,098 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:21,147 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:21,154 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 8446 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:21,958 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 8446 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 23629 states and 150994 transitions. Complement of second has 6 states. [2025-04-26 16:25:21,961 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:21,965 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:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-26 16:25:21,972 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:25:21,973 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:21,973 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:25:21,973 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:21,973 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:25:21,973 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:21,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23629 states and 150994 transitions. [2025-04-26 16:25:22,613 INFO L131 ngComponentsAnalysis]: Automaton has 1505 accepting balls. 8130 [2025-04-26 16:25:23,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23629 states to 18169 states and 117209 transitions. [2025-04-26 16:25:23,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8253 [2025-04-26 16:25:23,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13211 [2025-04-26 16:25:23,181 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18169 states and 117209 transitions. [2025-04-26 16:25:23,181 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:23,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18169 states and 117209 transitions. [2025-04-26 16:25:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states and 117209 transitions. [2025-04-26 16:25:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 13213. [2025-04-26 16:25:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13213 states, 13213 states have (on average 6.644743812911527) internal successors, (in total 87797), 13212 states have internal predecessors, (87797), 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:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13213 states to 13213 states and 87797 transitions. [2025-04-26 16:25:23,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13213 states and 87797 transitions. [2025-04-26 16:25:23,948 INFO L438 stractBuchiCegarLoop]: Abstraction has 13213 states and 87797 transitions. [2025-04-26 16:25:23,948 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:25:23,948 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13213 states and 87797 transitions. [2025-04-26 16:25:24,086 INFO L131 ngComponentsAnalysis]: Automaton has 1505 accepting balls. 8130 [2025-04-26 16:25:24,086 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:24,086 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:24,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:25:24,087 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:24,088 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[124] L12-->L38: 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:24,088 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L40: 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[]" "[101] L40-->L38: 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:24,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash 4836, now seen corresponding path program 1 times [2025-04-26 16:25:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:24,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127380221] [2025-04-26 16:25:24,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:24,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:24,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:24,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:24,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:24,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:24,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:24,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:24,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:24,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:24,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:24,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash 4131, now seen corresponding path program 1 times [2025-04-26 16:25:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:24,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389182291] [2025-04-26 16:25:24,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:24,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:24,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:24,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:24,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:24,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:24,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:24,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:24,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:24,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:24,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:24,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash 4650566, now seen corresponding path program 1 times [2025-04-26 16:25:24,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:24,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372963484] [2025-04-26 16:25:24,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:24,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:24,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:24,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:24,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:24,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:24,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:24,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:24,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:24,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:24,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:24,152 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:24,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:24,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:24,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:24,152 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:24,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:24,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:24,152 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:24,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:25:24,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:24,153 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:24,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:24,174 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:24,174 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:24,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:24,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:24,178 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:24,179 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:24,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:24,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:24,196 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:24,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:24,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:24,198 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:24,199 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:24,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:24,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:24,271 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:24,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:24,275 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:24,276 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:24,276 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:24,276 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:24,276 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:24,276 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:24,276 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:24,276 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:24,276 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:25:24,276 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:24,276 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:24,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:24,471 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:24,472 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:24,482 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:24,490 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:24,494 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:24,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:24,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:24,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:24,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:24,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:24,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:24,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:24,514 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:24,531 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:24,531 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:24,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:24,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:24,534 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:24,537 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:24,539 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:24,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:24,540 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:24,540 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:24,540 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:25:24,545 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:24,546 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:24,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:24,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:24,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:24,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:24,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:24,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:24,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:24,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:24,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:24,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:24,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:24,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:24,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:24,587 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:24,587 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:24,587 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13213 states and 87797 transitions. cyclomatic complexity: 76421 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:25,412 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13213 states and 87797 transitions. cyclomatic complexity: 76421. 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 40571 states and 280338 transitions. Complement of second has 6 states. [2025-04-26 16:25:25,413 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:25,414 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:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-04-26 16:25:25,414 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:25:25,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:25,414 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:25:25,415 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:25,415 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:25:25,415 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:25,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40571 states and 280338 transitions. [2025-04-26 16:25:26,358 INFO L131 ngComponentsAnalysis]: Automaton has 1790 accepting balls. 7850 [2025-04-26 16:25:26,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40571 states to 30573 states and 212553 transitions. [2025-04-26 16:25:26,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10931 [2025-04-26 16:25:27,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16702 [2025-04-26 16:25:27,010 INFO L74 IsDeterministic]: Start isDeterministic. Operand 30573 states and 212553 transitions. [2025-04-26 16:25:27,010 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:27,010 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30573 states and 212553 transitions. [2025-04-26 16:25:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30573 states and 212553 transitions. [2025-04-26 16:25:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30573 to 24802. [2025-04-26 16:25:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24802 states, 24802 states have (on average 7.235908394484316) internal successors, (in total 179465), 24801 states have internal predecessors, (179465), 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:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24802 states to 24802 states and 179465 transitions. [2025-04-26 16:25:28,165 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24802 states and 179465 transitions. [2025-04-26 16:25:28,165 INFO L438 stractBuchiCegarLoop]: Abstraction has 24802 states and 179465 transitions. [2025-04-26 16:25:28,165 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:25:28,165 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24802 states and 179465 transitions. [2025-04-26 16:25:28,513 INFO L131 ngComponentsAnalysis]: Automaton has 1790 accepting balls. 7850 [2025-04-26 16:25:28,513 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:28,513 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:28,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:25:28,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:28,515 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[124] L12-->L38: 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]" "[127] L13-->L47: 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:28,515 INFO L754 eck$LassoCheckResult]: Loop: "[103] L47-->L49: 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[]" "[105] L49-->L47: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:25:28,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash 150043, now seen corresponding path program 1 times [2025-04-26 16:25:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:28,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903456680] [2025-04-26 16:25:28,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:28,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:28,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:28,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:28,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:28,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:28,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:28,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:28,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 1 times [2025-04-26 16:25:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:28,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344894603] [2025-04-26 16:25:28,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:28,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:28,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:28,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:28,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:28,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:28,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:28,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:28,534 INFO L85 PathProgramCache]: Analyzing trace with hash 144194621, now seen corresponding path program 1 times [2025-04-26 16:25:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:28,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372532043] [2025-04-26 16:25:28,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:28,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:28,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:28,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:28,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:28,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:28,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:28,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:28,559 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:28,559 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:28,559 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:28,559 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:28,560 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:28,560 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,560 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:28,560 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:28,560 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:25:28,560 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:28,560 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:28,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:28,578 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:28,578 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:28,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:28,580 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:28,582 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:28,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:28,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:28,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:25:28,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:28,607 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:28,608 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:28,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:28,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:28,676 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:28,680 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:28,680 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:28,680 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:28,680 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:28,680 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:28,680 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:28,680 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,680 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:28,680 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:28,680 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:25:28,680 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:28,680 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:28,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:28,699 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:28,699 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:28,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:28,701 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:28,703 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:28,704 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:28,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:28,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:28,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:28,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:28,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:28,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:28,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:28,718 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:28,721 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:25:28,721 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:25:28,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:28,723 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:28,725 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:28,726 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:28,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:28,730 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:28,730 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:28,730 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:25:28,735 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:25:28,735 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:28,736 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:28,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:28,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:28,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:28,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:28,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:28,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:28,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:28,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:28,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:28,766 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:28,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:28,779 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:28,779 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:28,780 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24802 states and 179465 transitions. cyclomatic complexity: 157464 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:30,183 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24802 states and 179465 transitions. cyclomatic complexity: 157464. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 78128 states and 578407 transitions. Complement of second has 6 states. [2025-04-26 16:25:30,183 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:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-04-26 16:25:30,185 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:25:30,185 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:30,185 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:25:30,186 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:30,186 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:25:30,186 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:30,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78128 states and 578407 transitions. [2025-04-26 16:25:32,261 INFO L131 ngComponentsAnalysis]: Automaton has 2005 accepting balls. 7290 [2025-04-26 16:25:33,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78128 states to 56530 states and 419074 transitions. [2025-04-26 16:25:33,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16133 [2025-04-26 16:25:33,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21868 [2025-04-26 16:25:33,641 INFO L74 IsDeterministic]: Start isDeterministic. Operand 56530 states and 419074 transitions. [2025-04-26 16:25:33,641 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:33,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56530 states and 419074 transitions. [2025-04-26 16:25:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56530 states and 419074 transitions. [2025-04-26 16:25:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56530 to 47576. [2025-04-26 16:25:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47576 states, 47576 states have (on average 7.676706742895577) internal successors, (in total 365227), 47575 states have internal predecessors, (365227), 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:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47576 states to 47576 states and 365227 transitions. [2025-04-26 16:25:36,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47576 states and 365227 transitions. [2025-04-26 16:25:36,180 INFO L438 stractBuchiCegarLoop]: Abstraction has 47576 states and 365227 transitions. [2025-04-26 16:25:36,180 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:25:36,180 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47576 states and 365227 transitions. [2025-04-26 16:25:36,806 INFO L131 ngComponentsAnalysis]: Automaton has 2005 accepting balls. 7290 [2025-04-26 16:25:36,807 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:36,807 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:36,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:25:36,807 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:36,808 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[124] L12-->L38: 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]" "[127] L13-->L47: 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]" "[130] L14-->L56: 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:36,808 INFO L754 eck$LassoCheckResult]: Loop: "[107] L56-->L58: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[109] L58-->L56: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:25:36,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash 4651463, now seen corresponding path program 1 times [2025-04-26 16:25:36,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:36,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93431676] [2025-04-26 16:25:36,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:36,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:36,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:36,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:36,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:36,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:36,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:36,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:36,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:36,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:36,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:36,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 4387, now seen corresponding path program 1 times [2025-04-26 16:25:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:36,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544846606] [2025-04-26 16:25:36,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:36,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:36,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:36,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:36,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:36,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:36,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:36,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:36,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:36,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:36,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:36,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash 175092073, now seen corresponding path program 1 times [2025-04-26 16:25:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:36,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217369155] [2025-04-26 16:25:36,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:36,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:36,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:36,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:36,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:36,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:36,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:36,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:36,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:36,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:36,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:36,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:36,853 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:36,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:36,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:36,853 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:36,853 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:36,853 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:36,853 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:36,853 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:36,853 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:25:36,853 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:36,853 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:36,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:36,871 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:36,871 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:36,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:36,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:36,873 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:36,875 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:36,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:36,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:36,892 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:36,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:36,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:36,895 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:36,896 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:36,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:36,898 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:36,965 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:36,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:25:36,969 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:36,969 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:36,969 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:36,969 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:36,969 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:36,969 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:36,969 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:36,969 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:36,969 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:25:36,969 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:36,969 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:36,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:36,983 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:36,983 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:36,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:36,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:36,986 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:36,987 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:36,989 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:36,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:36,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:36,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:36,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:36,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:36,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:37,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:37,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:37,004 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:37,004 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:37,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:37,006 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:37,008 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:37,009 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:37,013 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:37,013 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:37,013 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:37,013 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:25:37,019 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:37,019 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:37,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:37,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:37,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:37,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:37,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:37,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:37,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:37,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:37,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:37,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:37,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:37,054 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:37,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:37,064 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:37,065 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:37,065 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47576 states and 365227 transitions. cyclomatic complexity: 321955 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:40,033 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47576 states and 365227 transitions. cyclomatic complexity: 321955. 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 142707 states and 1106481 transitions. Complement of second has 6 states. [2025-04-26 16:25:40,033 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:40,034 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:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-04-26 16:25:40,034 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:25:40,034 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:40,034 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:25:40,034 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:40,034 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:25:40,034 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:40,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142707 states and 1106481 transitions. [2025-04-26 16:25:43,748 INFO L131 ngComponentsAnalysis]: Automaton has 1962 accepting balls. 6226 [2025-04-26 16:25:46,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142707 states to 97453 states and 754178 transitions. [2025-04-26 16:25:46,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23450 [2025-04-26 16:25:46,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28681 [2025-04-26 16:25:46,135 INFO L74 IsDeterministic]: Start isDeterministic. Operand 97453 states and 754178 transitions. [2025-04-26 16:25:46,135 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:46,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97453 states and 754178 transitions. [2025-04-26 16:25:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97453 states and 754178 transitions. [2025-04-26 16:25:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97453 to 84625. [2025-04-26 16:25:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84625 states, 84625 states have (on average 7.963344165435746) internal successors, (in total 673898), 84624 states have internal predecessors, (673898), 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:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84625 states to 84625 states and 673898 transitions. [2025-04-26 16:25:50,683 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84625 states and 673898 transitions. [2025-04-26 16:25:50,683 INFO L438 stractBuchiCegarLoop]: Abstraction has 84625 states and 673898 transitions. [2025-04-26 16:25:50,683 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:25:50,683 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84625 states and 673898 transitions. [2025-04-26 16:25:51,788 INFO L131 ngComponentsAnalysis]: Automaton has 1962 accepting balls. 6226 [2025-04-26 16:25:51,788 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:51,788 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:51,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:25:51,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:25:51,790 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[124] L12-->L38: 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]" "[127] L13-->L47: 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]" "[130] L14-->L56: 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]" "[133] L15-->L65: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" [2025-04-26 16:25:51,790 INFO L754 eck$LassoCheckResult]: Loop: "[111] L65-->L67: Formula: (< v_x5_1 v_z_9) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" "[113] L67-->L68: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[114] L68-->L65: Formula: (= v_x6_1 (+ v_x6_2 1)) InVars {x6=v_x6_2} OutVars{x6=v_x6_1} AuxVars[] AssignedVars[x6]" [2025-04-26 16:25:51,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash 144195486, now seen corresponding path program 1 times [2025-04-26 16:25:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:51,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520388018] [2025-04-26 16:25:51,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:51,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:51,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:51,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:51,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:51,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:51,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:51,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:51,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:51,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:51,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:51,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:51,799 INFO L85 PathProgramCache]: Analyzing trace with hash 140079, now seen corresponding path program 1 times [2025-04-26 16:25:51,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:51,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491917747] [2025-04-26 16:25:51,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:51,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:51,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:51,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:51,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:51,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:51,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:51,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:51,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:51,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:51,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:51,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:51,805 INFO L85 PathProgramCache]: Analyzing trace with hash 760537714, now seen corresponding path program 1 times [2025-04-26 16:25:51,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:51,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316837717] [2025-04-26 16:25:51,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:51,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:51,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:25:51,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:25:51,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:51,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:51,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:51,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:25:51,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:25:51,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:51,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:51,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:51,842 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:51,842 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:51,842 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:51,842 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:51,842 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:51,843 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:51,843 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:51,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:51,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:25:51,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:51,843 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:51,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:51,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:51,865 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:51,865 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:51,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:51,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:51,868 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:51,869 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:51,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:51,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:51,887 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:51,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:51,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:51,889 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:51,890 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:51,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:51,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:51,915 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:25:51,916 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x6=0} Honda state: {x6=0} Generalized eigenvectors: [{x6=2}, {x6=-8}, {x6=7}] Lambdas: [5, 1, 1] Nus: [1, 0] [2025-04-26 16:25:51,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:25:51,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:51,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:51,923 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:51,924 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:51,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:51,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:51,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:25:51,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:51,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:51,952 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:51,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:25:51,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:51,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:52,022 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:52,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:52,026 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:52,026 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:52,026 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:52,026 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:52,026 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:52,026 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:52,026 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:52,026 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:52,026 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:25:52,027 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:52,027 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:52,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:52,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:52,054 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:52,054 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:52,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:52,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:52,056 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:52,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:25:52,060 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:52,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:52,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:52,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:52,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:52,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:52,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:52,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:52,072 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:25:52,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:25:52,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:52,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:52,080 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:52,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:25:52,082 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:52,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:52,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:52,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:52,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:52,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:52,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:52,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:52,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:52,096 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:25:52,096 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:25:52,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:52,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:52,098 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:52,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:25:52,101 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:52,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:52,104 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:52,104 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:52,105 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:25:52,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:25:52,111 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:52,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:52,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:52,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:52,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:52,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:52,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:52,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:52,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:52,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:52,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:52,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:52,148 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:52,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:52,194 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:52,194 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:52,194 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84625 states and 673898 transitions. cyclomatic complexity: 595565 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:56,741 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84625 states and 673898 transitions. cyclomatic complexity: 595565. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 229901 states and 1831372 transitions. Complement of second has 6 states. [2025-04-26 16:25:56,742 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:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-04-26 16:25:56,743 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:25:56,743 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:56,743 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:25:56,743 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:56,743 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:25:56,743 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:56,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229901 states and 1831372 transitions. [2025-04-26 16:26:03,246 INFO L131 ngComponentsAnalysis]: Automaton has 1706 accepting balls. 3412 [2025-04-26 16:26:06,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229901 states to 128109 states and 1023310 transitions. [2025-04-26 16:26:06,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28041 [2025-04-26 16:26:06,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30428 [2025-04-26 16:26:06,311 INFO L74 IsDeterministic]: Start isDeterministic. Operand 128109 states and 1023310 transitions. [2025-04-26 16:26:06,311 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:06,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128109 states and 1023310 transitions. [2025-04-26 16:26:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128109 states and 1023310 transitions. [2025-04-26 16:26:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128109 to 119234. [2025-04-26 16:26:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119234 states, 119234 states have (on average 8.066348524749651) internal successors, (in total 961783), 119233 states have internal predecessors, (961783), 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:26:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119234 states to 119234 states and 961783 transitions. [2025-04-26 16:26:11,994 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119234 states and 961783 transitions. [2025-04-26 16:26:11,994 INFO L438 stractBuchiCegarLoop]: Abstraction has 119234 states and 961783 transitions. [2025-04-26 16:26:11,994 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:26:11,994 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119234 states and 961783 transitions. [2025-04-26 16:26:13,803 INFO L131 ngComponentsAnalysis]: Automaton has 1706 accepting balls. 3412 [2025-04-26 16:26:13,803 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:13,803 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:13,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:26:13,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:13,805 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[124] L12-->L38: 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]" "[127] L13-->L47: 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]" "[130] L14-->L56: 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]" "[133] L15-->L65: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[136] L16-->L75: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" [2025-04-26 16:26:13,805 INFO L754 eck$LassoCheckResult]: Loop: "[116] L75-->L77: Formula: (< v_x6_3 v_z_11) InVars {x6=v_x6_3, z=v_z_11} OutVars{x6=v_x6_3, z=v_z_11} AuxVars[] AssignedVars[]" "[118] L77-->L75: Formula: (= v_x6_4 (+ v_x6_5 1)) InVars {x6=v_x6_5} OutVars{x6=v_x6_4} AuxVars[] AssignedVars[x6]" [2025-04-26 16:26:13,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash 175092906, now seen corresponding path program 1 times [2025-04-26 16:26:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:13,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573716507] [2025-04-26 16:26:13,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:13,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:13,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:13,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:13,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:13,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:13,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:13,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:13,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:13,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:13,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:13,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 1 times [2025-04-26 16:26:13,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:13,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496917817] [2025-04-26 16:26:13,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:13,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:13,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:13,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:13,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:13,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:13,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:13,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:13,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:13,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:13,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:13,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:13,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash 760561836, now seen corresponding path program 1 times [2025-04-26 16:26:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:13,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201682843] [2025-04-26 16:26:13,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:13,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:26:13,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:26:13,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:13,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:13,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:13,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:26:13,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:26:13,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:13,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:13,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:13,872 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:13,872 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:13,872 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:13,872 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:13,872 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:13,872 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:13,872 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:13,872 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:13,872 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:26:13,872 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:13,872 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:13,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:13,900 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:13,900 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:13,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:13,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:13,902 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:13,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:26:13,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:13,907 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:13,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:26:13,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:13,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:13,924 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:13,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:26:13,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:13,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:13,990 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:13,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:26:13,994 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:13,994 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:13,994 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:13,994 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:13,994 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:13,994 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:13,994 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:13,994 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:13,994 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:26:13,994 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:13,994 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:13,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:14,010 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:14,010 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:14,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:14,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:14,012 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:14,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:26:14,013 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:26:14,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:14,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:14,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:14,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:14,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:14,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:14,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:14,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:14,027 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:26:14,027 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:26:14,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:14,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:14,028 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:26:14,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:26:14,030 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:14,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:26:14,033 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:14,033 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:14,033 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x6, z) = -1*x6 + 1*z Supporting invariants [] [2025-04-26 16:26:14,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:26:14,038 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:14,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:14,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:14,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:14,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:14,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:14,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:14,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:14,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:14,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:14,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:14,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:14,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:14,090 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:26:14,090 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:26:14,090 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119234 states and 961783 transitions. cyclomatic complexity: 851527 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:21,625 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119234 states and 961783 transitions. cyclomatic complexity: 851527. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 389612 states and 3089273 transitions. Complement of second has 6 states. [2025-04-26 16:26:21,625 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:26:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-04-26 16:26:21,626 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:26:21,626 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:21,626 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:26:21,626 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:21,626 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:26:21,626 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:21,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 389612 states and 3089273 transitions.