/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /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:58:22,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:22,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:22,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:22,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:22,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:22,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:22,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:22,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:22,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:22,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:22,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:22,872 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:22,872 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:22,872 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:22,872 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:22,872 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:22,872 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:22,872 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:22,872 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:22,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:22,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:22,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:22,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:22,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:22,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:22,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:22,874 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:22,874 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:22,874 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:23,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:23,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:23,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:23,136 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:23,137 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:23,138 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:58:23,138 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_7.c.bpl' [2025-04-26 16:58:23,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:23,158 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:23,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:23,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:23,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:23,167 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:58:23" (1/1) ... [2025-04-26 16:58:23,187 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:58:23" (1/1) ... [2025-04-26 16:58:23,193 INFO L138 Inliner]: procedures = 8, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:23,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:23,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:23,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:23,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:23,200 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:58:23" (1/1) ... [2025-04-26 16:58:23,201 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:58:23" (1/1) ... [2025-04-26 16:58:23,202 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:58:23" (1/1) ... [2025-04-26 16:58:23,203 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:58:23" (1/1) ... [2025-04-26 16:58:23,204 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:58:23" (1/1) ... [2025-04-26 16:58:23,206 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:58:23" (1/1) ... [2025-04-26 16:58:23,210 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:58:23" (1/1) ... [2025-04-26 16:58:23,211 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:58:23" (1/1) ... [2025-04-26 16:58:23,211 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:58:23" (1/1) ... [2025-04-26 16:58:23,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:23,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:23,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:23,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:23,229 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:58:23" (1/1) ... [2025-04-26 16:58:23,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:23,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:23,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:23,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:58:23,278 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:23,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:23,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:23,279 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:23,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:23,279 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:23,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:23,279 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:23,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:23,279 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:23,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:23,279 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:58:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:58:23,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:58:23,279 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:58:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:58:23,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:58:23,279 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread7 given in one single declaration [2025-04-26 16:58:23,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread7 [2025-04-26 16:58:23,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread7 [2025-04-26 16:58:23,280 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:58:23,320 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:23,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:23,432 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:23,432 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:23,442 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:23,442 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:23,443 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:23 BoogieIcfgContainer [2025-04-26 16:58:23,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:23,444 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:23,444 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:23,448 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:23,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:23,449 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:58:23" (1/2) ... [2025-04-26 16:58:23,450 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c4addf1 and model type indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:23, skipping insertion in model container [2025-04-26 16:58:23,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:23,450 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:58:23" (2/2) ... [2025-04-26 16:58:23,451 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_7.c.bpl [2025-04-26 16:58:23,532 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-04-26 16:58:23,571 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:23,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:23,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:23,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:23,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:58:23,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 58 transitions, 165 flow [2025-04-26 16:58:23,650 INFO L116 PetriNetUnfolderBase]: 7/44 cut-off events. [2025-04-26 16:58:23,652 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 16:58:23,655 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:58:23,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 58 transitions, 165 flow [2025-04-26 16:58:23,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 44 transitions, 130 flow [2025-04-26 16:58:23,658 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 59 places, 44 transitions, 130 flow [2025-04-26 16:58:23,663 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:28,005 WARN L140 AmpleReduction]: Number of pruned transitions: 92460 [2025-04-26 16:58:28,006 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:58:28,006 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 16431 [2025-04-26 16:58:28,006 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:38 [2025-04-26 16:58:28,006 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:17296 [2025-04-26 16:58:28,006 WARN L145 AmpleReduction]: Times succ was already a loop node:46221 [2025-04-26 16:58:28,006 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:8803 [2025-04-26 16:58:28,006 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:28,210 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 33766 states, 33765 states have (on average 4.143136383829409) internal successors, (in total 139893), 33765 states have internal predecessors, (139893), 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:58:28,220 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:28,220 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:28,221 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:28,221 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:28,221 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:28,221 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:28,221 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:28,221 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:28,281 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33766 states, 33765 states have (on average 4.143136383829409) internal successors, (in total 139893), 33765 states have internal predecessors, (139893), 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:58:29,015 INFO L131 ngComponentsAnalysis]: Automaton has 3931 accepting balls. 33047 [2025-04-26 16:58:29,015 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:29,015 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:29,021 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:58:29,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:29,021 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:29,082 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33766 states, 33765 states have (on average 4.143136383829409) internal successors, (in total 139893), 33765 states have internal predecessors, (139893), 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:58:29,734 INFO L131 ngComponentsAnalysis]: Automaton has 3931 accepting balls. 33047 [2025-04-26 16:58:29,734 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:29,734 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:29,736 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:58:29,736 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:29,740 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:58:29,740 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:58:29,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash 171, now seen corresponding path program 1 times [2025-04-26 16:58:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:29,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505738156] [2025-04-26 16:58:29,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:29,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:29,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:29,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:29,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:29,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:29,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:29,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:29,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:29,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:29,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:29,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:29,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:29,828 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 16:58:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:29,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384971214] [2025-04-26 16:58:29,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:29,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:29,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:29,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:29,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:29,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:29,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:29,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:29,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:29,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:29,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:29,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash 167853, now seen corresponding path program 1 times [2025-04-26 16:58:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:29,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384493815] [2025-04-26 16:58:29,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:29,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:29,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:29,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:29,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:29,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:29,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:29,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:29,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:29,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:29,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:29,927 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:29,929 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:29,929 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:29,929 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:29,929 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:29,929 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:29,929 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:29,930 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:29,930 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:29,930 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:29,930 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:29,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:30,000 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:30,000 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:30,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:30,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:30,013 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:58:30,020 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:58:30,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:30,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:30,051 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:58:30,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:30,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:30,053 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:58:30,054 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:58:30,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:30,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:30,162 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:30,174 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:58:30,174 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:30,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:30,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:30,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:30,174 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:30,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:30,175 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:30,175 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:30,175 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:30,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:30,175 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:30,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:30,209 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:30,213 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:30,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:30,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:30,217 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:58:30,219 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:58:30,220 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:58:30,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:30,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:30,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:30,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:30,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:30,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:30,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:30,245 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:30,251 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:30,252 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:30,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:30,256 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:58:30,257 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:58:30,258 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:30,261 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:30,262 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:58:30,262 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:30,263 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:30,263 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:58:30,269 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:58:30,271 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:30,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:30,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:30,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:30,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:30,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:30,302 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:30,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:30,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:30,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:30,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:30,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:30,312 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:30,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:30,330 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:58:30,346 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:58:30,405 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 33766 states, 33765 states have (on average 4.143136383829409) internal successors, (in total 139893), 33765 states have internal predecessors, (139893), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.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:58:31,817 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 33766 states, 33765 states have (on average 4.143136383829409) internal successors, (in total 139893), 33765 states have internal predecessors, (139893), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.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 88688 states and 382495 transitions. Complement of second has 6 states. [2025-04-26 16:58:31,818 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:58:31,821 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:58:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 16:58:31,829 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:58:31,830 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:31,830 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:58:31,831 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:31,831 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:58:31,831 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:31,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88688 states and 382495 transitions. [2025-04-26 16:58:33,444 INFO L131 ngComponentsAnalysis]: Automaton has 3350 accepting balls. 20589 [2025-04-26 16:58:34,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88688 states to 56444 states and 237778 transitions. [2025-04-26 16:58:34,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25129 [2025-04-26 16:58:34,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37960 [2025-04-26 16:58:34,483 INFO L74 IsDeterministic]: Start isDeterministic. Operand 56444 states and 237778 transitions. [2025-04-26 16:58:34,483 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:34,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56444 states and 237778 transitions. [2025-04-26 16:58:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56444 states and 237778 transitions. [2025-04-26 16:58:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56444 to 44667. [2025-04-26 16:58:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44667 states, 44667 states have (on average 4.354154073477064) internal successors, (in total 194487), 44666 states have internal predecessors, (194487), 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:58:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44667 states to 44667 states and 194487 transitions. [2025-04-26 16:58:36,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44667 states and 194487 transitions. [2025-04-26 16:58:36,445 INFO L438 stractBuchiCegarLoop]: Abstraction has 44667 states and 194487 transitions. [2025-04-26 16:58:36,445 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:36,445 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44667 states and 194487 transitions. [2025-04-26 16:58:36,717 INFO L131 ngComponentsAnalysis]: Automaton has 3350 accepting balls. 20589 [2025-04-26 16:58:36,717 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:36,717 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:36,719 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:58:36,719 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:36,719 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]" "[109] L32-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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:58:36,719 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:58:36,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 5202594, now seen corresponding path program 1 times [2025-04-26 16:58:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:36,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940652452] [2025-04-26 16:58:36,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:36,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:36,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:36,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:36,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:36,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:36,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:36,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:36,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,727 INFO L85 PathProgramCache]: Analyzing trace with hash 4611, now seen corresponding path program 1 times [2025-04-26 16:58:36,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:36,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84529712] [2025-04-26 16:58:36,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:36,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:36,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:36,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:36,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:36,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:36,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:36,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 704729188, now seen corresponding path program 1 times [2025-04-26 16:58:36,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:36,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001296254] [2025-04-26 16:58:36,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:36,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:36,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:36,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:36,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:36,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:36,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:36,759 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:36,759 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:36,759 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:36,759 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:36,760 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:36,760 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,760 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:36,760 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:36,760 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:36,760 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:36,760 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:36,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,778 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:36,778 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:36,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,780 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:58:36,782 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:58:36,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:36,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,799 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:58:36,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,802 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:58:36,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:36,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,913 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:58:36,975 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:36,980 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:58:36,981 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:36,981 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:36,981 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:36,981 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:36,981 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:36,981 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,981 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:36,981 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:36,981 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:36,981 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:36,981 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:36,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,008 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:37,009 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:37,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,010 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:58:37,011 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:58:37,014 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:58:37,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:37,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:37,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:37,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:37,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:37,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:37,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:37,027 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:37,029 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:37,029 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:37,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,031 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:58:37,032 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:58:37,032 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:37,035 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:58:37,035 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:37,035 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:37,035 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:58:37,040 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:58:37,041 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:37,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:37,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:37,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:37,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:37,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:37,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:37,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:37,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:37,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:37,076 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:37,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:37,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:58:37,091 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:58:37,091 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44667 states and 194487 transitions. cyclomatic complexity: 154199 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:58:38,772 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44667 states and 194487 transitions. cyclomatic complexity: 154199. 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 122260 states and 524963 transitions. Complement of second has 6 states. [2025-04-26 16:58:38,773 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:58:38,773 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:58:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-26 16:58:38,773 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:58:38,773 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:38,773 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:58:38,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:38,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:58:38,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:38,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122260 states and 524963 transitions. [2025-04-26 16:58:40,844 INFO L131 ngComponentsAnalysis]: Automaton has 2763 accepting balls. 12057 [2025-04-26 16:58:41,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122260 states to 80191 states and 338501 transitions. [2025-04-26 16:58:41,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27879 [2025-04-26 16:58:41,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37797 [2025-04-26 16:58:41,967 INFO L74 IsDeterministic]: Start isDeterministic. Operand 80191 states and 338501 transitions. [2025-04-26 16:58:41,967 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:41,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80191 states and 338501 transitions. [2025-04-26 16:58:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80191 states and 338501 transitions. [2025-04-26 16:58:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80191 to 70230. [2025-04-26 16:58:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70230 states, 70230 states have (on average 4.305268403816033) internal successors, (in total 302359), 70229 states have internal predecessors, (302359), 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:58:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70230 states to 70230 states and 302359 transitions. [2025-04-26 16:58:44,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70230 states and 302359 transitions. [2025-04-26 16:58:44,696 INFO L438 stractBuchiCegarLoop]: Abstraction has 70230 states and 302359 transitions. [2025-04-26 16:58:44,696 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:44,696 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70230 states and 302359 transitions. [2025-04-26 16:58:45,128 INFO L131 ngComponentsAnalysis]: Automaton has 2763 accepting balls. 12057 [2025-04-26 16:58:45,128 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:45,128 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:45,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:45,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:45,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]" "[109] L32-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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]" "[113] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[115] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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:58:45,130 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:58:45,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:45,130 INFO L85 PathProgramCache]: Analyzing trace with hash 371767502, now seen corresponding path program 1 times [2025-04-26 16:58:45,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:45,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548408991] [2025-04-26 16:58:45,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:45,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:45,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:45,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:45,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:45,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:45,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:45,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:45,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash 4739, now seen corresponding path program 1 times [2025-04-26 16:58:45,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:45,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014136132] [2025-04-26 16:58:45,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:45,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:45,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:45,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:45,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:45,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:45,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:45,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:45,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash 786287632, now seen corresponding path program 1 times [2025-04-26 16:58:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:45,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856325867] [2025-04-26 16:58:45,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:45,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:45,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:45,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:45,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:45,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:45,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:45,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:45,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:45,167 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:45,168 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:45,168 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:45,168 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:45,168 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:45,168 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,168 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:45,168 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:45,168 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:45,168 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:45,168 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:45,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:45,186 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:45,187 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:45,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,189 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:58:45,190 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:58:45,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:45,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:45,208 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:58:45,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,210 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:58:45,211 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:58:45,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:45,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:45,278 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:45,282 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:58:45,282 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:45,283 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:45,283 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:45,283 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:45,283 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:45,283 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,283 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:45,283 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:45,283 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:45,283 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:45,283 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:45,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:45,302 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:45,302 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:45,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,305 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:58:45,306 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:58:45,307 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:58:45,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:45,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:45,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:45,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:45,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:45,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:45,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:45,321 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:45,325 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:45,325 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:45,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,327 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:58:45,328 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:58:45,329 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:45,332 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:45,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:45,333 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:45,333 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:45,333 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:58:45,340 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:58:45,341 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:45,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:45,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:45,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:45,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:45,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:45,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:45,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:45,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:45,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:45,380 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:45,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:45,394 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:58:45,394 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:58:45,394 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70230 states and 302359 transitions. cyclomatic complexity: 237318 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:47,919 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70230 states and 302359 transitions. cyclomatic complexity: 237318. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 189127 states and 799174 transitions. Complement of second has 6 states. [2025-04-26 16:58:47,920 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:58:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-26 16:58:47,920 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:58:47,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:47,921 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:58:47,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:47,921 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:58:47,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:47,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189127 states and 799174 transitions. [2025-04-26 16:58:51,082 INFO L131 ngComponentsAnalysis]: Automaton has 2260 accepting balls. 7217 [2025-04-26 16:58:52,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189127 states to 122279 states and 508168 transitions. [2025-04-26 16:58:52,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35108 [2025-04-26 16:58:53,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41243 [2025-04-26 16:58:53,122 INFO L74 IsDeterministic]: Start isDeterministic. Operand 122279 states and 508168 transitions. [2025-04-26 16:58:53,122 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:53,122 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122279 states and 508168 transitions. [2025-04-26 16:58:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122279 states and 508168 transitions. [2025-04-26 16:58:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122279 to 114496. [2025-04-26 16:58:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114496 states, 114496 states have (on average 4.136502585243153) internal successors, (in total 473613), 114495 states have internal predecessors, (473613), 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:58:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114496 states to 114496 states and 473613 transitions. [2025-04-26 16:58:57,022 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114496 states and 473613 transitions. [2025-04-26 16:58:57,022 INFO L438 stractBuchiCegarLoop]: Abstraction has 114496 states and 473613 transitions. [2025-04-26 16:58:57,022 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:57,022 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114496 states and 473613 transitions. [2025-04-26 16:58:58,198 INFO L131 ngComponentsAnalysis]: Automaton has 2260 accepting balls. 7217 [2025-04-26 16:58:58,198 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:58,199 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:58,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:58,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:58,200 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]" "[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[]" "[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]" "[112] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[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]" "[109] L32-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[149] L15-->L59: 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]" "[113] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[117] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 16:58:58,201 INFO L754 eck$LassoCheckResult]: Loop: "[122] L59-->L61: 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[]" "[124] L61-->L59: 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:58:58,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,201 INFO L85 PathProgramCache]: Analyzing trace with hash 7241178, now seen corresponding path program 1 times [2025-04-26 16:58:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:58,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034093515] [2025-04-26 16:58:58,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:58,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:58,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:58,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:58,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:58,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:58,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:58,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:58,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,212 INFO L85 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 1 times [2025-04-26 16:58:58,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:58,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812373434] [2025-04-26 16:58:58,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:58,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:58,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:58,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1631158628, now seen corresponding path program 1 times [2025-04-26 16:58:58,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:58,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78885764] [2025-04-26 16:58:58,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:58,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:58,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:58,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:58,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:58,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:58,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:58,282 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:58,282 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:58,283 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:58,283 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:58,283 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:58,283 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,283 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:58,283 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:58,283 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:58,283 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:58,283 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:58,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:58,298 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:58,298 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:58,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,300 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:58:58,302 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:58:58,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:58,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:58,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:58,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,324 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:58:58,325 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:58:58,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:58,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:58,417 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:58,422 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:58:58,422 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:58,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:58,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:58,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:58,422 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:58,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:58,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:58,423 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:58,423 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:58,423 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:58,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:58,441 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:58,441 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:58,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,445 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:58:58,446 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:58:58,448 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:58:58,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:58,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:58,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:58,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:58,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:58,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:58,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:58,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:58,469 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:58,470 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:58,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,507 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:58:58,508 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:58:58,509 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:58,511 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:58:58,512 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:58,512 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:58,512 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:58:58,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:58:58,518 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:58,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:58,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:58,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:58,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:58,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,550 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:58,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:58,562 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:58:58,563 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:58:58,563 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114496 states and 473613 transitions. cyclomatic complexity: 365805 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:01,000 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114496 states and 473613 transitions. cyclomatic complexity: 365805. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 204048 states and 824708 transitions. Complement of second has 6 states. [2025-04-26 16:59:01,001 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:59:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-26 16:59:01,003 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:59:01,003 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:01,003 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:59:01,003 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:01,003 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:59:01,003 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:01,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204048 states and 824708 transitions. [2025-04-26 16:59:05,224 INFO L131 ngComponentsAnalysis]: Automaton has 2043 accepting balls. 5001 [2025-04-26 16:59:07,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204048 states to 164959 states and 659048 transitions. [2025-04-26 16:59:07,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46987 [2025-04-26 16:59:07,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52311 [2025-04-26 16:59:07,695 INFO L74 IsDeterministic]: Start isDeterministic. Operand 164959 states and 659048 transitions. [2025-04-26 16:59:07,696 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:07,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 164959 states and 659048 transitions. [2025-04-26 16:59:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164959 states and 659048 transitions. [2025-04-26 16:59:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164959 to 154542. [2025-04-26 16:59:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154542 states, 154542 states have (on average 4.064112021327536) internal successors, (in total 628076), 154541 states have internal predecessors, (628076), 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:59:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154542 states to 154542 states and 628076 transitions. [2025-04-26 16:59:12,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154542 states and 628076 transitions. [2025-04-26 16:59:12,910 INFO L438 stractBuchiCegarLoop]: Abstraction has 154542 states and 628076 transitions. [2025-04-26 16:59:12,910 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:59:12,910 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154542 states and 628076 transitions. [2025-04-26 16:59:14,088 INFO L131 ngComponentsAnalysis]: Automaton has 1987 accepting balls. 4889 [2025-04-26 16:59:14,088 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:14,088 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:14,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:14,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:59:14,090 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]" "[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[]" "[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]" "[112] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[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]" "[109] L32-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[149] L15-->L59: 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]" "[113] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[152] L16-->L68: 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]" "[117] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[121] L59-->thread4FINAL: Formula: (<= v_z_8 v_x4_4) InVars {x4=v_x4_4, z=v_z_8} OutVars{x4=v_x4_4, z=v_z_8} AuxVars[] AssignedVars[]" [2025-04-26 16:59:14,090 INFO L754 eck$LassoCheckResult]: Loop: "[126] L68-->L70: Formula: (< v_x5_2 v_z_10) InVars {x5=v_x5_2, z=v_z_10} OutVars{x5=v_x5_2, z=v_z_10} AuxVars[] AssignedVars[]" "[128] L70-->L68: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 16:59:14,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1631125151, now seen corresponding path program 1 times [2025-04-26 16:59:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:14,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163827283] [2025-04-26 16:59:14,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:14,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:59:14,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:59:14,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:14,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:14,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:59:14,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:59:14,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:14,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:14,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash 4995, now seen corresponding path program 1 times [2025-04-26 16:59:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:14,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292053755] [2025-04-26 16:59:14,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:14,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:14,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:14,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:14,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:14,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:14,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:14,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:14,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:14,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:14,119 INFO L85 PathProgramCache]: Analyzing trace with hash 151796963, now seen corresponding path program 1 times [2025-04-26 16:59:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:14,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060845941] [2025-04-26 16:59:14,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:14,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:59:14,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:59:14,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:14,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:14,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:59:14,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:59:14,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:14,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:14,156 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:14,156 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:14,156 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:14,156 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:14,156 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:14,156 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,156 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:14,156 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:14,156 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:59:14,156 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:14,156 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:14,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:14,179 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:14,179 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:14,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:14,182 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:59:14,183 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:59:14,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:14,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:14,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:14,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:14,203 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:59:14,203 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:59:14,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:14,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:14,266 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:14,270 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:59:14,270 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:14,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:14,270 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:14,270 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:14,270 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:14,270 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,270 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:14,270 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:14,270 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:59:14,270 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:14,270 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:14,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:14,284 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:14,284 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:14,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:14,286 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:59:14,287 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:59:14,288 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:59:14,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:14,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:14,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:14,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:14,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:14,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:14,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:14,303 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:14,305 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:14,305 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:14,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:14,307 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:59:14,308 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:59:14,308 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:14,311 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:59:14,311 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:14,311 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:14,311 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:59:14,316 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:59:14,317 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:14,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:14,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:59:14,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:59:14,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:14,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:14,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:14,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:14,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:14,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:14,457 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:14,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:14,469 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:59:14,469 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:59:14,469 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154542 states and 628076 transitions. cyclomatic complexity: 482132 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:17,401 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154542 states and 628076 transitions. cyclomatic complexity: 482132. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 286579 states and 1119744 transitions. Complement of second has 6 states. [2025-04-26 16:59:17,401 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:59:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-26 16:59:17,402 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:59:17,402 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:17,402 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:59:17,402 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:17,402 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:59:17,402 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:17,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286579 states and 1119744 transitions. [2025-04-26 16:59:21,248 INFO L131 ngComponentsAnalysis]: Automaton has 1877 accepting balls. 3923 [2025-04-26 16:59:23,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286579 states to 219117 states and 850223 transitions. [2025-04-26 16:59:23,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57577 [2025-04-26 16:59:23,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60800 [2025-04-26 16:59:23,908 INFO L74 IsDeterministic]: Start isDeterministic. Operand 219117 states and 850223 transitions. [2025-04-26 16:59:23,908 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:23,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 219117 states and 850223 transitions. [2025-04-26 16:59:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219117 states and 850223 transitions. [2025-04-26 16:59:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219117 to 208463. [2025-04-26 16:59:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208463 states, 208463 states have (on average 3.9302945846505137) internal successors, (in total 819321), 208462 states have internal predecessors, (819321), 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:59:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208463 states to 208463 states and 819321 transitions. [2025-04-26 16:59:29,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 208463 states and 819321 transitions. [2025-04-26 16:59:29,856 INFO L438 stractBuchiCegarLoop]: Abstraction has 208463 states and 819321 transitions. [2025-04-26 16:59:29,856 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:59:29,856 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208463 states and 819321 transitions. [2025-04-26 16:59:31,272 INFO L131 ngComponentsAnalysis]: Automaton has 1807 accepting balls. 3783 [2025-04-26 16:59:31,272 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:31,272 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:31,274 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:31,274 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:59:31,274 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]" "[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[]" "[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]" "[112] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[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]" "[109] L32-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[149] L15-->L59: 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]" "[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[]" "[152] L16-->L68: 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]" "[116] L43-->L41: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[155] L17-->L77: 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]" "[113] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[158] L18-->L87: Formula: (and (= v_thread7Thread1of1ForFork6_thidvar1_2 7) (= v_thread7Thread1of1ForFork6_thidvar3_2 7) (= v_thread7Thread1of1ForFork6_thidvar0_2 7) (= v_thread7Thread1of1ForFork6_thidvar2_2 7) (= v_thread7Thread1of1ForFork6_thidvar6_2 7) (= v_thread7Thread1of1ForFork6_thidvar5_2 7) (= v_thread7Thread1of1ForFork6_thidvar4_2 7)) InVars {} OutVars{thread7Thread1of1ForFork6_thidvar6=v_thread7Thread1of1ForFork6_thidvar6_2, thread7Thread1of1ForFork6_thidvar1=v_thread7Thread1of1ForFork6_thidvar1_2, thread7Thread1of1ForFork6_thidvar0=v_thread7Thread1of1ForFork6_thidvar0_2, thread7Thread1of1ForFork6_thidvar5=v_thread7Thread1of1ForFork6_thidvar5_2, thread7Thread1of1ForFork6_thidvar4=v_thread7Thread1of1ForFork6_thidvar4_2, thread7Thread1of1ForFork6_thidvar3=v_thread7Thread1of1ForFork6_thidvar3_2, thread7Thread1of1ForFork6_thidvar2=v_thread7Thread1of1ForFork6_thidvar2_2} AuxVars[] AssignedVars[thread7Thread1of1ForFork6_thidvar6, thread7Thread1of1ForFork6_thidvar1, thread7Thread1of1ForFork6_thidvar0, thread7Thread1of1ForFork6_thidvar5, thread7Thread1of1ForFork6_thidvar4, thread7Thread1of1ForFork6_thidvar3, thread7Thread1of1ForFork6_thidvar2]" [2025-04-26 16:59:31,274 INFO L754 eck$LassoCheckResult]: Loop: "[135] L87-->L89: Formula: (< v_x7_3 v_z_13) InVars {x7=v_x7_3, z=v_z_13} OutVars{x7=v_x7_3, z=v_z_13} AuxVars[] AssignedVars[]" "[137] L89-->L87: Formula: (= v_x7_4 (+ v_x7_5 1)) InVars {x7=v_x7_5} OutVars{x7=v_x7_4} AuxVars[] AssignedVars[x7]" [2025-04-26 16:59:31,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash 180428624, now seen corresponding path program 1 times [2025-04-26 16:59:31,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:31,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398005384] [2025-04-26 16:59:31,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:31,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:31,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:59:31,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:59:31,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:31,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:31,280 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:31,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:59:31,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:59:31,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:31,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:31,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:31,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:31,284 INFO L85 PathProgramCache]: Analyzing trace with hash 5283, now seen corresponding path program 1 times [2025-04-26 16:59:31,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:31,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574131654] [2025-04-26 16:59:31,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:31,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:31,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:31,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:31,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:31,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:31,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:31,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:31,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:31,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:31,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:31,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:31,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1593220146, now seen corresponding path program 1 times [2025-04-26 16:59:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:31,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034744894] [2025-04-26 16:59:31,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:31,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:31,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:59:31,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:59:31,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:31,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:31,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:31,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:59:31,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:59:31,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:31,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:31,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:31,320 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:31,320 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:31,320 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:31,320 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:31,320 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:31,320 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:31,320 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:31,320 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:31,320 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:59:31,320 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:31,320 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:31,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:31,331 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:31,331 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:31,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:31,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:31,333 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:59:31,333 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:59:31,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:31,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:31,349 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:59:31,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:31,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:31,351 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:59:31,352 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:59:31,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:31,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:31,411 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:31,415 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:59:31,415 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:31,415 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:31,415 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:31,415 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:31,415 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:31,415 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:31,415 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:31,415 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:31,415 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:59:31,415 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:31,415 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:31,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:31,431 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:31,432 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:31,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:31,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:31,434 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:59:31,436 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:59:31,437 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:59:31,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:31,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:31,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:31,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:31,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:31,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:31,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:31,448 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:31,450 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:59:31,450 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:59:31,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:31,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:31,452 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:59:31,453 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:59:31,453 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:31,456 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:59:31,456 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:31,456 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:31,456 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x7, z) = -1*x7 + 1*z Supporting invariants [] [2025-04-26 16:59:31,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:31,461 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:31,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:31,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:59:31,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:59:31,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:31,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:31,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:31,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:31,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:31,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:31,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:31,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:31,505 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:31,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:31,515 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:59:31,516 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:59:31,516 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 208463 states and 819321 transitions. cyclomatic complexity: 622232 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:59:38,119 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 208463 states and 819321 transitions. cyclomatic complexity: 622232. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 630697 states and 2571417 transitions. Complement of second has 6 states. [2025-04-26 16:59:38,120 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:59:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:59:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-04-26 16:59:38,121 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:59:38,121 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:38,121 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 16:59:38,121 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:38,121 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:59:38,121 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:38,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 630697 states and 2571417 transitions.