/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_7.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:25:26,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:25:26,249 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:26,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:25:26,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:25:26,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:25:26,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:25:26,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:25:26,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:25:26,280 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:25:26,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:25:26,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:25:26,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:25:26,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:25:26,281 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:25:26,281 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:25:26,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:25:26,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:25:26,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:25:26,494 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:25:26,495 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:25:26,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_7.c.bpl [2025-04-26 16:25:26,496 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_7.c.bpl' [2025-04-26 16:25:26,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:25:26,512 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:25:26,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:25:26,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:25:26,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:25:26,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,544 INFO L138 Inliner]: procedures = 8, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:25:26,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:25:26,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:25:26,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:25:26,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:25:26,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:25:26,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:25:26,577 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:25:26,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:25:26,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/1) ... [2025-04-26 16:25:26,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:26,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:26,602 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:26,609 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:26,628 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:25:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:25:26,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:25:26,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:25:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:25:26,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:25:26,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:25:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:25:26,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:25:26,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:25:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:25:26,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:25:26,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:25:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:25:26,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:25:26,630 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:25:26,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:25:26,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:25:26,630 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:25:26,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:25:26,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:25:26,631 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread7 given in one single declaration [2025-04-26 16:25:26,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread7 [2025-04-26 16:25:26,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread7 [2025-04-26 16:25:26,632 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:26,668 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:25:26,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:25:26,767 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:25:26,767 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:25:26,778 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:25:26,778 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:25:26,779 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:25:26 BoogieIcfgContainer [2025-04-26 16:25:26,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:25:26,779 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:25:26,779 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:25:26,783 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:25:26,784 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:25:26,784 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:25:26" (1/2) ... [2025-04-26 16:25:26,785 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1df33f45 and model type indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:25:26, skipping insertion in model container [2025-04-26 16:25:26,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:25:26,785 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:25:26" (2/2) ... [2025-04-26 16:25:26,786 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_7.c.bpl [2025-04-26 16:25:26,869 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-04-26 16:25:26,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 58 transitions, 165 flow [2025-04-26 16:25:26,921 INFO L116 PetriNetUnfolderBase]: 7/44 cut-off events. [2025-04-26 16:25:26,924 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 16:25:26,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 44 events. 7/44 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-04-26 16:25:26,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 58 transitions, 165 flow [2025-04-26 16:25:26,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 44 transitions, 130 flow [2025-04-26 16:25:26,932 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 59 places, 44 transitions, 130 flow [2025-04-26 16:25:26,939 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:25:26,939 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:25:26,940 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:25:26,940 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:25:26,940 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:25:26,940 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:25:26,940 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:25:26,940 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:25:26,941 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:25:29,930 INFO L131 ngComponentsAnalysis]: Automaton has 3991 accepting balls. 33408 [2025-04-26 16:25:29,930 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:29,930 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:29,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:25:29,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:29,936 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:25:29,936 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 33790 states, but on-demand construction may add more states [2025-04-26 16:25:30,993 INFO L131 ngComponentsAnalysis]: Automaton has 3991 accepting balls. 33408 [2025-04-26 16:25:30,994 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:30,995 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:30,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:25:30,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:31,007 INFO L752 eck$LassoCheckResult]: Stem: "[140] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:25:31,010 INFO L754 eck$LassoCheckResult]: Loop: "[110] L32-->L34: 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[]" "[112] L34-->L32: 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:31,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:31,015 INFO L85 PathProgramCache]: Analyzing trace with hash 171, now seen corresponding path program 1 times [2025-04-26 16:25:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:31,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197944702] [2025-04-26 16:25:31,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:31,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:31,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:31,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:31,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:31,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:31,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:31,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:31,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:31,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:31,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:31,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:31,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:31,157 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 16:25:31,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:31,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070144802] [2025-04-26 16:25:31,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:31,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:31,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:31,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:31,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:31,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:31,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:31,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:31,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:31,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:31,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:31,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:31,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:31,193 INFO L85 PathProgramCache]: Analyzing trace with hash 167853, now seen corresponding path program 1 times [2025-04-26 16:25:31,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:31,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116059259] [2025-04-26 16:25:31,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:31,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:31,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:31,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:31,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:31,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:31,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:31,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:25:31,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:25:31,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:31,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:31,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:31,305 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:31,306 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:31,306 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:31,306 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:31,306 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:31,306 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:31,306 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:31,306 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:31,306 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:25:31,306 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:31,310 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:31,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:31,383 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:31,383 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:31,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:31,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:31,394 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:31,396 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:31,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:31,401 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:31,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:31,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:31,433 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:31,434 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:31,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:31,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:31,515 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:31,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:31,520 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:31,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:31,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:31,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:31,521 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:31,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:31,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:31,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:31,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:25:31,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:31,521 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:31,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:31,559 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:31,562 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:31,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:31,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:31,565 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:31,565 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:31,566 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:31,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:31,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:31,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:31,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:31,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:31,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:31,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:31,588 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:31,593 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:31,594 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:31,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:31,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:31,598 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:31,600 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:31,602 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:31,606 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:31,606 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:31,606 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:31,607 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:25:31,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:25:31,616 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:31,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:31,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:25:31,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:25:31,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:31,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:31,651 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:31,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:31,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:31,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:31,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:31,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:31,664 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:31,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:31,684 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:31,714 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:31,717 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 33790 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:33,977 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 33790 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 94541 states and 705298 transitions. Complement of second has 6 states. [2025-04-26 16:25:33,985 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:33,992 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:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-04-26 16:25:34,007 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:25:34,007 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:34,008 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:25:34,008 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:34,008 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:25:34,008 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:34,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94541 states and 705298 transitions. [2025-04-26 16:25:37,331 INFO L131 ngComponentsAnalysis]: Automaton has 4830 accepting balls. 33154 [2025-04-26 16:25:39,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94541 states to 73465 states and 553881 transitions. [2025-04-26 16:25:39,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33405 [2025-04-26 16:25:39,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53435 [2025-04-26 16:25:39,690 INFO L74 IsDeterministic]: Start isDeterministic. Operand 73465 states and 553881 transitions. [2025-04-26 16:25:39,691 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:39,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73465 states and 553881 transitions. [2025-04-26 16:25:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73465 states and 553881 transitions. [2025-04-26 16:25:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73465 to 53437. [2025-04-26 16:25:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53437 states, 53437 states have (on average 7.7666972322548045) internal successors, (in total 415029), 53436 states have internal predecessors, (415029), 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:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53437 states to 53437 states and 415029 transitions. [2025-04-26 16:25:43,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53437 states and 415029 transitions. [2025-04-26 16:25:43,479 INFO L438 stractBuchiCegarLoop]: Abstraction has 53437 states and 415029 transitions. [2025-04-26 16:25:43,479 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:25:43,479 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53437 states and 415029 transitions. [2025-04-26 16:25:44,127 INFO L131 ngComponentsAnalysis]: Automaton has 4830 accepting balls. 33154 [2025-04-26 16:25:44,127 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:44,127 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:44,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:25:44,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:44,130 INFO L752 eck$LassoCheckResult]: Stem: "[140] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[143] L13-->L41: 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:44,131 INFO L754 eck$LassoCheckResult]: Loop: "[114] L41-->L43: 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[]" "[116] L43-->L41: 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:44,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash 5444, now seen corresponding path program 1 times [2025-04-26 16:25:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:44,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429047588] [2025-04-26 16:25:44,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:44,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:44,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:44,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:44,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:44,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:44,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:44,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:44,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:44,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:44,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:44,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:44,138 INFO L85 PathProgramCache]: Analyzing trace with hash 4611, now seen corresponding path program 1 times [2025-04-26 16:25:44,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:44,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178902064] [2025-04-26 16:25:44,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:44,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:44,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:44,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:44,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:44,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:44,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:44,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:44,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:44,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:44,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:44,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash 5235334, now seen corresponding path program 1 times [2025-04-26 16:25:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:44,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815522686] [2025-04-26 16:25:44,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:44,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:44,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:44,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:44,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:44,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:44,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:44,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:44,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:44,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:44,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:44,161 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:44,162 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:44,162 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:44,162 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:44,162 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:44,162 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:44,162 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:44,162 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:44,162 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:25:44,162 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:44,162 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:44,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:44,177 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:44,177 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:44,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:44,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:44,179 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:44,181 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:44,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:44,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:44,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:44,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:44,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:44,201 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:44,202 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:44,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:44,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:44,268 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:44,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:25:44,272 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:44,272 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:44,272 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:44,272 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:44,272 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:44,273 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:44,273 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:44,273 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:44,273 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:25:44,273 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:44,273 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:44,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:44,290 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:44,290 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:44,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:44,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:44,292 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:44,292 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:44,293 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:44,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:44,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:44,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:44,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:44,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:44,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:44,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:44,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:44,309 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:44,309 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:44,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:44,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:44,311 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:44,312 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:44,313 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:44,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:25:44,316 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:44,316 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:44,316 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:25:44,321 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:44,322 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:44,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:44,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:44,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:44,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:44,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:44,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:44,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:44,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:44,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:44,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:44,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:44,353 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:44,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:44,364 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:44,364 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:44,365 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53437 states and 415029 transitions. cyclomatic complexity: 367451 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:47,928 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53437 states and 415029 transitions. cyclomatic complexity: 367451. 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 163867 states and 1322018 transitions. Complement of second has 6 states. [2025-04-26 16:25:47,929 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:47,929 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:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-04-26 16:25:47,930 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:25:47,930 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:47,930 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:25:47,930 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:47,930 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:25:47,930 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:47,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163867 states and 1322018 transitions. [2025-04-26 16:25:52,567 INFO L131 ngComponentsAnalysis]: Automaton has 5961 accepting balls. 32586 [2025-04-26 16:25:55,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163867 states to 124877 states and 1015561 transitions. [2025-04-26 16:25:55,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44659 [2025-04-26 16:25:56,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68238 [2025-04-26 16:25:56,341 INFO L74 IsDeterministic]: Start isDeterministic. Operand 124877 states and 1015561 transitions. [2025-04-26 16:25:56,342 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:56,342 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124877 states and 1015561 transitions. [2025-04-26 16:25:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124877 states and 1015561 transitions. [2025-04-26 16:26:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124877 to 101298. [2025-04-26 16:26:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101298 states, 101298 states have (on average 8.458301249777882) internal successors, (in total 856809), 101297 states have internal predecessors, (856809), 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:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101298 states to 101298 states and 856809 transitions. [2025-04-26 16:26:02,424 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101298 states and 856809 transitions. [2025-04-26 16:26:02,424 INFO L438 stractBuchiCegarLoop]: Abstraction has 101298 states and 856809 transitions. [2025-04-26 16:26:02,424 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:26:02,424 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101298 states and 856809 transitions. [2025-04-26 16:26:03,878 INFO L131 ngComponentsAnalysis]: Automaton has 5961 accepting balls. 32586 [2025-04-26 16:26:03,878 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:03,878 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:03,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:26:03,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:03,881 INFO L752 eck$LassoCheckResult]: Stem: "[140] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[143] L13-->L41: 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]" "[146] L14-->L50: 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:26:03,882 INFO L754 eck$LassoCheckResult]: Loop: "[118] L50-->L52: 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[]" "[120] L52-->L50: 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:26:03,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,882 INFO L85 PathProgramCache]: Analyzing trace with hash 168910, now seen corresponding path program 1 times [2025-04-26 16:26:03,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396415277] [2025-04-26 16:26:03,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:03,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:03,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:03,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:03,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash 4739, now seen corresponding path program 1 times [2025-04-26 16:26:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980573297] [2025-04-26 16:26:03,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash 162326288, now seen corresponding path program 1 times [2025-04-26 16:26:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954962176] [2025-04-26 16:26:03,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:03,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:03,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:03,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:03,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,914 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:03,914 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:03,914 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:03,914 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:03,914 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:03,914 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,914 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:03,914 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:03,914 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:03,914 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:03,914 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:03,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:03,930 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:03,930 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:03,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,933 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:26:03,933 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:26:03,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:03,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:03,955 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:26:03,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,957 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:26:03,959 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:26:03,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:03,960 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:04,029 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:04,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:26:04,033 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:04,033 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:04,033 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:04,033 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:04,033 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:04,033 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,033 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:04,033 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:04,033 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:04,033 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:04,033 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:04,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:04,046 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:04,047 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:04,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:04,049 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:26:04,049 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:26:04,050 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:04,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:04,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:04,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:04,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:04,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:04,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:04,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:04,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:04,065 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:26:04,066 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:04,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:04,067 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:26:04,068 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:26:04,069 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:04,072 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:26:04,072 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:04,072 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:04,072 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:26:04,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:26:04,078 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:04,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:04,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:04,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:04,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:04,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:04,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:04,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:04,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:04,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:04,111 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:04,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:04,123 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:04,123 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:04,123 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101298 states and 856809 transitions. cyclomatic complexity: 764672 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:26:11,111 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101298 states and 856809 transitions. cyclomatic complexity: 764672. 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 318676 states and 2757255 transitions. Complement of second has 6 states. [2025-04-26 16:26:11,111 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:11,112 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:26:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-26 16:26:11,112 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:26:11,112 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:11,112 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:26:11,112 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:11,112 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:26:11,112 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:11,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318676 states and 2757255 transitions. [2025-04-26 16:26:20,881 INFO L131 ngComponentsAnalysis]: Automaton has 7150 accepting balls. 31434 [2025-04-26 16:26:27,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318676 states to 236182 states and 2049934 transitions. [2025-04-26 16:26:27,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67361 [2025-04-26 16:26:28,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91360 [2025-04-26 16:26:28,027 INFO L74 IsDeterministic]: Start isDeterministic. Operand 236182 states and 2049934 transitions. [2025-04-26 16:26:28,027 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:28,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 236182 states and 2049934 transitions.