/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:43:31,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:43:31,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:43:31,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:43:31,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:43:31,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:43:31,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:43:31,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:43:31,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:43:31,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:43:31,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:43:31,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:43:31,283 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:43:31,283 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:43:31,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:43:31,284 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:43:31,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:43:31,285 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:43:31,285 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:43:31,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:43:31,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:43:31,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:31,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:43:31,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:43:31,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:43:31,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:43:31,285 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:43:31,285 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:43:31,285 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:43:31,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:43:31,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:43:31,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:43:31,530 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:43:31,530 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:43:31,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_4.c.bpl [2025-04-26 18:43:31,534 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_4.c.bpl' [2025-04-26 18:43:31,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:43:31,549 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:43:31,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:31,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:43:31,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:43:31,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,589 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:43:31,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:31,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:43:31,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:43:31,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:43:31,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:43:31,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:43:31,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:43:31,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:43:31,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/1) ... [2025-04-26 18:43:31,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:31,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:31,641 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:43:31,644 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:43:31,665 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:43:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:43:31,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:43:31,666 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:43:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:43:31,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:43:31,666 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:43:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:43:31,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:43:31,666 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:43:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:43:31,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:43:31,666 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:43:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:43:31,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:43:31,667 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:43:31,704 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:43:31,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:43:31,765 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:43:31,765 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:43:31,771 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:43:31,772 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:43:31,772 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:31 BoogieIcfgContainer [2025-04-26 18:43:31,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:43:31,773 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:43:31,773 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:43:31,776 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:43:31,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:31,777 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:31" (1/2) ... [2025-04-26 18:43:31,778 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3228644d and model type indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:43:31, skipping insertion in model container [2025-04-26 18:43:31,778 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:31,778 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:31" (2/2) ... [2025-04-26 18:43:31,779 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_4.c.bpl [2025-04-26 18:43:31,818 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:43:31,858 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:43:31,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:43:31,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:31,861 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:43:31,861 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:43:31,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 96 flow [2025-04-26 18:43:31,921 INFO L116 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-04-26 18:43:31,926 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:43:31,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 4/26 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-04-26 18:43:31,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 34 transitions, 96 flow [2025-04-26 18:43:31,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 76 flow [2025-04-26 18:43:31,934 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 26 transitions, 76 flow [2025-04-26 18:43:31,935 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 76 flow [2025-04-26 18:43:31,984 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 527 states, 526 states have (on average 3.8916349809885933) internal successors, (in total 2047), 526 states have internal predecessors, (2047), 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:43:31,986 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 527 states, 526 states have (on average 3.8916349809885933) internal successors, (in total 2047), 526 states have internal predecessors, (2047), 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:43:31,988 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:43:32,150 WARN L140 AmpleReduction]: Number of pruned transitions: 719 [2025-04-26 18:43:32,150 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:43:32,150 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 206 [2025-04-26 18:43:32,151 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 18:43:32,151 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:286 [2025-04-26 18:43:32,151 WARN L145 AmpleReduction]: Times succ was already a loop node:301 [2025-04-26 18:43:32,151 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:83 [2025-04-26 18:43:32,151 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:43:32,152 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 516 states, 515 states have (on average 2.500970873786408) internal successors, (in total 1288), 515 states have internal predecessors, (1288), 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:43:32,162 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:43:32,162 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:43:32,162 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:43:32,162 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:43:32,162 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:43:32,162 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:43:32,162 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:43:32,162 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:43:32,165 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 516 states, 515 states have (on average 2.500970873786408) internal successors, (in total 1288), 515 states have internal predecessors, (1288), 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:43:32,188 INFO L131 ngComponentsAnalysis]: Automaton has 109 accepting balls. 442 [2025-04-26 18:43:32,188 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:32,188 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:32,191 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:43:32,191 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:32,191 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:43:32,192 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 516 states, 515 states have (on average 2.500970873786408) internal successors, (in total 1288), 515 states have internal predecessors, (1288), 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:43:32,228 INFO L131 ngComponentsAnalysis]: Automaton has 109 accepting balls. 442 [2025-04-26 18:43:32,228 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:32,228 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:32,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:43:32,228 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:32,232 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:43:32,232 INFO L754 eck$LassoCheckResult]: Loop: "[65] L25-->L27: 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[]" "[67] L27-->L25: 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:43:32,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2025-04-26 18:43:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:32,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343951394] [2025-04-26 18:43:32,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:32,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:43:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:43:32,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:32,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:43:32,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:43:32,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:32,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:32,306 INFO L85 PathProgramCache]: Analyzing trace with hash 3043, now seen corresponding path program 1 times [2025-04-26 18:43:32,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:32,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954478581] [2025-04-26 18:43:32,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:32,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:32,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:32,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:32,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:32,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:32,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:32,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:32,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 111636, now seen corresponding path program 1 times [2025-04-26 18:43:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:32,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817419526] [2025-04-26 18:43:32,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:32,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:32,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:32,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:32,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:32,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:32,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:32,370 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:32,371 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:32,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:32,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:32,371 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:32,371 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:32,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:32,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:32,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:43:32,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:32,372 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:32,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:32,436 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:32,436 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:32,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:32,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:32,440 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:43:32,441 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:43:32,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:32,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:32,462 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:43:32,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:32,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:32,466 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:43:32,468 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:43:32,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:32,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:32,540 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:32,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:43:32,545 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:32,545 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:32,545 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:32,545 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:32,545 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:32,545 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:32,546 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:32,546 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:32,546 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:43:32,546 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:32,546 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:32,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:32,569 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:32,572 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:32,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:32,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:32,575 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:43:32,576 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:43:32,578 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:43:32,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:32,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:32,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:32,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:32,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:32,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:32,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:32,608 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:32,615 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:32,615 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:32,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:32,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:32,620 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:43:32,621 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:43:32,625 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:32,629 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:32,630 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:32,630 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:43:32,634 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:43:32,649 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:43:32,657 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:32,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:32,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:43:32,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:43:32,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:32,697 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:32,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:32,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:32,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:32,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:32,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:32,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:32,731 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:43:32,753 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:43:32,755 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 516 states, 515 states have (on average 2.500970873786408) internal successors, (in total 1288), 515 states have internal predecessors, (1288), 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:43:32,871 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 516 states, 515 states have (on average 2.500970873786408) internal successors, (in total 1288), 515 states have internal predecessors, (1288), 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 1357 states and 3586 transitions. Complement of second has 6 states. [2025-04-26 18:43:32,873 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:43:32,876 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:43:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 18:43:32,880 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:43:32,880 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:32,880 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:43:32,880 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:32,881 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:43:32,881 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:32,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1357 states and 3586 transitions. [2025-04-26 18:43:32,894 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 248 [2025-04-26 18:43:32,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1357 states to 810 states and 2086 transitions. [2025-04-26 18:43:32,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 351 [2025-04-26 18:43:32,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 540 [2025-04-26 18:43:32,907 INFO L74 IsDeterministic]: Start isDeterministic. Operand 810 states and 2086 transitions. [2025-04-26 18:43:32,907 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:32,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 810 states and 2086 transitions. [2025-04-26 18:43:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states and 2086 transitions. [2025-04-26 18:43:32,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 637. [2025-04-26 18:43:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 637 states have (on average 2.6656200941915227) internal successors, (in total 1698), 636 states have internal predecessors, (1698), 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:43:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1698 transitions. [2025-04-26 18:43:32,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 637 states and 1698 transitions. [2025-04-26 18:43:32,947 INFO L438 stractBuchiCegarLoop]: Abstraction has 637 states and 1698 transitions. [2025-04-26 18:43:32,947 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:43:32,947 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 637 states and 1698 transitions. [2025-04-26 18:43:32,950 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 248 [2025-04-26 18:43:32,950 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:32,950 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:32,950 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:43:32,950 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:32,951 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[64] L25-->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[]" "[66] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[86] L12-->L34: 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:43:32,951 INFO L754 eck$LassoCheckResult]: Loop: "[69] L34-->L36: 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[]" "[71] L36-->L34: 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:43:32,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash 3459810, now seen corresponding path program 1 times [2025-04-26 18:43:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:32,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73420086] [2025-04-26 18:43:32,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:32,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:32,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:32,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,955 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:32,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:32,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:32,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:32,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:32,958 INFO L85 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2025-04-26 18:43:32,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:32,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911076411] [2025-04-26 18:43:32,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:32,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:32,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:32,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:32,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,961 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:32,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:32,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:32,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:32,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:32,963 INFO L85 PathProgramCache]: Analyzing trace with hash -970087676, now seen corresponding path program 1 times [2025-04-26 18:43:32,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:32,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451073467] [2025-04-26 18:43:32,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:32,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:32,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:32,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:32,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:32,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:32,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:32,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:32,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:32,980 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:32,980 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:32,980 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:32,980 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:32,980 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:32,980 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:32,980 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:32,980 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:32,980 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:32,980 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:32,980 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:32,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:32,996 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:32,996 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:32,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:32,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:32,998 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:43:33,000 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:43:33,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:33,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:33,017 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:43:33,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,019 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:43:33,020 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:43:33,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:33,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:33,085 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:33,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:43:33,089 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:33,089 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:33,089 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:33,090 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:33,090 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:33,090 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,090 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:33,090 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:33,090 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:33,090 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:33,090 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:33,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:33,104 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:33,104 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:33,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,106 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:43:33,107 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:43:33,108 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:43:33,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:33,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:33,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:33,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:33,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:33,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:33,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:33,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:33,123 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:33,123 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:33,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,125 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:43:33,126 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:43:33,127 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:33,130 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:43:33,130 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:33,130 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:33,130 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:43:33,135 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:43:33,136 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:33,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:33,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:33,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:33,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:33,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:33,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:33,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:33,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:33,170 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:33,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:33,184 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:43:33,185 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:43:33,185 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 637 states and 1698 transitions. cyclomatic complexity: 1170 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:43:33,293 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 637 states and 1698 transitions. cyclomatic complexity: 1170. 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 1750 states and 4590 transitions. Complement of second has 6 states. [2025-04-26 18:43:33,294 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:43:33,294 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:43:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-26 18:43:33,295 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:43:33,295 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:33,295 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:43:33,295 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:33,295 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:43:33,295 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:33,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1750 states and 4590 transitions. [2025-04-26 18:43:33,311 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 116 [2025-04-26 18:43:33,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1750 states to 1073 states and 2772 transitions. [2025-04-26 18:43:33,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 368 [2025-04-26 18:43:33,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 499 [2025-04-26 18:43:33,323 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1073 states and 2772 transitions. [2025-04-26 18:43:33,324 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:33,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1073 states and 2772 transitions. [2025-04-26 18:43:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states and 2772 transitions. [2025-04-26 18:43:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 941. [2025-04-26 18:43:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 941 states have (on average 2.663124335812965) internal successors, (in total 2506), 940 states have internal predecessors, (2506), 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:43:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2506 transitions. [2025-04-26 18:43:33,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 941 states and 2506 transitions. [2025-04-26 18:43:33,347 INFO L438 stractBuchiCegarLoop]: Abstraction has 941 states and 2506 transitions. [2025-04-26 18:43:33,347 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:43:33,347 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 941 states and 2506 transitions. [2025-04-26 18:43:33,351 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 116 [2025-04-26 18:43:33,351 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:33,351 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:33,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:33,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:43:33,351 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[64] L25-->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[]" "[66] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[86] L12-->L34: 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]" "[68] L34-->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[]" "[70] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[89] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:43:33,351 INFO L754 eck$LassoCheckResult]: Loop: "[73] L43-->L45: 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[]" "[75] L45-->L46: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[76] L46-->L43: Formula: (= v_x4_1 (+ v_x4_2 1)) InVars {x4=v_x4_2} OutVars{x4=v_x4_1} AuxVars[] AssignedVars[x4]" [2025-04-26 18:43:33,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash -7947787, now seen corresponding path program 1 times [2025-04-26 18:43:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:33,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861410444] [2025-04-26 18:43:33,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:33,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:33,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:33,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:33,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:33,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:33,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:33,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:33,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 1 times [2025-04-26 18:43:33,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:33,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307816406] [2025-04-26 18:43:33,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:33,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:33,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:33,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:33,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:33,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:33,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:33,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,372 INFO L85 PathProgramCache]: Analyzing trace with hash -549248683, now seen corresponding path program 1 times [2025-04-26 18:43:33,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:33,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417225689] [2025-04-26 18:43:33,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:33,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:33,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:43:33,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:43:33,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:33,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:43:33,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:43:33,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:33,398 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:33,398 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:33,398 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:33,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:33,398 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:33,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:33,398 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:33,398 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:43:33,398 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:33,398 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:33,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:33,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:33,425 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:33,426 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:33,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,428 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:43:33,429 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:43:33,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:33,431 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:33,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:43:33,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,448 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:43:33,449 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:43:33,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:33,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:33,473 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:43:33,473 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x4=0} Honda state: {x4=0} Generalized eigenvectors: [{x4=2}, {x4=-6}, {x4=5}] Lambdas: [4, 1, 1] Nus: [1, 0] [2025-04-26 18:43:33,478 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:43:33,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,480 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:43:33,481 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:43:33,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:33,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:33,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:43:33,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,499 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:43:33,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:33,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:33,511 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:43:33,575 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:33,579 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:43:33,579 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:33,579 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:33,579 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:33,579 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:33,579 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:33,579 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,579 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:33,579 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:33,579 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:43:33,579 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:33,579 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:33,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:33,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:33,608 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:33,608 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:33,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,611 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:33,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:43:33,614 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:43:33,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:33,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:33,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:33,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:33,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:33,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:33,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:33,626 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:43:33,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:33,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,633 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:33,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:43:33,636 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:43:33,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:33,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:33,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:33,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:33,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:33,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:33,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:33,649 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:33,652 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:33,652 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:43:33,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,654 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:33,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:43:33,655 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:33,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:33,658 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:33,658 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:33,658 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 18:43:33,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:33,664 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:33,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:33,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:33,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:33,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:33,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:33,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:33,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:33,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:33,701 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:33,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:33,747 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:43:33,747 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:43:33,748 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 941 states and 2506 transitions. cyclomatic complexity: 1678 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 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:43:33,825 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 941 states and 2506 transitions. cyclomatic complexity: 1678. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 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 2414 states and 6389 transitions. Complement of second has 6 states. [2025-04-26 18:43:33,826 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:43:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 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:43:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-26 18:43:33,826 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:43:33,827 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:33,827 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:43:33,827 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:33,827 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 18:43:33,827 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:33,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2414 states and 6389 transitions. [2025-04-26 18:43:33,843 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 60 [2025-04-26 18:43:33,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2414 states to 1286 states and 3367 transitions. [2025-04-26 18:43:33,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2025-04-26 18:43:33,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2025-04-26 18:43:33,853 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1286 states and 3367 transitions. [2025-04-26 18:43:33,853 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:33,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1286 states and 3367 transitions. [2025-04-26 18:43:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states and 3367 transitions. [2025-04-26 18:43:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1202. [2025-04-26 18:43:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1202 states have (on average 2.672212978369384) internal successors, (in total 3212), 1201 states have internal predecessors, (3212), 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:43:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 3212 transitions. [2025-04-26 18:43:33,882 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1202 states and 3212 transitions. [2025-04-26 18:43:33,882 INFO L438 stractBuchiCegarLoop]: Abstraction has 1202 states and 3212 transitions. [2025-04-26 18:43:33,882 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:43:33,882 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1202 states and 3212 transitions. [2025-04-26 18:43:33,887 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 60 [2025-04-26 18:43:33,887 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:33,887 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:33,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:33,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:33,888 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[65] L25-->L27: 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[]" "[86] L12-->L34: 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]" "[67] L27-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[89] L13-->L43: 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]" "[64] L25-->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[]" "[92] L14-->L53: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 18:43:33,888 INFO L754 eck$LassoCheckResult]: Loop: "[78] L53-->L55: Formula: (< v_x4_3 v_z_7) InVars {x4=v_x4_3, z=v_z_7} OutVars{x4=v_x4_3, z=v_z_7} AuxVars[] AssignedVars[]" "[80] L55-->L53: Formula: (= v_x4_4 (+ v_x4_5 1)) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 18:43:33,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash 38605753, now seen corresponding path program 1 times [2025-04-26 18:43:33,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:33,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714457187] [2025-04-26 18:43:33,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:33,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:33,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:33,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:33,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:33,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:33,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:33,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:33,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-04-26 18:43:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:33,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709586999] [2025-04-26 18:43:33,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:33,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:33,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:33,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:33,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:33,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:33,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:33,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1554574533, now seen corresponding path program 1 times [2025-04-26 18:43:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:33,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208474292] [2025-04-26 18:43:33,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:33,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:33,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:33,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:33,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:33,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:33,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:33,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:33,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:33,942 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:33,942 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:33,942 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:33,942 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:33,942 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:33,942 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,942 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:33,942 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:33,942 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:43:33,942 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:33,943 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:33,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:33,966 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:33,966 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:33,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,968 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:33,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:43:33,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:33,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:33,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:33,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:33,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:33,989 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:33,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:43:33,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:33,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:34,058 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:34,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:43:34,063 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:34,063 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:34,063 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:34,063 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:34,063 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:34,063 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:34,063 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:34,064 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:34,064 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:43:34,064 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:34,064 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:34,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:34,079 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:34,080 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:34,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:34,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:34,082 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:34,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:43:34,084 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:43:34,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:34,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:34,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:34,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:34,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:34,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:34,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:34,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:34,098 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:34,099 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:43:34,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:34,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:34,101 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:34,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:43:34,103 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:34,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:34,106 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:34,106 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:34,106 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:43:34,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:43:34,112 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:34,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:34,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:34,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:34,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:34,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:34,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:34,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:34,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:34,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:34,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:34,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:34,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:34,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:34,170 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:43:34,170 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:43:34,170 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1202 states and 3212 transitions. cyclomatic complexity: 2149 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:43:34,250 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1202 states and 3212 transitions. cyclomatic complexity: 2149. 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 3625 states and 9763 transitions. Complement of second has 6 states. [2025-04-26 18:43:34,250 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:43:34,251 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:43:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-04-26 18:43:34,251 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:43:34,251 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:34,251 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:43:34,251 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:34,251 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:43:34,251 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:34,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3625 states and 9763 transitions. [2025-04-26 18:43:34,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:43:34,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3625 states to 0 states and 0 transitions. [2025-04-26 18:43:34,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:43:34,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:43:34,301 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:43:34,301 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:43:34,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:34,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:34,301 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:34,301 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:43:34,301 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:43:34,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:43:34,301 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:43:34,312 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:43:34,314 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:43:34 BoogieIcfgContainer [2025-04-26 18:43:34,314 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:43:34,314 INFO L158 Benchmark]: Toolchain (without parser) took 2764.98ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.0MB in the beginning and 102.5MB in the end (delta: -16.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:34,315 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.88ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:34,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.38ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:34,315 INFO L158 Benchmark]: Boogie Preprocessor took 24.66ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:43:34,315 INFO L158 Benchmark]: RCFGBuilder took 156.21ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:43:34,315 INFO L158 Benchmark]: BuchiAutomizer took 2541.01ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.0MB in the beginning and 102.5MB in the end (delta: -28.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:34,316 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.88ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.38ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.66ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 156.21ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2541.01ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.0MB in the beginning and 102.5MB in the end (delta: -28.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 389 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 82 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 57ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 297, Number of transitions in reduction automaton: 1288, Number of states in reduction automaton: 516, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:43:34,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...