/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/sumsumsampleabs2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:11,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:11,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:11,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:11,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:11,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:11,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:11,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:11,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:11,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:11,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:11,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:11,222 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:11,222 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:11,222 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:11,222 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:11,222 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:11,222 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:11,222 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:11,222 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:11,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:11,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:11,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:11,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:11,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:11,224 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:11,224 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:11,224 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:11,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:11,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:11,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:11,472 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:11,472 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:11,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl [2025-04-26 16:54:11,473 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl' [2025-04-26 16:54:11,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:11,491 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:11,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:11,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:11,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:11,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,524 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:11,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:11,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:11,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:11,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:11,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,536 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:11,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:11,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:11,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:11,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/1) ... [2025-04-26 16:54:11,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:11,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:11,579 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:54:11,583 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:54:11,599 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2025-04-26 16:54:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2025-04-26 16:54:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2025-04-26 16:54:11,600 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2025-04-26 16:54:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2025-04-26 16:54:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2025-04-26 16:54:11,600 INFO L124 BoogieDeclarations]: Specification and implementation of procedure bank given in one single declaration [2025-04-26 16:54:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure bank [2025-04-26 16:54:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure bank [2025-04-26 16:54:11,600 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:11,600 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2025-04-26 16:54:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2025-04-26 16:54:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2025-04-26 16:54:11,601 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:54:11,639 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:11,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:11,741 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:11,742 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:11,752 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:11,752 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:54:11,752 INFO L201 PluginConnector]: Adding new model sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:11 BoogieIcfgContainer [2025-04-26 16:54:11,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:11,753 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:11,753 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:11,760 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:11,761 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:11,761 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:11" (1/2) ... [2025-04-26 16:54:11,762 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50490883 and model type sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:11, skipping insertion in model container [2025-04-26 16:54:11,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:11,763 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:11" (2/2) ... [2025-04-26 16:54:11,764 INFO L376 chiAutomizerObserver]: Analyzing ICFG sumsumsampleabs2.bpl [2025-04-26 16:54:11,821 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:54:11,860 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:11,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:11,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:11,864 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:54:11,866 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:54:11,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 102 flow [2025-04-26 16:54:11,949 INFO L116 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-04-26 16:54:11,951 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:54:11,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 32 events. 3/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-26 16:54:11,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 102 flow [2025-04-26 16:54:11,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 82 flow [2025-04-26 16:54:11,967 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 42 places, 32 transitions, 82 flow [2025-04-26 16:54:11,978 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:12,403 WARN L140 AmpleReduction]: Number of pruned transitions: 1522 [2025-04-26 16:54:12,403 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:54:12,404 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 202 [2025-04-26 16:54:12,404 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:30 [2025-04-26 16:54:12,404 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:615 [2025-04-26 16:54:12,404 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 16:54:12,404 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:322 [2025-04-26 16:54:12,404 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:12,409 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 848 states, 846 states have (on average 1.9148936170212767) internal successors, (in total 1620), 847 states have internal predecessors, (1620), 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:54:12,415 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:12,415 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:12,415 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:12,415 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:12,415 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:12,416 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:12,416 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:12,416 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:12,419 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 848 states, 846 states have (on average 1.9148936170212767) internal successors, (in total 1620), 847 states have internal predecessors, (1620), 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:54:12,458 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 637 [2025-04-26 16:54:12,458 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:12,458 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:12,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:54:12,465 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:12,465 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:12,467 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 848 states, 846 states have (on average 1.9148936170212767) internal successors, (in total 1620), 847 states have internal predecessors, (1620), 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:54:12,480 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 637 [2025-04-26 16:54:12,480 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:12,480 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:12,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:54:12,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:12,485 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0]" "[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x]" "[76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1]" [2025-04-26 16:54:12,485 INFO L754 eck$LassoCheckResult]: Loop: "[79] L23-1-->L24: Formula: (< v_i1_2 v_N_1) InVars {i1=v_i1_2, N=v_N_1} OutVars{i1=v_i1_2, N=v_N_1} AuxVars[] AssignedVars[]" "[81] L24-->L25: Formula: (= (+ v_sum1_3 (let ((.cse0 (select v_A_1 v_i1_3))) (ite (< .cse0 0) (- .cse0) .cse0))) v_sum1_2) InVars {sum1=v_sum1_3, A=v_A_1, i1=v_i1_3} OutVars{sum1=v_sum1_2, A=v_A_1, i1=v_i1_3} AuxVars[] AssignedVars[sum1]" "[82] L25-->L23-1: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1]" [2025-04-26 16:54:12,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:12,489 INFO L85 PathProgramCache]: Analyzing trace with hash 4034789, now seen corresponding path program 1 times [2025-04-26 16:54:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:12,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122000476] [2025-04-26 16:54:12,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:12,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:12,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:12,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:12,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:12,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:12,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:12,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash 108303, now seen corresponding path program 1 times [2025-04-26 16:54:12,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:12,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335044999] [2025-04-26 16:54:12,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:12,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:12,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:12,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:12,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:12,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:12,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:12,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash -58606677, now seen corresponding path program 1 times [2025-04-26 16:54:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:12,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185872843] [2025-04-26 16:54:12,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:12,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:12,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:12,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:12,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:12,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:12,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:12,785 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:12,786 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:12,786 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:12,786 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:12,786 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:12,786 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:12,786 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:12,786 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:12,786 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:12,786 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:12,787 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:12,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,015 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:13,019 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:13,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,026 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:54:13,027 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:54:13,029 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:54:13,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,056 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,063 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:54:13,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,066 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:54:13,067 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:54:13,069 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:54:13,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,091 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,104 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:54:13,119 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:54:13,120 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:54:13,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:13,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:13,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:13,136 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,142 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:54:13,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,147 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:54:13,148 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:54:13,149 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:54:13,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,164 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,173 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:54:13,174 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:54:13,189 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:54:13,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,213 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:13,221 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:13,221 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:13,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,226 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:54:13,227 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:54:13,228 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:13,246 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:54:13,247 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:13,247 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:13,247 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2025-04-26 16:54:13,254 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 16:54:13,256 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:13,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:13,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:13,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:13,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:13,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:13,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:13,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:13,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:13,302 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:13,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:13,326 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:54:13,346 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:54:13,349 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 848 states, 846 states have (on average 1.9148936170212767) internal successors, (in total 1620), 847 states have internal predecessors, (1620), 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 16:54:13,469 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 848 states, 846 states have (on average 1.9148936170212767) internal successors, (in total 1620), 847 states have internal predecessors, (1620), 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 1935 states and 3855 transitions. Complement of second has 6 states. [2025-04-26 16:54:13,469 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:54:13,472 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 16:54:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 16:54:13,477 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:54:13,478 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:13,478 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:54:13,478 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:13,478 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:54:13,478 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:13,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1935 states and 3855 transitions. [2025-04-26 16:54:13,504 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 245 [2025-04-26 16:54:13,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1935 states to 1078 states and 2055 transitions. [2025-04-26 16:54:13,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2025-04-26 16:54:13,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 584 [2025-04-26 16:54:13,528 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1078 states and 2055 transitions. [2025-04-26 16:54:13,528 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:13,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1078 states and 2055 transitions. [2025-04-26 16:54:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states and 2055 transitions. [2025-04-26 16:54:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 935. [2025-04-26 16:54:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 935 states have (on average 1.9700534759358288) internal successors, (in total 1842), 934 states have internal predecessors, (1842), 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:54:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1842 transitions. [2025-04-26 16:54:13,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 935 states and 1842 transitions. [2025-04-26 16:54:13,604 INFO L438 stractBuchiCegarLoop]: Abstraction has 935 states and 1842 transitions. [2025-04-26 16:54:13,604 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:13,604 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 935 states and 1842 transitions. [2025-04-26 16:54:13,608 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 245 [2025-04-26 16:54:13,608 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:13,609 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:13,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:13,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:13,609 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0]" "[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x]" "[90] $Ultimate##0-->L46: Formula: (= v_B_1 (store v_B_2 (+ (- 1) v_i1_7) v_sum1_4)) InVars {sum1=v_sum1_4, i1=v_i1_7, B=v_B_2} OutVars{sum1=v_sum1_4, i1=v_i1_7, B=v_B_1} AuxVars[] AssignedVars[B]" "[76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1]" "[78] L23-1-->sum1FINAL: Formula: (<= v_N_2 v_i1_6) InVars {i1=v_i1_6, N=v_N_2} OutVars{i1=v_i1_6, N=v_N_2} AuxVars[] AssignedVars[]" "[80] sum1FINAL-->sum1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y]" "[83] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2]" "[84] L34-->L35-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2]" [2025-04-26 16:54:13,610 INFO L754 eck$LassoCheckResult]: Loop: "[86] L35-1-->L36: Formula: (< v_i2_1 v_N_3) InVars {i2=v_i2_1, N=v_N_3} OutVars{i2=v_i2_1, N=v_N_3} AuxVars[] AssignedVars[]" "[88] L36-->L37: Formula: (= (+ (let ((.cse0 (select v_A_2 v_i2_2))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum2_2) v_sum2_1) InVars {A=v_A_2, sum2=v_sum2_2, i2=v_i2_2} OutVars{A=v_A_2, sum2=v_sum2_1, i2=v_i2_2} AuxVars[] AssignedVars[sum2]" "[89] L37-->L35-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" [2025-04-26 16:54:13,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,610 INFO L85 PathProgramCache]: Analyzing trace with hash -217770765, now seen corresponding path program 1 times [2025-04-26 16:54:13,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226854695] [2025-04-26 16:54:13,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:13,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:13,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,617 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:13,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:13,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:13,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:13,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,626 INFO L85 PathProgramCache]: Analyzing trace with hash 115254, now seen corresponding path program 1 times [2025-04-26 16:54:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844877349] [2025-04-26 16:54:13,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:13,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:13,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:13,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:13,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:13,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:13,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2086809604, now seen corresponding path program 1 times [2025-04-26 16:54:13,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726043550] [2025-04-26 16:54:13,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:54:13,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:54:13,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:13,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726043550] [2025-04-26 16:54:13,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726043550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:13,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:13,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:54:13,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039800171] [2025-04-26 16:54:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:13,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:13,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:54:13,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:54:13,791 INFO L87 Difference]: Start difference. First operand 935 states and 1842 transitions. cyclomatic complexity: 1026 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:13,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:13,902 INFO L93 Difference]: Finished difference Result 976 states and 1896 transitions. [2025-04-26 16:54:13,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 976 states and 1896 transitions. [2025-04-26 16:54:13,932 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 263 [2025-04-26 16:54:13,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 976 states to 976 states and 1896 transitions. [2025-04-26 16:54:13,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2025-04-26 16:54:13,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 473 [2025-04-26 16:54:13,943 INFO L74 IsDeterministic]: Start isDeterministic. Operand 976 states and 1896 transitions. [2025-04-26 16:54:13,944 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:13,944 INFO L218 hiAutomatonCegarLoop]: Abstraction has 976 states and 1896 transitions. [2025-04-26 16:54:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states and 1896 transitions. [2025-04-26 16:54:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 944. [2025-04-26 16:54:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 944 states have (on average 1.9629237288135593) internal successors, (in total 1853), 943 states have internal predecessors, (1853), 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:54:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1853 transitions. [2025-04-26 16:54:13,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 944 states and 1853 transitions. [2025-04-26 16:54:13,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:54:13,967 INFO L438 stractBuchiCegarLoop]: Abstraction has 944 states and 1853 transitions. [2025-04-26 16:54:13,967 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:13,968 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 944 states and 1853 transitions. [2025-04-26 16:54:13,971 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 245 [2025-04-26 16:54:13,971 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:13,971 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:13,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:13,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:13,972 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0]" "[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x]" "[76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1]" "[79] L23-1-->L24: Formula: (< v_i1_2 v_N_1) InVars {i1=v_i1_2, N=v_N_1} OutVars{i1=v_i1_2, N=v_N_1} AuxVars[] AssignedVars[]" "[81] L24-->L25: Formula: (= (+ v_sum1_3 (let ((.cse0 (select v_A_1 v_i1_3))) (ite (< .cse0 0) (- .cse0) .cse0))) v_sum1_2) InVars {sum1=v_sum1_3, A=v_A_1, i1=v_i1_3} OutVars{sum1=v_sum1_2, A=v_A_1, i1=v_i1_3} AuxVars[] AssignedVars[sum1]" "[107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y]" "[82] L25-->L23-1: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1]" "[79] L23-1-->L24: Formula: (< v_i1_2 v_N_1) InVars {i1=v_i1_2, N=v_N_1} OutVars{i1=v_i1_2, N=v_N_1} AuxVars[] AssignedVars[]" "[110] L70-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j]" "[93] $Ultimate##0-->L57-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j]" [2025-04-26 16:54:13,972 INFO L754 eck$LassoCheckResult]: Loop: "[95] L57-1-->L58: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_5) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_5} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_5} AuxVars[] AssignedVars[]" "[97] L58-->L59: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A]" "[98] L59-->L57-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j]" [2025-04-26 16:54:13,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 706524784, now seen corresponding path program 1 times [2025-04-26 16:54:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588422667] [2025-04-26 16:54:13,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:13,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:13,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:13,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:13,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:13,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:13,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash 124191, now seen corresponding path program 1 times [2025-04-26 16:54:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897542855] [2025-04-26 16:54:13,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:13,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:13,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:13,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1554783152, now seen corresponding path program 1 times [2025-04-26 16:54:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186357594] [2025-04-26 16:54:14,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:14,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:14,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:14,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:14,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,221 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:14,221 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:14,222 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:14,222 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:14,222 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:14,222 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,222 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:14,222 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:14,222 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:14,222 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:14,222 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:14,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,462 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:14,462 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:14,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,467 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:54:14,468 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:54:14,469 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:54:14,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,486 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:54:14,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,498 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:54:14,500 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:54:14,501 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:54:14,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,516 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,523 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 16:54:14,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,526 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:54:14,527 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:54:14,527 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:54:14,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,543 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,549 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:54:14,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,552 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:54:14,553 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:54:14,555 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:54:14,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,569 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,575 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:54:14,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,577 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:54:14,578 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:54:14,580 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:54:14,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,594 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:54:14,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,602 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:54:14,604 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:54:14,605 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:54:14,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,620 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,627 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:54:14,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,629 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:54:14,631 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:54:14,632 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:54:14,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,642 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:14,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,645 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:54:14,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,649 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,656 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:54:14,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,658 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:54:14,659 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:54:14,661 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:54:14,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,679 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:14,690 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:54:14,690 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:54:14,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,692 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:54:14,705 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:54:14,706 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:14,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:14,724 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:14,724 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:14,724 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(mapAbsThread1of1ForFork3_j, N) = -1*mapAbsThread1of1ForFork3_j + 1*N Supporting invariants [] [2025-04-26 16:54:14,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:14,732 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:14,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:14,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:14,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:14,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:14,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:14,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:14,796 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:54:14,796 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:54:14,797 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 944 states and 1853 transitions. cyclomatic complexity: 1028 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:14,853 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 944 states and 1853 transitions. cyclomatic complexity: 1028. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1868 states and 3651 transitions. Complement of second has 6 states. [2025-04-26 16:54:14,853 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:54:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 16:54:14,854 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:54:14,854 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,854 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 16:54:14,854 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,854 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 11 letters. Loop has 6 letters. [2025-04-26 16:54:14,854 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1868 states and 3651 transitions. [2025-04-26 16:54:14,866 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 111 [2025-04-26 16:54:14,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1868 states to 1114 states and 2156 transitions. [2025-04-26 16:54:14,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2025-04-26 16:54:14,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 401 [2025-04-26 16:54:14,873 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1114 states and 2156 transitions. [2025-04-26 16:54:14,873 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:14,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1114 states and 2156 transitions. [2025-04-26 16:54:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states and 2156 transitions. [2025-04-26 16:54:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1080. [2025-04-26 16:54:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1080 states have (on average 1.9546296296296297) internal successors, (in total 2111), 1079 states have internal predecessors, (2111), 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:54:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 2111 transitions. [2025-04-26 16:54:14,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1080 states and 2111 transitions. [2025-04-26 16:54:14,897 INFO L438 stractBuchiCegarLoop]: Abstraction has 1080 states and 2111 transitions. [2025-04-26 16:54:14,897 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:14,897 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1080 states and 2111 transitions. [2025-04-26 16:54:14,903 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 111 [2025-04-26 16:54:14,904 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:14,904 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:14,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:14,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:14,905 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0]" "[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x]" "[90] $Ultimate##0-->L46: Formula: (= v_B_1 (store v_B_2 (+ (- 1) v_i1_7) v_sum1_4)) InVars {sum1=v_sum1_4, i1=v_i1_7, B=v_B_2} OutVars{sum1=v_sum1_4, i1=v_i1_7, B=v_B_1} AuxVars[] AssignedVars[B]" "[76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1]" "[77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1]" "[79] L23-1-->L24: Formula: (< v_i1_2 v_N_1) InVars {i1=v_i1_2, N=v_N_1} OutVars{i1=v_i1_2, N=v_N_1} AuxVars[] AssignedVars[]" "[81] L24-->L25: Formula: (= (+ v_sum1_3 (let ((.cse0 (select v_A_1 v_i1_3))) (ite (< .cse0 0) (- .cse0) .cse0))) v_sum1_2) InVars {sum1=v_sum1_3, A=v_A_1, i1=v_i1_3} OutVars{sum1=v_sum1_2, A=v_A_1, i1=v_i1_3} AuxVars[] AssignedVars[sum1]" "[82] L25-->L23-1: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1]" "[78] L23-1-->sum1FINAL: Formula: (<= v_N_2 v_i1_6) InVars {i1=v_i1_6, N=v_N_2} OutVars{i1=v_i1_6, N=v_N_2} AuxVars[] AssignedVars[]" "[80] sum1FINAL-->sum1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y]" "[83] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2]" "[84] L34-->L35-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2]" [2025-04-26 16:54:14,905 INFO L754 eck$LassoCheckResult]: Loop: "[86] L35-1-->L36: Formula: (< v_i2_1 v_N_3) InVars {i2=v_i2_1, N=v_N_3} OutVars{i2=v_i2_1, N=v_N_3} AuxVars[] AssignedVars[]" "[88] L36-->L37: Formula: (= (+ (let ((.cse0 (select v_A_2 v_i2_2))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum2_2) v_sum2_1) InVars {A=v_A_2, sum2=v_sum2_2, i2=v_i2_2} OutVars{A=v_A_2, sum2=v_sum2_1, i2=v_i2_2} AuxVars[] AssignedVars[sum2]" "[89] L37-->L35-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2]" [2025-04-26 16:54:14,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash -298289199, now seen corresponding path program 1 times [2025-04-26 16:54:14,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71750649] [2025-04-26 16:54:14,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:54:14,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:54:14,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:54:14,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:54:14,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash 115254, now seen corresponding path program 2 times [2025-04-26 16:54:14,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361031968] [2025-04-26 16:54:14,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:14,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:14,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash -46106522, now seen corresponding path program 1 times [2025-04-26 16:54:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618747800] [2025-04-26 16:54:14,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:14,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:14,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:14,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:14,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,133 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:15,133 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:15,134 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:15,134 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:15,134 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:15,134 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,134 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:15,134 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:15,134 INFO L132 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:15,134 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:15,134 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:15,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,402 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:15,402 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:15,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,405 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:54:15,420 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:54:15,421 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:54:15,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,435 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:54:15,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,445 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:54:15,448 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:54:15,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,463 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:54:15,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,470 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:54:15,474 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:54:15,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,490 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:54:15,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,499 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:54:15,501 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:54:15,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,515 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:54:15,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,527 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:54:15,531 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:54:15,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:15,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:15,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:15,544 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,554 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:54:15,557 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:54:15,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,570 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,577 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:54:15,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:15,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,588 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:15,588 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:15,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,602 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:54:15,603 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:15,614 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:54:15,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,622 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:54:15,626 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:54:15,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,640 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,648 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:54:15,651 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:54:15,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,666 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:15,676 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:15,676 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:15,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,682 INFO L229 MonitoredProcess]: Starting monitored process 27 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:54:15,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:54:15,686 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:15,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:54:15,703 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:15,703 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:15,703 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2025-04-26 16:54:15,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,710 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:15,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:54:15,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:54:15,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,760 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,775 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:54:15,775 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:54:15,776 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1080 states and 2111 transitions. cyclomatic complexity: 1152 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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:54:15,833 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1080 states and 2111 transitions. cyclomatic complexity: 1152. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 2127 states and 4141 transitions. Complement of second has 6 states. [2025-04-26 16:54:15,833 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:54:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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:54:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-26 16:54:15,834 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 16:54:15,834 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,834 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 16 letters. Loop has 3 letters. [2025-04-26 16:54:15,834 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,834 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 13 letters. Loop has 6 letters. [2025-04-26 16:54:15,834 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2127 states and 4141 transitions. [2025-04-26 16:54:15,845 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:15,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2127 states to 0 states and 0 transitions. [2025-04-26 16:54:15,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:15,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:15,845 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:15,845 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:15,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:15,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:15,846 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:15,846 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:15,846 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:15,846 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:15,846 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:15,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:15,857 INFO L201 PluginConnector]: Adding new model sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:15 BoogieIcfgContainer [2025-04-26 16:54:15,857 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:15,859 INFO L158 Benchmark]: Toolchain (without parser) took 4367.12ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 87.1MB in the beginning and 68.1MB in the end (delta: 19.0MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:15,859 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:15,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.57ms. Allocated memory is still 155.2MB. Free memory was 87.0MB in the beginning and 85.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:15,860 INFO L158 Benchmark]: Boogie Preprocessor took 27.16ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 84.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:15,861 INFO L158 Benchmark]: RCFGBuilder took 198.99ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 74.6MB in the end (delta: 9.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:15,861 INFO L158 Benchmark]: BuchiAutomizer took 4104.41ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 74.4MB in the beginning and 68.1MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:15,862 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.18ms. Allocated memory is still 155.2MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.57ms. Allocated memory is still 155.2MB. Free memory was 87.0MB in the beginning and 85.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.16ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 84.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 198.99ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 74.6MB in the end (delta: 9.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4104.41ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 74.4MB in the beginning and 68.1MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. 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, 209 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 195 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 131 mSDtfsCounter, 195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital90 mio100 ax100 hnf100 lsp128 ukn42 mio100 lsp64 div100 bol100 ite100 ukn100 eq164 hnf98 smp100 dnf201 smp52 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 548, Number of transitions in reduction automaton: 1620, Number of states in reduction automaton: 848, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:15,878 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...