/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 ../../../trunk/examples/concurrent/bpl/POPL2023/sum2_diff_incr_decr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:36,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:36,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:36,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:36,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:36,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:36,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:36,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:36,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:36,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:36,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:36,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:36,549 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:36,550 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:36,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:36,550 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:36,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:36,551 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:36,551 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:36,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:36,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:36,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:36,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:36,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:36,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:36,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:36,551 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:36,551 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:36,551 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:36,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:36,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:36,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:36,806 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:36,806 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:36,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum2_diff_incr_decr.bpl [2025-04-26 18:39:36,807 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum2_diff_incr_decr.bpl' [2025-04-26 18:39:36,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:36,826 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:36,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:36,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:36,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:36,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,860 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:36,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:36,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:36,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:36,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:36,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:36,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:36,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:36,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:36,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/1) ... [2025-04-26 18:39:36,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:36,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:36,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:36,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:39:36,925 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:36,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:36,926 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T1 given in one single declaration [2025-04-26 18:39:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure T1 [2025-04-26 18:39:36,926 INFO L138 BoogieDeclarations]: Found implementation of procedure T1 [2025-04-26 18:39:36,926 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T2 given in one single declaration [2025-04-26 18:39:36,926 INFO L130 BoogieDeclarations]: Found specification of procedure T2 [2025-04-26 18:39:36,926 INFO L138 BoogieDeclarations]: Found implementation of procedure T2 [2025-04-26 18:39:36,927 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:39:36,963 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:36,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:37,049 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:37,049 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:37,062 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:37,062 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:37,063 INFO L201 PluginConnector]: Adding new model sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:37 BoogieIcfgContainer [2025-04-26 18:39:37,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:37,064 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:37,064 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:37,068 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:37,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:37,069 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:36" (1/2) ... [2025-04-26 18:39:37,070 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c6a9d7 and model type sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:37, skipping insertion in model container [2025-04-26 18:39:37,071 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:37,071 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:37" (2/2) ... [2025-04-26 18:39:37,072 INFO L376 chiAutomizerObserver]: Analyzing ICFG sum2_diff_incr_decr.bpl [2025-04-26 18:39:37,125 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:37,157 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:37,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:37,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:37,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:39:37,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 18:39:37,230 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-26 18:39:37,231 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:37,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-26 18:39:37,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 18:39:37,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 58 flow [2025-04-26 18:39:37,241 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 28 places, 23 transitions, 58 flow [2025-04-26 18:39:37,241 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 23 transitions, 58 flow [2025-04-26 18:39:37,256 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 85 states, 83 states have (on average 1.9879518072289157) internal successors, (in total 165), 84 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:37,256 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 85 states, 83 states have (on average 1.9879518072289157) internal successors, (in total 165), 84 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:37,258 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:37,312 WARN L140 AmpleReduction]: Number of pruned transitions: 27 [2025-04-26 18:39:37,313 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:37,313 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 18:39:37,313 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 18:39:37,313 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:27 [2025-04-26 18:39:37,313 WARN L145 AmpleReduction]: Times succ was already a loop node:4 [2025-04-26 18:39:37,313 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:6 [2025-04-26 18:39:37,313 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:37,313 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 50 states, 48 states have (on average 1.2916666666666667) internal successors, (in total 62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:37,318 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:37,319 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:37,319 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:37,319 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:37,319 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:37,319 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:37,319 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:37,319 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:37,321 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 48 states have (on average 1.2916666666666667) internal successors, (in total 62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:37,329 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 31 [2025-04-26 18:39:37,329 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:37,329 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:37,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:37,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:37,332 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:37,332 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 48 states have (on average 1.2916666666666667) internal successors, (in total 62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:37,334 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 31 [2025-04-26 18:39:37,334 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:37,334 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:37,334 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:37,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:37,338 INFO L752 eck$LassoCheckResult]: Stem: "[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_T1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_16, T1Thread1of1ForFork0_thidvar0=v_T1Thread1of1ForFork0_thidvar0_2, T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_8} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i, T1Thread1of1ForFork0_thidvar0, T1Thread1of1ForFork0_sum]" "[56] $Ultimate##0-->L16: Formula: (= v_T1Thread1of1ForFork0_i_1 0) InVars {} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i]" "[57] L16-->L17-1: Formula: (= v_T1Thread1of1ForFork0_sum_1 0) InVars {} OutVars{T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_1} AuxVars[] AssignedVars[T1Thread1of1ForFork0_sum]" [2025-04-26 18:39:37,339 INFO L754 eck$LassoCheckResult]: Loop: "[59] L17-1-->L18: Formula: (< v_T1Thread1of1ForFork0_i_5 v_N_2) InVars {T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_5, N=v_N_2} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[61] L18-->L18-1: Formula: (and (= v_B_6 (store v_B_7 v_T1Thread1of1ForFork0_i_7 (+ (- 1) (select v_B_7 v_T1Thread1of1ForFork0_i_7)))) (= (store v_A_7 v_T1Thread1of1ForFork0_i_7 (+ (select v_A_7 v_T1Thread1of1ForFork0_i_7) 1)) v_A_6)) InVars {A=v_A_7, T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_7, B=v_B_7} OutVars{A=v_A_6, T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_7, B=v_B_6} AuxVars[] AssignedVars[A, B]" "[62] L18-1-->L23: Formula: (= v_T1Thread1of1ForFork0_sum_4 (+ (select v_B_3 v_T1Thread1of1ForFork0_i_9) (select v_A_3 v_T1Thread1of1ForFork0_i_9) v_T1Thread1of1ForFork0_sum_3)) InVars {A=v_A_3, T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_9, T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_3, B=v_B_3} OutVars{A=v_A_3, T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_9, T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_4, B=v_B_3} AuxVars[] AssignedVars[T1Thread1of1ForFork0_sum]" "[63] L23-->L17-1: Formula: (= (+ v_T1Thread1of1ForFork0_i_11 1) v_T1Thread1of1ForFork0_i_12) InVars {T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_11} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_12} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i]" [2025-04-26 18:39:37,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:37,342 INFO L85 PathProgramCache]: Analyzing trace with hash 102698, now seen corresponding path program 1 times [2025-04-26 18:39:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:37,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994290368] [2025-04-26 18:39:37,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:37,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:37,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:37,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:37,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:37,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:37,408 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:37,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:37,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:37,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:37,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:37,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:37,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:37,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2741796, now seen corresponding path program 1 times [2025-04-26 18:39:37,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:37,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834984078] [2025-04-26 18:39:37,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:37,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:37,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:37,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:37,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:37,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:37,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:37,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:37,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:37,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:37,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:37,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash 356297421, now seen corresponding path program 1 times [2025-04-26 18:39:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:37,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821200836] [2025-04-26 18:39:37,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:37,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:37,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:37,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:37,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:37,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:37,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:37,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:37,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:37,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:37,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:37,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:37,603 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:37,604 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:37,604 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:37,604 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:37,604 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:37,604 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:37,604 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:37,604 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:37,604 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum2_diff_incr_decr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:37,604 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:37,605 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:37,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:37,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:37,740 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:37,743 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:37,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:37,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:37,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:39:37,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:37,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:37,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:37,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:37,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:37,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:37,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:37,768 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:37,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:39:37,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:37,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:37,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:37,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:39:37,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:37,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:37,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:37,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:37,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:37,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:37,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:37,796 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:37,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:39:37,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:37,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:37,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:37,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:39:37,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:37,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:37,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:37,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:37,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:37,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:37,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:37,828 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:37,837 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:37,837 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:37,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:37,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:37,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:37,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:39:37,844 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:37,860 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 18:39:37,860 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:37,861 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:37,861 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(T1Thread1of1ForFork0_i, N) = -1*T1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2025-04-26 18:39:37,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:39:37,869 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:37,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:37,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:37,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:37,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:37,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:37,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:37,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:37,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:37,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:37,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:37,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:37,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:37,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:37,948 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:37,950 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 50 states, 48 states have (on average 1.2916666666666667) internal successors, (in total 62), 49 states have internal predecessors, (62), 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 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:38,019 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 50 states, 48 states have (on average 1.2916666666666667) internal successors, (in total 62), 49 states have internal predecessors, (62), 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 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 102 states and 132 transitions. Complement of second has 6 states. [2025-04-26 18:39:38,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-26 18:39:38,031 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:39:38,031 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:38,032 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:39:38,032 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:38,032 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 18:39:38,032 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:38,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 132 transitions. [2025-04-26 18:39:38,038 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-04-26 18:39:38,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 42 states and 52 transitions. [2025-04-26 18:39:38,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 18:39:38,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-04-26 18:39:38,043 INFO L74 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2025-04-26 18:39:38,043 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:38,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2025-04-26 18:39:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2025-04-26 18:39:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-04-26 18:39:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.25) internal successors, (in total 50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-04-26 18:39:38,065 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-04-26 18:39:38,065 INFO L438 stractBuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-04-26 18:39:38,065 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:38,065 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2025-04-26 18:39:38,066 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-04-26 18:39:38,066 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:38,066 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:38,066 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:38,066 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:38,066 INFO L752 eck$LassoCheckResult]: Stem: "[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_T1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_16, T1Thread1of1ForFork0_thidvar0=v_T1Thread1of1ForFork0_thidvar0_2, T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_8} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i, T1Thread1of1ForFork0_thidvar0, T1Thread1of1ForFork0_sum]" "[56] $Ultimate##0-->L16: Formula: (= v_T1Thread1of1ForFork0_i_1 0) InVars {} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i]" "[57] L16-->L17-1: Formula: (= v_T1Thread1of1ForFork0_sum_1 0) InVars {} OutVars{T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_1} AuxVars[] AssignedVars[T1Thread1of1ForFork0_sum]" "[59] L17-1-->L18: Formula: (< v_T1Thread1of1ForFork0_i_5 v_N_2) InVars {T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_5, N=v_N_2} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[77] L46-->$Ultimate##0: Formula: (and (= v_T2Thread1of1ForFork1_thidvar1_2 2) (= v_T2Thread1of1ForFork1_thidvar0_2 2)) InVars {} OutVars{T2Thread1of1ForFork1_sum=v_T2Thread1of1ForFork1_sum_8, T2Thread1of1ForFork1_thidvar0=v_T2Thread1of1ForFork1_thidvar0_2, T2Thread1of1ForFork1_thidvar1=v_T2Thread1of1ForFork1_thidvar1_2, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_16} AuxVars[] AssignedVars[T2Thread1of1ForFork1_sum, T2Thread1of1ForFork1_thidvar0, T2Thread1of1ForFork1_thidvar1, T2Thread1of1ForFork1_j]" "[64] $Ultimate##0-->L33: Formula: (= v_T2Thread1of1ForFork1_j_1 0) InVars {} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[T2Thread1of1ForFork1_j]" "[65] L33-->L34-1: Formula: (= v_T2Thread1of1ForFork1_sum_1 0) InVars {} OutVars{T2Thread1of1ForFork1_sum=v_T2Thread1of1ForFork1_sum_1} AuxVars[] AssignedVars[T2Thread1of1ForFork1_sum]" [2025-04-26 18:39:38,066 INFO L754 eck$LassoCheckResult]: Loop: "[67] L34-1-->L35: Formula: (< v_T2Thread1of1ForFork1_j_5 v_N_3) InVars {T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_5, N=v_N_3} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_5, N=v_N_3} AuxVars[] AssignedVars[]" "[69] L35-->L36: Formula: (= (+ (select v_A_4 v_T2Thread1of1ForFork1_j_7) v_T2Thread1of1ForFork1_sum_3 (select v_B_4 v_T2Thread1of1ForFork1_j_7)) v_T2Thread1of1ForFork1_sum_4) InVars {A=v_A_4, T2Thread1of1ForFork1_sum=v_T2Thread1of1ForFork1_sum_3, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_7, B=v_B_4} OutVars{A=v_A_4, T2Thread1of1ForFork1_sum=v_T2Thread1of1ForFork1_sum_4, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_7, B=v_B_4} AuxVars[] AssignedVars[T2Thread1of1ForFork1_sum]" "[70] L36-->L37: Formula: (= (store v_D_2 v_T2Thread1of1ForFork1_j_9 (+ (select v_A_5 v_T2Thread1of1ForFork1_j_9) (* (- 1) (select v_B_5 v_T2Thread1of1ForFork1_j_9)))) v_D_1) InVars {A=v_A_5, D=v_D_2, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_9, B=v_B_5} OutVars{A=v_A_5, D=v_D_1, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_9, B=v_B_5} AuxVars[] AssignedVars[D]" "[71] L37-->L34-1: Formula: (= v_T2Thread1of1ForFork1_j_12 (+ v_T2Thread1of1ForFork1_j_11 1)) InVars {T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_11} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_12} AuxVars[] AssignedVars[T2Thread1of1ForFork1_j]" [2025-04-26 18:39:38,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash 356312861, now seen corresponding path program 1 times [2025-04-26 18:39:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:38,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769968103] [2025-04-26 18:39:38,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:38,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:38,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:38,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:38,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:38,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:38,078 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:38,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:38,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:38,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:38,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:38,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:38,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2988068, now seen corresponding path program 1 times [2025-04-26 18:39:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:38,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235680113] [2025-04-26 18:39:38,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:38,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:38,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:38,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:38,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:38,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:38,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:38,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:38,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:38,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:38,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:38,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:38,100 INFO L85 PathProgramCache]: Analyzing trace with hash -802582208, now seen corresponding path program 1 times [2025-04-26 18:39:38,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:38,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173492952] [2025-04-26 18:39:38,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:38,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:38,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:38,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:38,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:38,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:38,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:38,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:38,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:38,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:38,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:38,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:38,211 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:38,211 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:38,211 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:38,211 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:38,211 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:38,211 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:38,211 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:38,211 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:38,211 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum2_diff_incr_decr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:39:38,211 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:38,211 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:38,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:38,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:38,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:38,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:38,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:38,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:38,308 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:38,308 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:38,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:38,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:38,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:38,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:39:38,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:38,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:38,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:38,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:38,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:38,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:38,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:38,331 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:38,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:39:38,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:38,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:38,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:38,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:39:38,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:38,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:38,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:38,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:38,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:38,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:38,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:38,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:38,354 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:38,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:39:38,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:38,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:38,361 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:38,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:39:38,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:38,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:38,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:38,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:38,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:38,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:38,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:38,387 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:38,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:39:38,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:38,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:38,395 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:38,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:39:38,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:38,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:38,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:38,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:38,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:38,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:38,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:38,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:38,427 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:39:38,427 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:38,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:38,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:38,429 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:38,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:39:38,431 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:38,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:38,483 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:38,483 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:38,483 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(T2Thread1of1ForFork1_j, N) = -1*T2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2025-04-26 18:39:38,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:38,490 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:38,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:38,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:38,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:38,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:38,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:38,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:38,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:38,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:38,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:38,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:38,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:38,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:38,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:38,552 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:38,552 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 50 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:38,588 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 50 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 63 states and 80 transitions. Complement of second has 4 states. [2025-04-26 18:39:38,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2025-04-26 18:39:38,589 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:39:38,590 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:38,590 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:39:38,590 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:38,590 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 7 letters. Loop has 8 letters. [2025-04-26 18:39:38,590 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:38,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 80 transitions. [2025-04-26 18:39:38,591 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:38,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2025-04-26 18:39:38,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:38,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:38,591 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:38,591 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:38,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:38,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:38,591 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:38,591 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:38,591 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:38,591 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:38,591 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:38,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:39:38,604 INFO L201 PluginConnector]: Adding new model sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:38 BoogieIcfgContainer [2025-04-26 18:39:38,604 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:38,605 INFO L158 Benchmark]: Toolchain (without parser) took 1778.57ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.7MB in the beginning and 51.8MB in the end (delta: 34.8MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. [2025-04-26 18:39:38,605 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:38,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.20ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:38,606 INFO L158 Benchmark]: Boogie Preprocessor took 18.99ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.8MB in the end (delta: 925.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:38,606 INFO L158 Benchmark]: RCFGBuilder took 181.60ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 74.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:38,607 INFO L158 Benchmark]: BuchiAutomizer took 1539.88ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.5MB in the beginning and 51.8MB in the end (delta: 22.7MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:38,608 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.17ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.20ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 84.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.99ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.8MB in the end (delta: 925.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 181.60ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 74.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1539.88ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.5MB in the beginning and 51.8MB in the end (delta: 22.7MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 24 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital55 mio100 ax100 hnf100 lsp84 ukn48 mio100 lsp72 div100 bol100 ite100 ukn100 eq163 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 159, Number of transitions in reduction automaton: 62, Number of states in reduction automaton: 50, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:38,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...