/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_6.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:57:14,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:57:14,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:57:14,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:57:14,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:57:14,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:57:14,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:57:14,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:57:14,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:57:14,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:57:14,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:57:14,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:57:14,354 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:57:14,354 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:57:14,354 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:57:14,354 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:57:14,354 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:57:14,354 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:57:14,354 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:57:14,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:57:14,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:57:14,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:14,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:57:14,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:57:14,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:57:14,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:57:14,356 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:57:14,356 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:57:14,356 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:57:14,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:57:14,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:57:14,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:57:14,593 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:57:14,593 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:57:14,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_6.c.bpl [2025-04-26 16:57:14,596 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_6.c.bpl' [2025-04-26 16:57:14,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:57:14,617 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:57:14,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:14,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:57:14,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:57:14,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,648 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:57:14,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:14,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:57:14,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:57:14,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:57:14,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:57:14,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:57:14,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:57:14,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:57:14,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/1) ... [2025-04-26 16:57:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:14,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:14,695 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:57:14,698 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:57:14,720 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:57:14,720 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:57:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:57:14,721 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:57:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:57:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:57:14,721 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:57:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:57:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:57:14,721 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:57:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:57:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:57:14,721 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:57:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:57:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:57:14,721 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:57:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:57:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:57:14,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:57:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:57:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:57:14,723 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:57:14,759 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:57:14,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:57:14,863 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:57:14,863 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:57:14,874 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:57:14,874 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:57:14,876 INFO L201 PluginConnector]: Adding new model indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:14 BoogieIcfgContainer [2025-04-26 16:57:14,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:57:14,877 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:57:14,877 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:57:14,882 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:57:14,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:14,883 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:14" (1/2) ... [2025-04-26 16:57:14,884 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1381b5c7 and model type indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:57:14, skipping insertion in model container [2025-04-26 16:57:14,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:14,884 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:14" (2/2) ... [2025-04-26 16:57:14,885 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_6.c.bpl [2025-04-26 16:57:14,958 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:57:14,998 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:57:14,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:57:14,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:15,001 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:57:15,003 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:57:15,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 140 flow [2025-04-26 16:57:15,083 INFO L116 PetriNetUnfolderBase]: 6/37 cut-off events. [2025-04-26 16:57:15,085 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:57:15,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 37 events. 6/37 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-26 16:57:15,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 49 transitions, 140 flow [2025-04-26 16:57:15,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 37 transitions, 110 flow [2025-04-26 16:57:15,091 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 50 places, 37 transitions, 110 flow [2025-04-26 16:57:15,096 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:57:16,202 WARN L140 AmpleReduction]: Number of pruned transitions: 15147 [2025-04-26 16:57:16,204 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:57:16,204 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3312 [2025-04-26 16:57:16,204 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:31 [2025-04-26 16:57:16,204 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:3483 [2025-04-26 16:57:16,204 WARN L145 AmpleReduction]: Times succ was already a loop node:9330 [2025-04-26 16:57:16,204 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1796 [2025-04-26 16:57:16,204 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:57:16,239 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 6827 states, 6826 states have (on average 3.6484031643715205) internal successors, (in total 24904), 6826 states have internal predecessors, (24904), 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:57:16,245 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:57:16,245 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:57:16,245 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:57:16,246 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:57:16,246 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:57:16,246 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:57:16,246 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:57:16,246 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:57:16,269 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6827 states, 6826 states have (on average 3.6484031643715205) internal successors, (in total 24904), 6826 states have internal predecessors, (24904), 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:57:16,435 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 6636 [2025-04-26 16:57:16,436 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:16,436 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:16,441 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:57:16,441 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:16,442 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:57:16,463 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6827 states, 6826 states have (on average 3.6484031643715205) internal successors, (in total 24904), 6826 states have internal predecessors, (24904), 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:57:16,577 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 6636 [2025-04-26 16:57:16,577 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:16,577 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:16,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:57:16,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:16,583 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:57:16,583 INFO L754 eck$LassoCheckResult]: Loop: "[93] L29-->L31: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[95] L31-->L29: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:57:16,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:16,589 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2025-04-26 16:57:16,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:16,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611561162] [2025-04-26 16:57:16,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:16,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:16,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:16,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:16,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:16,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:16,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:16,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:16,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:16,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:16,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:16,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2025-04-26 16:57:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:16,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562060752] [2025-04-26 16:57:16,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:16,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:16,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:16,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:16,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:16,680 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:16,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:16,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:16,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:16,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:16,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:16,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash 146167, now seen corresponding path program 1 times [2025-04-26 16:57:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:16,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967645382] [2025-04-26 16:57:16,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:16,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:16,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:16,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:16,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:16,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:16,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:16,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:16,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:16,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:16,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:16,752 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:16,752 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:16,754 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:16,754 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:16,754 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:16,754 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:16,754 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:16,754 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:16,754 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:16,754 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:16,754 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:16,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:16,862 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:16,862 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:16,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:16,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:16,887 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:57:16,893 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:57:16,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:16,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:16,916 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:57:16,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:16,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:16,938 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:57:16,941 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:57:16,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:16,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:17,015 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:17,021 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:57:17,021 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:17,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:17,021 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:17,021 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:17,021 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:17,021 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:17,021 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:17,021 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:17,021 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:17,021 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:17,022 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:17,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:17,053 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:17,057 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:17,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:17,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:17,062 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:57:17,063 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:57:17,064 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:57:17,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:17,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:17,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:17,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:17,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:17,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:17,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:17,090 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:17,097 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:17,098 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:17,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:17,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:17,102 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:57:17,103 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:57:17,103 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:17,107 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:57:17,108 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:17,108 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:17,109 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:57:17,114 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:57:17,117 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:17,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:17,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:17,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:17,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:17,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:17,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:17,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:17,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:17,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:17,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:17,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:17,174 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:17,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:17,196 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:57:17,214 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:57:17,231 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 6827 states, 6826 states have (on average 3.6484031643715205) internal successors, (in total 24904), 6826 states have internal predecessors, (24904), 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:57:17,645 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 6827 states, 6826 states have (on average 3.6484031643715205) internal successors, (in total 24904), 6826 states have internal predecessors, (24904), 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 16378 states and 59493 transitions. Complement of second has 6 states. [2025-04-26 16:57:17,647 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:57:17,651 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:57:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-04-26 16:57:17,657 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:57:17,658 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:17,658 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:57:17,658 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:17,658 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:57:17,659 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:17,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16378 states and 59493 transitions. [2025-04-26 16:57:18,011 INFO L131 ngComponentsAnalysis]: Automaton has 903 accepting balls. 3906 [2025-04-26 16:57:18,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16378 states to 9298 states and 33694 transitions. [2025-04-26 16:57:18,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3967 [2025-04-26 16:57:18,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5966 [2025-04-26 16:57:18,184 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9298 states and 33694 transitions. [2025-04-26 16:57:18,185 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:18,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9298 states and 33694 transitions. [2025-04-26 16:57:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9298 states and 33694 transitions. [2025-04-26 16:57:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9298 to 7968. [2025-04-26 16:57:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7968 states, 7968 states have (on average 3.6197289156626504) internal successors, (in total 28842), 7967 states have internal predecessors, (28842), 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:57:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7968 states to 7968 states and 28842 transitions. [2025-04-26 16:57:18,556 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7968 states and 28842 transitions. [2025-04-26 16:57:18,556 INFO L438 stractBuchiCegarLoop]: Abstraction has 7968 states and 28842 transitions. [2025-04-26 16:57:18,556 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:57:18,556 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7968 states and 28842 transitions. [2025-04-26 16:57:18,614 INFO L131 ngComponentsAnalysis]: Automaton has 903 accepting balls. 3906 [2025-04-26 16:57:18,615 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:18,615 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:18,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:57:18,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:18,616 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[92] L29-->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[]" "[94] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[121] L12-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:57:18,616 INFO L754 eck$LassoCheckResult]: Loop: "[97] L38-->L40: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[99] L40-->L38: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:57:18,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash 4530306, now seen corresponding path program 1 times [2025-04-26 16:57:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:18,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844446251] [2025-04-26 16:57:18,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:18,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:18,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:18,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:18,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:18,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:18,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:18,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:18,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:18,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:57:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:18,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456375896] [2025-04-26 16:57:18,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:18,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:18,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:18,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:18,633 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:18,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:18,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:18,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:18,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:18,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:18,637 INFO L85 PathProgramCache]: Analyzing trace with hash 58659876, now seen corresponding path program 1 times [2025-04-26 16:57:18,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:18,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836093444] [2025-04-26 16:57:18,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:18,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:18,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:18,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:18,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:18,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:18,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:18,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:18,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:18,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:18,671 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:18,672 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:18,672 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:18,672 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:18,672 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:18,672 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,672 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:18,672 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:18,672 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:18,672 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:18,672 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:18,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:18,691 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:18,691 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:18,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:18,693 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:57:18,695 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:57:18,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:18,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:18,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:18,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:18,716 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:57:18,717 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:57:18,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:18,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:18,783 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:18,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:18,788 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:18,788 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:18,788 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:18,788 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:18,788 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:18,788 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,788 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:18,788 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:18,788 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:18,788 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:18,788 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:18,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:18,813 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:18,813 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:18,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:18,815 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:57:18,816 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:57:18,819 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:57:18,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:18,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:18,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:18,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:18,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:18,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:18,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:18,834 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:18,838 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:18,838 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:18,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:18,841 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:57:18,842 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:57:18,843 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:18,846 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:57:18,847 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:57:18,848 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:18,848 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:18,848 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:57:18,854 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:57:18,856 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:18,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:18,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:18,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:18,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:18,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:18,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:18,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:18,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:18,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:18,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:18,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:18,905 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:57:18,906 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:57:18,906 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7968 states and 28842 transitions. cyclomatic complexity: 22109 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:57:19,319 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7968 states and 28842 transitions. cyclomatic complexity: 22109. 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 21087 states and 76938 transitions. Complement of second has 6 states. [2025-04-26 16:57:19,320 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:57:19,320 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:57:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-04-26 16:57:19,320 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:57:19,320 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:19,320 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:57:19,320 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:19,321 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:57:19,321 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:19,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21087 states and 76938 transitions. [2025-04-26 16:57:19,521 INFO L131 ngComponentsAnalysis]: Automaton has 580 accepting balls. 2030 [2025-04-26 16:57:19,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21087 states to 13083 states and 46641 transitions. [2025-04-26 16:57:19,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4488 [2025-04-26 16:57:19,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6146 [2025-04-26 16:57:19,785 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13083 states and 46641 transitions. [2025-04-26 16:57:19,785 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:19,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13083 states and 46641 transitions. [2025-04-26 16:57:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13083 states and 46641 transitions. [2025-04-26 16:57:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13083 to 11425. [2025-04-26 16:57:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11425 states, 11425 states have (on average 3.6119037199124726) internal successors, (in total 41266), 11424 states have internal predecessors, (41266), 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:57:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11425 states to 11425 states and 41266 transitions. [2025-04-26 16:57:20,184 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11425 states and 41266 transitions. [2025-04-26 16:57:20,184 INFO L438 stractBuchiCegarLoop]: Abstraction has 11425 states and 41266 transitions. [2025-04-26 16:57:20,184 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:57:20,184 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11425 states and 41266 transitions. [2025-04-26 16:57:20,262 INFO L131 ngComponentsAnalysis]: Automaton has 580 accepting balls. 2030 [2025-04-26 16:57:20,263 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:20,263 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:20,264 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:20,264 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:20,264 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[92] L29-->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[]" "[94] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[121] L12-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[96] L38-->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[]" "[98] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[124] L13-->L47: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:57:20,264 INFO L754 eck$LassoCheckResult]: Loop: "[101] L47-->L49: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[103] L49-->L47: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:57:20,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:20,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1818455288, now seen corresponding path program 1 times [2025-04-26 16:57:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:20,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470805617] [2025-04-26 16:57:20,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:20,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:20,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:20,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:20,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:20,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:20,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:20,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:20,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:20,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:20,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:20,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:20,281 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:57:20,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:20,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988262655] [2025-04-26 16:57:20,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:20,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:20,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:20,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:20,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:20,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:20,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:20,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:20,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:20,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:20,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:20,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:20,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:20,294 INFO L85 PathProgramCache]: Analyzing trace with hash -516154470, now seen corresponding path program 1 times [2025-04-26 16:57:20,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:20,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217577162] [2025-04-26 16:57:20,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:20,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:20,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:20,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:20,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:20,303 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:20,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:20,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:20,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:20,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:20,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:20,408 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:20,408 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:20,408 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:20,408 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:20,409 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:20,409 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:20,409 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:20,409 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:20,409 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:20,409 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:20,409 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:20,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:20,429 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:20,429 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:20,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:20,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:20,435 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:57:20,440 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:57:20,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:20,441 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:20,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:57:20,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:20,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:20,459 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:57:20,460 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:57:20,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:20,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:20,526 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:20,531 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:57:20,531 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:20,531 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:20,531 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:20,531 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:20,531 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:20,531 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:20,531 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:20,531 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:20,531 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:20,531 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:20,531 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:20,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:20,551 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:20,551 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:20,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:20,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:20,553 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:57:20,555 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:57:20,556 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:57:20,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:20,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:20,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:20,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:20,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:20,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:20,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:20,570 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:20,572 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:20,572 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:20,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:20,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:20,574 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:57:20,576 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:57:20,577 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:20,581 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:57:20,581 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:20,581 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:20,581 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:57:20,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:57:20,588 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:20,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:20,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:20,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:20,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:20,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:20,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:20,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:20,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:20,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:20,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:20,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:20,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:20,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:20,638 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:57:20,639 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:57:20,639 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11425 states and 41266 transitions. cyclomatic complexity: 31117 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:57:20,947 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11425 states and 41266 transitions. cyclomatic complexity: 31117. 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 30803 states and 111099 transitions. Complement of second has 6 states. [2025-04-26 16:57:20,947 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:57:20,948 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:57:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 16:57:20,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:57:20,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:20,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:57:20,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:20,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:57:20,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:20,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30803 states and 111099 transitions. [2025-04-26 16:57:21,208 INFO L131 ngComponentsAnalysis]: Automaton has 339 accepting balls. 966 [2025-04-26 16:57:21,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30803 states to 18421 states and 65014 transitions. [2025-04-26 16:57:21,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5188 [2025-04-26 16:57:21,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6149 [2025-04-26 16:57:21,474 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18421 states and 65014 transitions. [2025-04-26 16:57:21,475 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:21,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18421 states and 65014 transitions. [2025-04-26 16:57:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states and 65014 transitions. [2025-04-26 16:57:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 17211. [2025-04-26 16:57:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17211 states, 17211 states have (on average 3.485561559467782) internal successors, (in total 59990), 17210 states have internal predecessors, (59990), 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:57:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17211 states to 17211 states and 59990 transitions. [2025-04-26 16:57:22,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17211 states and 59990 transitions. [2025-04-26 16:57:22,031 INFO L438 stractBuchiCegarLoop]: Abstraction has 17211 states and 59990 transitions. [2025-04-26 16:57:22,031 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:57:22,031 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17211 states and 59990 transitions. [2025-04-26 16:57:22,140 INFO L131 ngComponentsAnalysis]: Automaton has 339 accepting balls. 966 [2025-04-26 16:57:22,140 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:22,140 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:22,141 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:22,141 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:22,141 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[93] L29-->L31: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[121] L12-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[95] L31-->L29: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[124] L13-->L47: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[92] L29-->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[]" "[127] L14-->L56: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[96] L38-->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[]" "[100] L47-->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:57:22,141 INFO L754 eck$LassoCheckResult]: Loop: "[105] L56-->L58: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[107] L58-->L56: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:57:22,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1299223883, now seen corresponding path program 1 times [2025-04-26 16:57:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:22,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714431290] [2025-04-26 16:57:22,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:22,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:22,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:22,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:22,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:22,151 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:22,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:22,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:22,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:22,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:22,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:22,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash 4323, now seen corresponding path program 1 times [2025-04-26 16:57:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:22,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139174428] [2025-04-26 16:57:22,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:22,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:22,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:22,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:22,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:22,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:22,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:22,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:22,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:22,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:22,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:22,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1281334935, now seen corresponding path program 1 times [2025-04-26 16:57:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:22,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55607871] [2025-04-26 16:57:22,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:22,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:22,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:22,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:22,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:22,171 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:22,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:22,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:22,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:22,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:22,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:22,195 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:22,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:22,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:22,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:22,196 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:22,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:22,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:22,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:22,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:22,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:22,196 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:22,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:22,212 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:22,212 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:22,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:22,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:22,214 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:57:22,215 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:57:22,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:22,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:22,232 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:57:22,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:22,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:22,235 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:57:22,238 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:57:22,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:22,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:22,304 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:22,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:57:22,308 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:22,308 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:22,308 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:22,308 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:22,308 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:22,308 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:22,308 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:22,308 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:22,308 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:22,308 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:22,308 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:22,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:22,327 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:22,327 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:22,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:22,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:22,329 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:57:22,330 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:57:22,332 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:57:22,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:22,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:22,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:22,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:22,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:22,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:22,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:22,345 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:22,349 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:22,349 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:22,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:22,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:22,352 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:57:22,353 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:57:22,354 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:22,357 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:57:22,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:22,358 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:22,358 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:22,358 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:57:22,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:22,364 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:22,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:22,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:22,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:22,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:22,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:22,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:22,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:22,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:22,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:22,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:22,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:22,401 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:22,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:22,411 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:57:22,412 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:57:22,412 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17211 states and 59990 transitions. cyclomatic complexity: 44237 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:57:22,767 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17211 states and 59990 transitions. cyclomatic complexity: 44237. 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 31627 states and 108530 transitions. Complement of second has 6 states. [2025-04-26 16:57:22,768 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:57:22,768 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:57:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-26 16:57:22,768 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:57:22,768 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:22,769 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:57:22,769 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:22,769 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:57:22,769 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:22,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31627 states and 108530 transitions. [2025-04-26 16:57:23,154 INFO L131 ngComponentsAnalysis]: Automaton has 172 accepting balls. 406 [2025-04-26 16:57:23,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31627 states to 23016 states and 77587 transitions. [2025-04-26 16:57:23,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6498 [2025-04-26 16:57:23,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7281 [2025-04-26 16:57:23,363 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23016 states and 77587 transitions. [2025-04-26 16:57:23,363 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:23,363 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23016 states and 77587 transitions. [2025-04-26 16:57:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23016 states and 77587 transitions. [2025-04-26 16:57:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23016 to 21477. [2025-04-26 16:57:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21477 states, 21477 states have (on average 3.415281463891605) internal successors, (in total 73350), 21476 states have internal predecessors, (73350), 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:57:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21477 states to 21477 states and 73350 transitions. [2025-04-26 16:57:23,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21477 states and 73350 transitions. [2025-04-26 16:57:23,936 INFO L438 stractBuchiCegarLoop]: Abstraction has 21477 states and 73350 transitions. [2025-04-26 16:57:23,936 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:57:23,936 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21477 states and 73350 transitions. [2025-04-26 16:57:24,203 INFO L131 ngComponentsAnalysis]: Automaton has 172 accepting balls. 406 [2025-04-26 16:57:24,203 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:24,204 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:24,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:24,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:24,205 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[93] L29-->L31: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[121] L12-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[95] L31-->L29: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[124] L13-->L47: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[92] L29-->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[]" "[127] L14-->L56: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[96] L38-->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[]" "[130] L15-->L65: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[100] L47-->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[]" "[104] L56-->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:57:24,205 INFO L754 eck$LassoCheckResult]: Loop: "[109] L65-->L67: Formula: (< v_x5_1 v_z_9) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" "[111] L67-->L65: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-04-26 16:57:24,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1281363607, now seen corresponding path program 1 times [2025-04-26 16:57:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:24,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682840643] [2025-04-26 16:57:24,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:24,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:24,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:24,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:24,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:24,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:24,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:24,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:24,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:24,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:24,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:24,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2025-04-26 16:57:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:24,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028240123] [2025-04-26 16:57:24,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:24,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:24,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:24,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:24,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:24,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:24,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:24,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:24,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:24,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:24,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:24,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:24,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1265184135, now seen corresponding path program 1 times [2025-04-26 16:57:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:24,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761545813] [2025-04-26 16:57:24,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:24,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:57:24,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:57:24,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:24,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:24,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:24,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:57:24,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:57:24,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:24,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:24,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:24,279 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:24,280 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:24,280 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:24,280 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:24,280 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:24,280 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:24,280 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:24,280 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:24,280 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:57:24,280 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:24,280 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:24,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:24,301 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:24,301 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:24,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:24,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:24,303 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:57:24,304 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:57:24,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:24,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:24,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:57:24,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:24,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:24,325 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:57:24,326 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:57:24,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:24,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:24,404 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:24,409 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:57:24,409 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:24,409 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:24,409 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:24,409 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:24,409 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:24,409 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:24,410 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:24,410 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:24,410 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:57:24,410 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:24,410 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:24,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:24,430 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:24,430 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:24,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:24,432 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:57:24,434 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:57:24,435 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:57:24,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:24,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:24,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:24,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:24,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:24,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:24,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:24,449 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:24,451 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:24,451 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:24,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:24,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:24,453 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:57:24,456 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:57:24,456 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:24,462 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:57:24,463 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:24,463 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:24,463 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:57:24,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:57:24,470 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:24,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:24,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:24,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:24,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:24,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:24,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:24,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:24,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:24,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:24,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:24,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:24,517 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:24,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:24,530 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:57:24,530 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:57:24,531 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21477 states and 73350 transitions. cyclomatic complexity: 53581 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:57:25,093 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21477 states and 73350 transitions. cyclomatic complexity: 53581. 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 40558 states and 134057 transitions. Complement of second has 6 states. [2025-04-26 16:57:25,094 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:57:25,094 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:57:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-26 16:57:25,094 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:57:25,094 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:25,094 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:57:25,094 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:25,095 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:57:25,095 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:25,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40558 states and 134057 transitions. [2025-04-26 16:57:25,450 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 16:57:25,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40558 states to 24289 states and 79300 transitions. [2025-04-26 16:57:25,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6391 [2025-04-26 16:57:25,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6718 [2025-04-26 16:57:25,794 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24289 states and 79300 transitions. [2025-04-26 16:57:25,794 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:25,795 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24289 states and 79300 transitions. [2025-04-26 16:57:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24289 states and 79300 transitions. [2025-04-26 16:57:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24289 to 23196. [2025-04-26 16:57:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23196 states, 23196 states have (on average 3.2881100189687875) internal successors, (in total 76271), 23195 states have internal predecessors, (76271), 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:57:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23196 states to 23196 states and 76271 transitions. [2025-04-26 16:57:26,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23196 states and 76271 transitions. [2025-04-26 16:57:26,358 INFO L438 stractBuchiCegarLoop]: Abstraction has 23196 states and 76271 transitions. [2025-04-26 16:57:26,358 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:57:26,358 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23196 states and 76271 transitions. [2025-04-26 16:57:26,467 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 16:57:26,468 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:26,468 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:26,468 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:26,468 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:26,469 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[93] L29-->L31: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[121] L12-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[95] L31-->L29: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[124] L13-->L47: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[92] L29-->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[]" "[127] L14-->L56: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[96] L38-->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[]" "[130] L15-->L65: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[100] L47-->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[]" "[133] L16-->L74: 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]" "[104] L56-->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[]" "[108] L65-->thread5FINAL: Formula: (<= v_z_10 v_x5_4) InVars {x5=v_x5_4, z=v_z_10} OutVars{x5=v_x5_4, z=v_z_10} AuxVars[] AssignedVars[]" [2025-04-26 16:57:26,469 INFO L754 eck$LassoCheckResult]: Loop: "[113] L74-->L76: Formula: (< v_x6_1 v_z_11) InVars {x6=v_x6_1, z=v_z_11} OutVars{x6=v_x6_1, z=v_z_11} AuxVars[] AssignedVars[]" "[115] L76-->L74: Formula: (= v_x6_2 (+ v_x6_3 1)) InVars {x6=v_x6_3} OutVars{x6=v_x6_2} AuxVars[] AssignedVars[x6]" [2025-04-26 16:57:26,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1265156424, now seen corresponding path program 1 times [2025-04-26 16:57:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:26,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98952521] [2025-04-26 16:57:26,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:26,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:57:26,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:57:26,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:26,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:26,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:26,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:57:26,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:57:26,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:26,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:26,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:26,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:26,482 INFO L85 PathProgramCache]: Analyzing trace with hash 4579, now seen corresponding path program 1 times [2025-04-26 16:57:26,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:26,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868926492] [2025-04-26 16:57:26,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:26,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:26,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:26,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:26,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:26,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:26,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:26,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:26,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:26,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:26,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:26,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:26,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -339575078, now seen corresponding path program 1 times [2025-04-26 16:57:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:26,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198706815] [2025-04-26 16:57:26,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:26,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:57:26,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:57:26,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:26,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:26,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:26,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:57:26,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:57:26,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:26,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:26,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:26,519 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:26,519 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:26,519 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:26,520 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:26,520 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:26,520 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:26,520 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:26,520 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:26,520 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:57:26,520 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:26,520 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:26,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:26,544 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:26,545 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:26,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:26,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:26,546 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:57:26,547 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:57:26,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:26,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:26,565 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:57:26,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:26,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:26,567 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:57:26,568 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:57:26,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:26,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:26,632 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:26,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:57:26,636 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:26,636 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:26,636 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:26,636 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:26,636 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:26,636 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:26,636 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:26,636 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:26,636 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:57:26,636 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:26,636 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:26,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:26,650 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:26,650 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:26,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:26,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:26,652 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:57:26,654 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:57:26,655 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:57:26,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:26,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:26,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:26,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:26,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:26,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:26,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:26,671 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:26,673 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:26,673 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:26,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:26,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:26,675 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:57:26,676 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:57:26,677 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:26,680 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:57:26,680 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:26,680 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:26,680 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x6) = 1*z - 1*x6 Supporting invariants [] [2025-04-26 16:57:26,685 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:57:26,686 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:26,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:26,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:57:26,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:57:26,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:26,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:26,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:26,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:26,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:26,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:26,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:26,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:26,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:26,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:26,745 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:57:26,746 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:57:26,746 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23196 states and 76271 transitions. cyclomatic complexity: 54971 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:57:27,281 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23196 states and 76271 transitions. cyclomatic complexity: 54971. 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 43376 states and 139157 transitions. Complement of second has 6 states. [2025-04-26 16:57:27,282 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:57:27,282 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:57:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-04-26 16:57:27,283 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:57:27,283 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:27,283 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 16:57:27,283 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:27,283 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:57:27,283 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:27,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43376 states and 139157 transitions. [2025-04-26 16:57:27,888 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:27,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43376 states to 0 states and 0 transitions. [2025-04-26 16:57:27,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:57:27,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:57:27,888 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:57:27,888 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:57:27,888 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:27,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:27,888 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:27,888 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:57:27,888 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:57:27,889 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:27,889 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:57:27,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:57:27,900 INFO L201 PluginConnector]: Adding new model indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:57:27 BoogieIcfgContainer [2025-04-26 16:57:27,900 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:57:27,901 INFO L158 Benchmark]: Toolchain (without parser) took 13288.01ms. Allocated memory was 155.2MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 83.5MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 958.1MB. Max. memory is 8.0GB. [2025-04-26 16:57:27,901 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.94ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:27,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.51ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:27,901 INFO L158 Benchmark]: Boogie Preprocessor took 17.66ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:27,901 INFO L158 Benchmark]: RCFGBuilder took 208.31ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 71.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:57:27,901 INFO L158 Benchmark]: BuchiAutomizer took 13023.27ms. Allocated memory was 155.2MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 71.1MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 945.5MB. Max. memory is 8.0GB. [2025-04-26 16:57:27,902 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.94ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.51ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.66ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 208.31ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 71.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 13023.27ms. Allocated memory was 155.2MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 71.1MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 945.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.8s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.3s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 2.5s AutomataMinimizationTime, 5 MinimizatonAttempts, 6830 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 3.3s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 424 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 542 IncrementalHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 196 mSDtfsCounter, 542 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 50ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 1.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 1211, Number of transitions in reduction automaton: 24904, Number of states in reduction automaton: 6827, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x6 and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:57:27,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...