/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/3_thr/indep_loops_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:29,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:29,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:29,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:29,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:29,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:29,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:29,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:29,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:29,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:29,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:29,863 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:29,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:29,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:29,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:29,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:29,864 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:29,865 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:29,865 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:30,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:30,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:30,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:30,124 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:30,125 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:30,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/indep_loops_3.c.bpl [2025-04-26 18:42:30,127 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/indep_loops_3.c.bpl' [2025-04-26 18:42:30,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:30,143 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:30,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:30,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:30,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:30,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,176 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:30,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:30,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:30,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:30,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:30,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:30,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:30,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:30,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:30,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/1) ... [2025-04-26 18:42:30,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:30,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,225 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 18:42:30,228 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 18:42:30,249 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:30,249 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:30,249 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:30,250 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:30,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:30,250 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 18:42:30,286 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:30,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:30,356 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:30,356 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:30,367 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:30,367 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:30,369 INFO L201 PluginConnector]: Adding new model indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:30 BoogieIcfgContainer [2025-04-26 18:42:30,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:30,370 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:30,370 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:30,375 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:30,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:30,376 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:30" (1/2) ... [2025-04-26 18:42:30,378 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71edeb01 and model type indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:30, skipping insertion in model container [2025-04-26 18:42:30,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:30,378 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:30" (2/2) ... [2025-04-26 18:42:30,379 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_3.c.bpl [2025-04-26 18:42:30,429 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:42:30,470 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:30,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:30,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,473 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 18:42:30,475 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 18:42:30,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 71 flow [2025-04-26 18:42:30,547 INFO L116 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-04-26 18:42:30,550 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:42:30,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 3/19 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:42:30,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 25 transitions, 71 flow [2025-04-26 18:42:30,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 19 transitions, 56 flow [2025-04-26 18:42:30,558 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 19 transitions, 56 flow [2025-04-26 18:42:30,558 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 56 flow [2025-04-26 18:42:30,576 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 2.8962264150943398) internal successors, (in total 307), 106 states have internal predecessors, (307), 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 18:42:30,578 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 107 states, 106 states have (on average 2.8962264150943398) internal successors, (in total 307), 106 states have internal predecessors, (307), 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 18:42:30,580 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:30,630 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 18:42:30,631 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:30,631 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 18:42:30,631 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:16 [2025-04-26 18:42:30,631 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 18:42:30,631 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 18:42:30,631 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:42:30,631 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:30,632 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 107 states, 106 states have (on average 2.0754716981132075) internal successors, (in total 220), 106 states have internal predecessors, (220), 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 18:42:30,637 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:30,637 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:30,637 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:30,637 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:30,637 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:30,637 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:30,637 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:30,637 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:30,638 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 107 states, 106 states have (on average 2.0754716981132075) internal successors, (in total 220), 106 states have internal predecessors, (220), 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 18:42:30,649 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:42:30,649 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:30,649 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:30,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:30,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:30,651 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:30,652 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 107 states, 106 states have (on average 2.0754716981132075) internal successors, (in total 220), 106 states have internal predecessors, (220), 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 18:42:30,654 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:42:30,654 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:30,654 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:30,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:30,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:30,657 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:30,658 INFO L754 eck$LassoCheckResult]: Loop: "[48] L23-->L25: 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[]" "[50] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:30,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 92, now seen corresponding path program 1 times [2025-04-26 18:42:30,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365646621] [2025-04-26 18:42:30,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:30,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:30,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,709 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:30,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:30,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:30,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:30,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2025-04-26 18:42:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209294077] [2025-04-26 18:42:30,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:30,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:30,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:30,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:30,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:30,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:30,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash 89950, now seen corresponding path program 1 times [2025-04-26 18:42:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409267427] [2025-04-26 18:42:30,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:30,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:30,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:30,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:30,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:30,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:30,808 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:30,808 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:30,808 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:30,808 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:30,809 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:30,809 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,809 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:30,809 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:30,809 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:30,809 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:30,809 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:30,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:30,865 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:30,865 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:30,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,868 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 18:42:30,869 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 18:42:30,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:30,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:30,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:42:30,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,891 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 18:42:30,892 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 18:42:30,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:30,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:30,966 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:30,971 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 18:42:30,971 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:30,971 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:30,971 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:30,971 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:30,971 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:30,971 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,971 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:30,972 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:30,972 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:30,972 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:30,972 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:30,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:30,993 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:30,996 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:30,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,999 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 18:42:30,999 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 18:42:31,001 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 18:42:31,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:31,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:31,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:31,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:31,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:31,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:31,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:31,021 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:31,025 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:31,025 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:31,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,029 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 18:42:31,030 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 18:42:31,030 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:31,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,033 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:31,034 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:31,034 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:42:31,039 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 18:42:31,041 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:31,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:31,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:31,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,101 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,111 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,139 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 18:42:31,155 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 18:42:31,156 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 107 states, 106 states have (on average 2.0754716981132075) internal successors, (in total 220), 106 states have internal predecessors, (220), 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 18:42:31,239 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 107 states, 106 states have (on average 2.0754716981132075) internal successors, (in total 220), 106 states have internal predecessors, (220), 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 252 states and 521 transitions. Complement of second has 6 states. [2025-04-26 18:42:31,240 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 18:42:31,242 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 18:42:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-26 18:42:31,245 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:42:31,246 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,246 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:31,246 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,246 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:42:31,246 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 521 transitions. [2025-04-26 18:42:31,253 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:42:31,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 115 states and 237 transitions. [2025-04-26 18:42:31,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-04-26 18:42:31,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-04-26 18:42:31,256 INFO L74 IsDeterministic]: Start isDeterministic. Operand 115 states and 237 transitions. [2025-04-26 18:42:31,257 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:31,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 237 transitions. [2025-04-26 18:42:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 237 transitions. [2025-04-26 18:42:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2025-04-26 18:42:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 2.06) internal successors, (in total 206), 99 states have internal predecessors, (206), 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 18:42:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 206 transitions. [2025-04-26 18:42:31,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 206 transitions. [2025-04-26 18:42:31,276 INFO L438 stractBuchiCegarLoop]: Abstraction has 100 states and 206 transitions. [2025-04-26 18:42:31,276 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:31,276 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 206 transitions. [2025-04-26 18:42:31,277 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:42:31,277 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:31,277 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:31,277 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:31,277 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:31,277 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[47] L23-->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[]" "[49] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[64] L12-->L32: 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 18:42:31,278 INFO L754 eck$LassoCheckResult]: Loop: "[52] L32-->L34: 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[]" "[54] L34-->L32: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:31,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2787522, now seen corresponding path program 1 times [2025-04-26 18:42:31,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393360120] [2025-04-26 18:42:31,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:31,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:31,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:31,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:31,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2627, now seen corresponding path program 1 times [2025-04-26 18:42:31,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397265672] [2025-04-26 18:42:31,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1616156988, now seen corresponding path program 1 times [2025-04-26 18:42:31,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754859589] [2025-04-26 18:42:31,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:31,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:31,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:31,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:31,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,325 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:31,326 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:31,326 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:31,326 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:31,326 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:31,326 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,326 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:31,326 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:31,326 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:31,326 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:31,326 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:31,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:31,348 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:31,348 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:31,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,352 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 18:42:31,353 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 18:42:31,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:31,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:31,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:31,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,373 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 18:42:31,374 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 18:42:31,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:31,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:31,434 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:31,439 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 18:42:31,439 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:31,439 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:31,439 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:31,439 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:31,439 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:31,440 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,440 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:31,440 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:31,440 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:31,440 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:31,440 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:31,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:31,459 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:31,459 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:31,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,487 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 18:42:31,487 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 18:42:31,488 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 18:42:31,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:31,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:31,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:31,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:31,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:31,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:31,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:31,504 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:31,507 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:31,507 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:31,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,521 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 18:42:31,523 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 18:42:31,524 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:31,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,528 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:31,528 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:31,528 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:42:31,535 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 18:42:31,536 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:31,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:31,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:31,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,566 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,580 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 18:42:31,580 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 18:42:31,580 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 206 transitions. cyclomatic complexity: 133 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 18:42:31,627 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 206 transitions. cyclomatic complexity: 133. 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 256 states and 528 transitions. Complement of second has 6 states. [2025-04-26 18:42:31,628 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 18:42:31,628 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 18:42:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2025-04-26 18:42:31,629 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:31,629 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,629 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:31,629 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,629 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:42:31,629 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 528 transitions. [2025-04-26 18:42:31,632 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:42:31,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 119 states and 240 transitions. [2025-04-26 18:42:31,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-04-26 18:42:31,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2025-04-26 18:42:31,633 INFO L74 IsDeterministic]: Start isDeterministic. Operand 119 states and 240 transitions. [2025-04-26 18:42:31,634 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:31,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 240 transitions. [2025-04-26 18:42:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 240 transitions. [2025-04-26 18:42:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2025-04-26 18:42:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 2.056603773584906) internal successors, (in total 218), 105 states have internal predecessors, (218), 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 18:42:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 218 transitions. [2025-04-26 18:42:31,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 218 transitions. [2025-04-26 18:42:31,638 INFO L438 stractBuchiCegarLoop]: Abstraction has 106 states and 218 transitions. [2025-04-26 18:42:31,638 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:31,638 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 218 transitions. [2025-04-26 18:42:31,639 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:42:31,639 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:31,639 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:31,639 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:31,639 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:31,640 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[48] L23-->L25: 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[]" "[64] L12-->L32: 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]" "[50] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[67] L13-->L41: 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]" "[47] L23-->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[]" "[51] L32-->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[]" [2025-04-26 18:42:31,640 INFO L754 eck$LassoCheckResult]: Loop: "[56] L41-->L43: 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[]" "[58] L43-->L41: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:31,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1480820065, now seen corresponding path program 1 times [2025-04-26 18:42:31,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718852282] [2025-04-26 18:42:31,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:31,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:31,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:31,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:31,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2025-04-26 18:42:31,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570762406] [2025-04-26 18:42:31,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1433909283, now seen corresponding path program 1 times [2025-04-26 18:42:31,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340095091] [2025-04-26 18:42:31,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:31,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:31,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:31,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:31,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,693 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:31,693 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:31,693 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:31,693 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:31,693 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:31,693 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,693 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:31,693 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:31,693 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:31,693 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:31,693 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:31,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:31,709 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:31,709 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:31,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,712 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 18:42:31,713 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 18:42:31,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:31,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:31,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,733 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 18:42:31,733 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 18:42:31,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:31,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:31,798 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:31,803 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 18:42:31,803 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:31,803 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:31,803 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:31,803 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:31,803 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:31,803 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,803 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:31,803 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:31,803 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:31,803 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:31,803 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:31,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:31,820 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:31,820 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:31,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,822 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 18:42:31,824 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 18:42:31,825 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 18:42:31,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:31,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:31,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:31,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:31,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:31,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:31,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:31,837 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:31,839 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:31,839 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:31,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,841 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 18:42:31,843 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 18:42:31,844 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:31,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:31,847 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:31,847 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:31,847 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 18:42:31,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,854 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:31,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:31,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:31,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,913 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 18:42:31,913 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 18:42:31,914 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 218 transitions. cyclomatic complexity: 133 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 18:42:31,953 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 218 transitions. cyclomatic complexity: 133. 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 209 states and 409 transitions. Complement of second has 6 states. [2025-04-26 18:42:31,954 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 18:42:31,954 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 18:42:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-04-26 18:42:31,954 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:31,954 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,954 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:31,955 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,955 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:42:31,955 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 409 transitions. [2025-04-26 18:42:31,956 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:31,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 0 states and 0 transitions. [2025-04-26 18:42:31,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:31,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:31,957 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:31,957 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:31,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:31,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:31,957 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:31,957 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:31,957 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:31,957 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:31,957 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:31,971 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 18:42:31,972 INFO L201 PluginConnector]: Adding new model indep_loops_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:31 BoogieIcfgContainer [2025-04-26 18:42:31,972 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:31,973 INFO L158 Benchmark]: Toolchain (without parser) took 1829.23ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 85.1MB in the beginning and 39.6MB in the end (delta: 45.5MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. [2025-04-26 18:42:31,973 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.68ms. Allocated memory is still 155.2MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:31,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.80ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 83.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:31,973 INFO L158 Benchmark]: Boogie Preprocessor took 20.48ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 82.2MB in the end (delta: 886.8kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:31,973 INFO L158 Benchmark]: RCFGBuilder took 169.82ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 73.6MB in the end (delta: 8.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:31,974 INFO L158 Benchmark]: BuchiAutomizer took 1601.84ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 73.4MB in the beginning and 39.6MB in the end (delta: 33.8MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2025-04-26 18:42:31,975 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.68ms. Allocated memory is still 155.2MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.80ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 83.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.48ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 82.2MB in the end (delta: 886.8kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 169.82ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 73.6MB in the end (delta: 8.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 1601.84ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 73.4MB in the beginning and 39.6MB in the end (delta: 33.8MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 37 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 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: 37ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 166, Number of transitions in reduction automaton: 220, Number of states in reduction automaton: 107, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 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. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:31,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...