/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/4thr_2groups.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:57:07,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:57:07,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:57:07,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:57:07,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:57:07,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:57:07,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:57:07,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:57:07,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:57:07,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:57:07,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:57:07,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:57:07,440 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:57:07,441 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:57:07,442 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:57:07,442 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:57:07,442 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:57:07,442 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:57:07,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:57:07,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:57:07,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:57:07,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:57:07,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:07,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:57:07,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:57:07,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:57:07,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:57:07,444 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:57:07,444 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:57:07,444 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:57:07,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:57:07,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:57:07,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:57:07,670 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:57:07,671 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:57:07,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/4thr_2groups.c.bpl [2025-04-26 16:57:07,672 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/4thr_2groups.c.bpl' [2025-04-26 16:57:07,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:57:07,687 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:57:07,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:07,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:57:07,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:57:07,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,714 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:57:07,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:07,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:57:07,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:57:07,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:57:07,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:57:07,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:57:07,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:57:07,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:57:07,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:07,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:07,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:07,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:57:07,787 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:57:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:57:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:57:07,787 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:57:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:57:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:57:07,787 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:57:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:57:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:57:07,788 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:57:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:57:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:57:07,788 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:57:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:57:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:57:07,788 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:57:07,827 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:57:07,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:57:07,916 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:57:07,916 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:57:07,924 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:57:07,924 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:57:07,925 INFO L201 PluginConnector]: Adding new model 4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:07 BoogieIcfgContainer [2025-04-26 16:57:07,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:57:07,926 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:57:07,926 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:57:07,930 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:57:07,931 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:07,931 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/2) ... [2025-04-26 16:57:07,932 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7be0e0 and model type 4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:57:07, skipping insertion in model container [2025-04-26 16:57:07,932 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:07,932 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:07" (2/2) ... [2025-04-26 16:57:07,933 INFO L376 chiAutomizerObserver]: Analyzing ICFG 4thr_2groups.c.bpl [2025-04-26 16:57:07,989 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:57:08,022 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:57:08,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:57:08,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:08,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:08,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:57:08,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 98 flow [2025-04-26 16:57:08,091 INFO L116 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-04-26 16:57:08,092 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:57:08,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 27 events. 4/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 16:57:08,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 98 flow [2025-04-26 16:57:08,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 27 transitions, 78 flow [2025-04-26 16:57:08,100 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 27 transitions, 78 flow [2025-04-26 16:57:08,105 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:57:08,375 WARN L140 AmpleReduction]: Number of pruned transitions: 892 [2025-04-26 16:57:08,375 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:57:08,375 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 164 [2025-04-26 16:57:08,375 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 16:57:08,375 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:347 [2025-04-26 16:57:08,375 WARN L145 AmpleReduction]: Times succ was already a loop node:199 [2025-04-26 16:57:08,375 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:149 [2025-04-26 16:57:08,375 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:57:08,378 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 539 states, 538 states have (on average 2.1356877323420074) internal successors, (in total 1149), 538 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:08,385 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:57:08,385 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:57:08,385 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:57:08,385 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:57:08,386 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:57:08,386 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:57:08,386 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:57:08,386 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:57:08,388 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 539 states, 538 states have (on average 2.1356877323420074) internal successors, (in total 1149), 538 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:08,424 INFO L131 ngComponentsAnalysis]: Automaton has 107 accepting balls. 464 [2025-04-26 16:57:08,424 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:08,424 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:08,427 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:57:08,427 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:08,427 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:57:08,429 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 539 states, 538 states have (on average 2.1356877323420074) internal successors, (in total 1149), 538 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:08,439 INFO L131 ngComponentsAnalysis]: Automaton has 107 accepting balls. 464 [2025-04-26 16:57:08,439 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:08,439 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:08,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:57:08,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:08,444 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:57:08,444 INFO L754 eck$LassoCheckResult]: Loop: "[67] 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[]" "[69] 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 16:57:08,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash 117, now seen corresponding path program 1 times [2025-04-26 16:57:08,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:08,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038637551] [2025-04-26 16:57:08,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:08,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:08,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:08,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:08,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:08,497 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:08,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:08,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:08,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:08,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:08,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:08,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash 3107, now seen corresponding path program 1 times [2025-04-26 16:57:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:08,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436753412] [2025-04-26 16:57:08,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:08,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:08,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:08,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:08,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:08,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:08,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:08,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:08,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:08,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:08,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:08,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash 114583, now seen corresponding path program 1 times [2025-04-26 16:57:08,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:08,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694477760] [2025-04-26 16:57:08,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:08,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:08,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:08,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:08,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:08,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:08,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:08,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:08,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:08,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:08,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:08,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:08,569 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:08,569 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:08,569 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:08,569 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:08,569 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:08,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:08,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:08,570 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:08,570 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:08,570 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:08,570 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:08,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:08,638 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:08,643 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:08,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:08,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:08,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:08,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:57:08,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:08,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:08,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:08,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:08,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:08,716 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:08,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:57:08,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:08,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:08,795 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:08,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:57:08,799 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:08,799 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:08,799 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:08,799 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:08,799 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:08,799 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:08,799 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:08,799 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:08,799 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:08,799 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:08,799 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:08,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:08,819 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:08,822 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:08,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:08,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:08,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:08,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:57:08,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:08,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:08,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:08,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:08,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:08,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:08,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:08,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:08,846 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:08,851 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:08,851 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:08,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:08,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:08,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:08,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:57:08,857 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:08,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:57:08,861 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:08,861 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:08,862 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:57:08,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:08,871 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:08,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:08,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:08,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:08,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:08,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:08,902 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:08,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:08,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:08,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:08,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:08,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:08,910 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:08,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:08,945 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:08,947 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 539 states, 538 states have (on average 2.1356877323420074) internal successors, (in total 1149), 538 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:09,082 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 539 states, 538 states have (on average 2.1356877323420074) internal successors, (in total 1149), 538 states have internal predecessors, (1149), 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 1293 states and 2891 transitions. Complement of second has 6 states. [2025-04-26 16:57:09,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 16:57:09,091 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:57:09,092 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:09,092 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:57:09,092 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:09,092 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:57:09,092 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:09,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1293 states and 2891 transitions. [2025-04-26 16:57:09,106 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 346 [2025-04-26 16:57:09,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1293 states to 724 states and 1605 transitions. [2025-04-26 16:57:09,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2025-04-26 16:57:09,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 524 [2025-04-26 16:57:09,120 INFO L74 IsDeterministic]: Start isDeterministic. Operand 724 states and 1605 transitions. [2025-04-26 16:57:09,120 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:09,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 724 states and 1605 transitions. [2025-04-26 16:57:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states and 1605 transitions. [2025-04-26 16:57:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 619. [2025-04-26 16:57:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 619 states have (on average 2.2810985460420032) internal successors, (in total 1412), 618 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1412 transitions. [2025-04-26 16:57:09,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 619 states and 1412 transitions. [2025-04-26 16:57:09,172 INFO L438 stractBuchiCegarLoop]: Abstraction has 619 states and 1412 transitions. [2025-04-26 16:57:09,172 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:57:09,173 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 619 states and 1412 transitions. [2025-04-26 16:57:09,175 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 346 [2025-04-26 16:57:09,175 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:09,175 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:09,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:57:09,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:57:09,176 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] 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 16:57:09,176 INFO L754 eck$LassoCheckResult]: Loop: "[71] 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[]" "[73] L36-->L37: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[74] L37-->L34: Formula: (= v_x1_5 (+ v_x1_6 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 16:57:09,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash 3716, now seen corresponding path program 1 times [2025-04-26 16:57:09,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:09,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033143432] [2025-04-26 16:57:09,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:09,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:09,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:09,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash 100359, now seen corresponding path program 1 times [2025-04-26 16:57:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:09,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272244649] [2025-04-26 16:57:09,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:09,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:09,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:09,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:09,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:09,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:09,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:09,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:09,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 110773924, now seen corresponding path program 1 times [2025-04-26 16:57:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:09,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481404955] [2025-04-26 16:57:09,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:09,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:09,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:09,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,200 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:09,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:09,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:09,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:09,230 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:09,230 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:09,230 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:09,230 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:09,230 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:09,230 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,230 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:09,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:09,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:09,231 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:09,231 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:09,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:09,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:09,263 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:09,263 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:09,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,267 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:09,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:57:09,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:09,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:09,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:09,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:09,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:57:09,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:09,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:09,353 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:09,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:09,358 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:09,358 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:09,358 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:09,358 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:09,358 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:09,359 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,359 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:09,359 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:09,359 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:09,359 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:09,359 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:09,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:09,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:09,386 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:09,387 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:09,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:09,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:57:09,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:09,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:09,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:09,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:09,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:09,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:09,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:09,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:09,405 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:09,408 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:09,408 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:09,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:09,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:57:09,412 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:09,415 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:57:09,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:57:09,416 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:09,416 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:09,416 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:57:09,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:09,424 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:09,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:09,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:09,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:09,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:09,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:09,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:09,452 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:09,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:09,494 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 16:57:09,494 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 619 states and 1412 transitions. cyclomatic complexity: 902 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:09,557 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 619 states and 1412 transitions. cyclomatic complexity: 902. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1518 states and 3500 transitions. Complement of second has 6 states. [2025-04-26 16:57:09,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-04-26 16:57:09,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:57:09,558 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:09,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:57:09,559 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:09,559 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:57:09,559 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:09,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1518 states and 3500 transitions. [2025-04-26 16:57:09,570 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 101 [2025-04-26 16:57:09,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1518 states to 976 states and 2238 transitions. [2025-04-26 16:57:09,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2025-04-26 16:57:09,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2025-04-26 16:57:09,578 INFO L74 IsDeterministic]: Start isDeterministic. Operand 976 states and 2238 transitions. [2025-04-26 16:57:09,578 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:09,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 976 states and 2238 transitions. [2025-04-26 16:57:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states and 2238 transitions. [2025-04-26 16:57:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 865. [2025-04-26 16:57:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 865 states have (on average 2.3710982658959536) internal successors, (in total 2051), 864 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 2051 transitions. [2025-04-26 16:57:09,598 INFO L240 hiAutomatonCegarLoop]: Abstraction has 865 states and 2051 transitions. [2025-04-26 16:57:09,598 INFO L438 stractBuchiCegarLoop]: Abstraction has 865 states and 2051 transitions. [2025-04-26 16:57:09,598 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:57:09,598 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 865 states and 2051 transitions. [2025-04-26 16:57:09,601 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 101 [2025-04-26 16:57:09,602 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:09,602 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:09,602 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:09,602 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:09,602 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[66] 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[]" "[68] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[89] 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]" "[70] 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[]" "[72] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[92] L13-->L44: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:57:09,602 INFO L754 eck$LassoCheckResult]: Loop: "[76] L44-->L46: 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[]" "[78] L46-->L44: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:57:09,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1581207336, now seen corresponding path program 1 times [2025-04-26 16:57:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:09,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650479927] [2025-04-26 16:57:09,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:09,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:09,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:09,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:09,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:09,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:09,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:09,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:09,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,610 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 16:57:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:09,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422324079] [2025-04-26 16:57:09,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:09,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:09,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:09,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:09,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash 878175322, now seen corresponding path program 1 times [2025-04-26 16:57:09,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:09,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12710887] [2025-04-26 16:57:09,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:09,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:09,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:09,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:09,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:09,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:09,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:09,636 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:09,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:09,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:09,637 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:09,637 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:09,637 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,637 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:09,637 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:09,637 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:09,637 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:09,637 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:09,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:09,654 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:09,655 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,657 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:09,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:57:09,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:09,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:09,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:57:09,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,680 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:09,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:57:09,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:09,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:09,745 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:09,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:09,750 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:09,750 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:09,750 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:09,750 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:09,750 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:09,750 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,750 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:09,750 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:09,750 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:09,750 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:09,750 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:09,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:09,765 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:09,766 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:09,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,767 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:09,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:57:09,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:09,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:09,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:09,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:09,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:09,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:09,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:09,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:09,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:09,785 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:09,785 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:09,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,787 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:09,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:57:09,790 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:09,792 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:57:09,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:09,793 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:09,793 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:09,793 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:57:09,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:09,800 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:09,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:09,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:09,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:09,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:09,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:09,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:09,854 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:09,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:09,867 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:09,867 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 865 states and 2051 transitions. cyclomatic complexity: 1298 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:09,945 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 865 states and 2051 transitions. cyclomatic complexity: 1298. 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 2708 states and 6230 transitions. Complement of second has 6 states. [2025-04-26 16:57:09,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-26 16:57:09,946 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:57:09,946 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:09,946 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:57:09,946 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:09,946 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:57:09,946 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:09,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2708 states and 6230 transitions. [2025-04-26 16:57:09,963 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 57 [2025-04-26 16:57:09,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2708 states to 1414 states and 3259 transitions. [2025-04-26 16:57:09,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2025-04-26 16:57:09,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2025-04-26 16:57:09,973 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1414 states and 3259 transitions. [2025-04-26 16:57:09,973 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:09,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1414 states and 3259 transitions. [2025-04-26 16:57:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states and 3259 transitions. [2025-04-26 16:57:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1350. [2025-04-26 16:57:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1350 states have (on average 2.311851851851852) internal successors, (in total 3121), 1349 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 3121 transitions. [2025-04-26 16:57:09,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1350 states and 3121 transitions. [2025-04-26 16:57:09,996 INFO L438 stractBuchiCegarLoop]: Abstraction has 1350 states and 3121 transitions. [2025-04-26 16:57:09,996 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:57:09,996 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1350 states and 3121 transitions. [2025-04-26 16:57:10,001 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 57 [2025-04-26 16:57:10,001 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:10,001 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:10,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:10,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:57:10,002 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[66] 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[]" "[68] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[89] 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]" "[70] 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[]" "[72] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[92] L13-->L44: 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]" "[95] 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 16:57:10,002 INFO L754 eck$LassoCheckResult]: Loop: "[80] L53-->L55: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[82] L55-->L56: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[83] L56-->L53: Formula: (= (+ v_x3_6 1) v_x3_5) InVars {x3=v_x3_6} OutVars{x3=v_x3_5} AuxVars[] AssignedVars[x3]" [2025-04-26 16:57:10,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1772787065, now seen corresponding path program 1 times [2025-04-26 16:57:10,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:10,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705765559] [2025-04-26 16:57:10,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:10,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:57:10,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:57:10,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:57:10,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:57:10,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:10,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash 109296, now seen corresponding path program 1 times [2025-04-26 16:57:10,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:10,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387018337] [2025-04-26 16:57:10,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:10,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:10,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:10,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:10,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:10,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:10,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:10,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2113465002, now seen corresponding path program 1 times [2025-04-26 16:57:10,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:10,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091440586] [2025-04-26 16:57:10,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:10,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:10,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:10,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:10,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:10,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:10,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:10,041 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:10,041 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:10,041 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:10,041 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:10,041 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:10,041 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:10,041 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:10,041 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:10,041 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:10,041 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:10,041 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:10,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:10,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:10,065 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:10,065 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:10,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:10,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:10,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:10,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:57:10,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:10,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:10,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:57:10,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:10,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:10,086 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:10,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:57:10,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:10,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:10,151 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:10,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:57:10,155 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:10,156 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:10,156 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:10,156 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:10,156 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:10,156 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:10,156 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:10,156 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:10,156 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:10,156 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:10,156 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:10,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:10,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:10,187 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:10,187 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:10,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:10,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:10,190 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:10,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:57:10,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:10,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:10,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:10,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:10,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:10,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:10,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:10,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:10,206 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:10,210 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:10,210 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:10,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:10,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:10,212 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:10,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:57:10,215 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:10,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:10,218 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:10,218 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:10,218 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:57:10,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:57:10,224 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:10,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:10,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:57:10,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:57:10,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:10,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:10,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:10,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:10,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:10,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:10,255 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:10,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:10,285 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 16:57:10,285 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1350 states and 3121 transitions. cyclomatic complexity: 1882 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:10,350 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1350 states and 3121 transitions. cyclomatic complexity: 1882. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3205 states and 7245 transitions. Complement of second has 6 states. [2025-04-26 16:57:10,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-26 16:57:10,351 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:57:10,351 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:10,351 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:57:10,351 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:10,351 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 8 letters. Loop has 6 letters. [2025-04-26 16:57:10,351 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:10,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3205 states and 7245 transitions. [2025-04-26 16:57:10,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:10,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3205 states to 0 states and 0 transitions. [2025-04-26 16:57:10,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:57:10,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:57:10,371 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:57:10,371 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:57:10,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:10,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:10,371 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:10,371 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:57:10,371 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:57:10,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:10,372 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:57:10,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:10,385 INFO L201 PluginConnector]: Adding new model 4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:57:10 BoogieIcfgContainer [2025-04-26 16:57:10,386 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:57:10,386 INFO L158 Benchmark]: Toolchain (without parser) took 2699.42ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 83.9MB in the beginning and 34.0MB in the end (delta: 49.8MB). Peak memory consumption was 50.0MB. Max. memory is 8.0GB. [2025-04-26 16:57:10,386 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 84.6MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:10,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.06ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:57:10,387 INFO L158 Benchmark]: Boogie Preprocessor took 22.64ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 81.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:10,387 INFO L158 Benchmark]: RCFGBuilder took 186.77ms. Allocated memory is still 159.4MB. Free memory was 81.0MB in the beginning and 71.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:57:10,387 INFO L158 Benchmark]: BuchiAutomizer took 2459.91ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.8MB in the beginning and 34.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.4MB. Max. memory is 8.0GB. [2025-04-26 16:57:10,388 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.14ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 84.6MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.06ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.64ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 81.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 186.77ms. Allocated memory is still 159.4MB. Free memory was 81.0MB in the beginning and 71.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2459.91ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.8MB in the beginning and 34.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 280 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 84 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp85 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 38ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 356, Number of transitions in reduction automaton: 1149, Number of states in reduction automaton: 539, 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 16:57:10,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...