/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/weaver-benchmarks/generated/popl20-more/vector-add.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:52,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:52,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:52,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:52,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:52,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:52,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:52,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:52,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:52,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:52,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:52,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:52,135 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:52,135 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:52,135 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:52,136 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:52,136 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:52,136 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:52,137 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:52,137 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:52,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:52,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:52,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:52,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:52,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:52,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:52,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:52,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:52,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:52,139 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:52,139 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:52,139 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:52,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:52,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:52,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:52,378 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:52,379 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:52,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/vector-add.wvr.bpl [2025-04-26 16:55:52,381 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/vector-add.wvr.bpl' [2025-04-26 16:55:52,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:52,399 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:52,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:52,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:52,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:52,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,427 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:52,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:52,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:52,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:52,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:52,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:52,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:52,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:52,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:52,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/1) ... [2025-04-26 16:55:52,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:52,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:52,479 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:55:52,481 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:55:52,499 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:52,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:52,499 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:52,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:52,499 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:52,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:52,499 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:52,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:52,500 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:55:52,538 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:52,540 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:52,619 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:52,619 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:52,638 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:52,639 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:52,641 INFO L201 PluginConnector]: Adding new model vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:52 BoogieIcfgContainer [2025-04-26 16:55:52,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:52,641 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:52,642 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:52,646 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:52,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:52,647 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:52" (1/2) ... [2025-04-26 16:55:52,648 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ecae9fb and model type vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:52, skipping insertion in model container [2025-04-26 16:55:52,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:52,648 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:52" (2/2) ... [2025-04-26 16:55:52,649 INFO L376 chiAutomizerObserver]: Analyzing ICFG vector-add.wvr.bpl [2025-04-26 16:55:52,697 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:55:52,729 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:52,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:52,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:52,732 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:55:52,734 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:55:52,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 87 flow [2025-04-26 16:55:52,806 INFO L116 PetriNetUnfolderBase]: 3/27 cut-off events. [2025-04-26 16:55:52,807 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:55:52,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 3/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-26 16:55:52,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 33 transitions, 87 flow [2025-04-26 16:55:52,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 27 transitions, 72 flow [2025-04-26 16:55:52,817 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 34 places, 27 transitions, 72 flow [2025-04-26 16:55:52,824 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:52,903 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 16:55:52,904 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:52,904 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 16:55:52,904 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:24 [2025-04-26 16:55:52,904 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 16:55:52,904 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 16:55:52,904 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:6 [2025-04-26 16:55:52,904 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:52,909 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 115 states, 113 states have (on average 2.017699115044248) internal successors, (in total 228), 114 states have internal predecessors, (228), 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:55:52,915 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:52,915 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:52,915 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:52,915 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:52,915 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:52,915 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:52,915 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:52,915 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:52,917 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 115 states, 113 states have (on average 2.017699115044248) internal successors, (in total 228), 114 states have internal predecessors, (228), 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:55:52,930 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:55:52,930 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:52,930 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:52,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:52,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:52,934 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:52,934 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 115 states, 113 states have (on average 2.017699115044248) internal successors, (in total 228), 114 states have internal predecessors, (228), 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:55:52,937 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:55:52,938 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:52,938 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:52,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:52,938 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:52,942 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[64] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_C2_3 v_C1_3) InVars {C1=v_C1_3, C2=v_C2_3} OutVars{C1=v_C1_3, C2=v_C2_3} AuxVars[] AssignedVars[]" "[83] L60-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:52,942 INFO L754 eck$LassoCheckResult]: Loop: "[70] L23-1-->L23: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[72] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (store v_C1_6 v_i_8 (+ (select v_B_4 v_i_8) (select v_A_4 v_i_8))) v_C1_5)) InVars {A=v_A_4, i=v_i_8, C1=v_C1_6, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, C1=v_C1_5, B=v_B_4} AuxVars[] AssignedVars[C1, i]" [2025-04-26 16:55:52,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1588944632, now seen corresponding path program 1 times [2025-04-26 16:55:52,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:52,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350626798] [2025-04-26 16:55:52,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:52,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:53,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:53,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:53,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:53,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,031 INFO L85 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2025-04-26 16:55:53,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263096864] [2025-04-26 16:55:53,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:53,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:53,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:53,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:53,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2032568266, now seen corresponding path program 1 times [2025-04-26 16:55:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535887015] [2025-04-26 16:55:53,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:53,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:53,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:53,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:53,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,199 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:53,200 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:53,200 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:53,200 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:53,200 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:53,201 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,201 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:53,201 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:53,201 INFO L132 ssoRankerPreferences]: Filename of dumped script: vector-add.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:55:53,201 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:53,201 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:53,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,371 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:53,396 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:53,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,400 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:55:53,401 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:55:53,404 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:55:53,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:53,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:53,433 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:53,440 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:55:53,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,443 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:55:53,445 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:55:53,446 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:55:53,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:53,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:53,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:53,461 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:53,467 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:55:53,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,470 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:55:53,471 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:55:53,473 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:55:53,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:53,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:53,493 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:53,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:55:53,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,502 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:55:53,503 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:55:53,505 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:55:53,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:53,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:53,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:53,519 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:53,525 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:55:53,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,527 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:55:53,528 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:55:53,529 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:55:53,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:53,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:53,552 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:53,570 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:55:53,570 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:55:53,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,590 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:55:53,592 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:55:53,592 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:53,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:55:53,609 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:53,610 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:53,610 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:55:53,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:53,622 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:53,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:53,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:53,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:53,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:53,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:53,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:53,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:53,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:53,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:53,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:53,741 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:55:53,757 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:55:53,760 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 115 states, 113 states have (on average 2.017699115044248) internal successors, (in total 228), 114 states have internal predecessors, (228), 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.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:55:53,857 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 115 states, 113 states have (on average 2.017699115044248) internal successors, (in total 228), 114 states have internal predecessors, (228), 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.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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 261 states and 530 transitions. Complement of second has 7 states. [2025-04-26 16:55:53,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:55:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-04-26 16:55:53,869 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:55:53,870 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:53,870 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:55:53,870 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:53,870 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:55:53,870 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:53,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 530 transitions. [2025-04-26 16:55:53,881 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:53,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 120 states and 242 transitions. [2025-04-26 16:55:53,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-04-26 16:55:53,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2025-04-26 16:55:53,889 INFO L74 IsDeterministic]: Start isDeterministic. Operand 120 states and 242 transitions. [2025-04-26 16:55:53,890 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:53,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 242 transitions. [2025-04-26 16:55:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 242 transitions. [2025-04-26 16:55:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2025-04-26 16:55:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 2.0095238095238095) internal successors, (in total 211), 104 states have internal predecessors, (211), 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:55:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 211 transitions. [2025-04-26 16:55:53,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 211 transitions. [2025-04-26 16:55:53,917 INFO L438 stractBuchiCegarLoop]: Abstraction has 105 states and 211 transitions. [2025-04-26 16:55:53,917 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:53,917 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 211 transitions. [2025-04-26 16:55:53,918 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:53,918 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:53,918 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:53,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:53,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:53,919 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[64] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_C2_3 v_C1_3) InVars {C1=v_C1_3, C2=v_C2_3} OutVars{C1=v_C1_3, C2=v_C2_3} AuxVars[] AssignedVars[]" "[83] L60-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[69] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[71] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[86] L60-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:55:53,919 INFO L754 eck$LassoCheckResult]: Loop: "[74] L34-1-->L34: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[76] L34-->L34-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= v_C2_7 (store v_C2_8 v_j_8 (+ (select v_B_6 v_j_8) (select v_A_6 v_j_8))))) InVars {A=v_A_6, C2=v_C2_8, j=v_j_8, B=v_B_6} OutVars{A=v_A_6, C2=v_C2_7, j=v_j_7, B=v_B_6} AuxVars[] AssignedVars[C2, j]" [2025-04-26 16:55:53,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1414894100, now seen corresponding path program 1 times [2025-04-26 16:55:53,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687405528] [2025-04-26 16:55:53,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:53,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:53,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:53,982 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:55:53,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:53,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687405528] [2025-04-26 16:55:53,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687405528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:53,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:53,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:55:53,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165668143] [2025-04-26 16:55:53,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:53,986 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:53,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,987 INFO L85 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2025-04-26 16:55:53,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080057575] [2025-04-26 16:55:53,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:53,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:53,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:53,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:53,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:54,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:55:54,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:55:54,013 INFO L87 Difference]: Start difference. First operand 105 states and 211 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:54,055 INFO L93 Difference]: Finished difference Result 107 states and 213 transitions. [2025-04-26 16:55:54,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 213 transitions. [2025-04-26 16:55:54,057 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:54,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 213 transitions. [2025-04-26 16:55:54,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-04-26 16:55:54,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-04-26 16:55:54,058 INFO L74 IsDeterministic]: Start isDeterministic. Operand 107 states and 213 transitions. [2025-04-26 16:55:54,058 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:54,058 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 213 transitions. [2025-04-26 16:55:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 213 transitions. [2025-04-26 16:55:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-04-26 16:55:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 2.0) internal successors, (in total 210), 104 states have internal predecessors, (210), 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:55:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 210 transitions. [2025-04-26 16:55:54,062 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 210 transitions. [2025-04-26 16:55:54,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:55:54,064 INFO L438 stractBuchiCegarLoop]: Abstraction has 105 states and 210 transitions. [2025-04-26 16:55:54,064 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:54,064 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 210 transitions. [2025-04-26 16:55:54,065 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:54,065 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:54,065 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:54,065 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:54,066 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:54,066 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[64] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_C2_3 v_C1_3) InVars {C1=v_C1_3, C2=v_C2_3} OutVars{C1=v_C1_3, C2=v_C2_3} AuxVars[] AssignedVars[]" "[83] L60-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[70] L23-1-->L23: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[86] L60-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[72] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (store v_C1_6 v_i_8 (+ (select v_B_4 v_i_8) (select v_A_4 v_i_8))) v_C1_5)) InVars {A=v_A_4, i=v_i_8, C1=v_C1_6, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, C1=v_C1_5, B=v_B_4} AuxVars[] AssignedVars[C1, i]" "[69] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:54,066 INFO L754 eck$LassoCheckResult]: Loop: "[74] L34-1-->L34: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[76] L34-->L34-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= v_C2_7 (store v_C2_8 v_j_8 (+ (select v_B_6 v_j_8) (select v_A_6 v_j_8))))) InVars {A=v_A_6, C2=v_C2_8, j=v_j_8, B=v_B_6} OutVars{A=v_A_6, C2=v_C2_7, j=v_j_7, B=v_B_6} AuxVars[] AssignedVars[C2, j]" [2025-04-26 16:55:54,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash -912000299, now seen corresponding path program 1 times [2025-04-26 16:55:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568145391] [2025-04-26 16:55:54,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:54,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:54,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:54,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:54,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 2 times [2025-04-26 16:55:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069106721] [2025-04-26 16:55:54,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:54,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:54,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash -258956585, now seen corresponding path program 1 times [2025-04-26 16:55:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037351221] [2025-04-26 16:55:54,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:54,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:54,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,190 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:55:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:54,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037351221] [2025-04-26 16:55:54,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037351221] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:54,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:54,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 16:55:54,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199511003] [2025-04-26 16:55:54,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:54,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:54,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:55:54,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:55:54,210 INFO L87 Difference]: Start difference. First operand 105 states and 210 transitions. cyclomatic complexity: 132 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (in total 12), 6 states have internal predecessors, (12), 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:55:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:54,321 INFO L93 Difference]: Finished difference Result 155 states and 291 transitions. [2025-04-26 16:55:54,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 291 transitions. [2025-04-26 16:55:54,323 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 56 [2025-04-26 16:55:54,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 153 states and 289 transitions. [2025-04-26 16:55:54,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2025-04-26 16:55:54,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2025-04-26 16:55:54,324 INFO L74 IsDeterministic]: Start isDeterministic. Operand 153 states and 289 transitions. [2025-04-26 16:55:54,324 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:54,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 153 states and 289 transitions. [2025-04-26 16:55:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 289 transitions. [2025-04-26 16:55:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 124. [2025-04-26 16:55:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.9758064516129032) internal successors, (in total 245), 123 states have internal predecessors, (245), 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:55:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 245 transitions. [2025-04-26 16:55:54,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 245 transitions. [2025-04-26 16:55:54,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:55:54,335 INFO L438 stractBuchiCegarLoop]: Abstraction has 124 states and 245 transitions. [2025-04-26 16:55:54,335 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:54,335 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 245 transitions. [2025-04-26 16:55:54,337 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:54,337 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:54,337 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:54,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:54,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:54,338 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[64] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_C2_3 v_C1_3) InVars {C1=v_C1_3, C2=v_C2_3} OutVars{C1=v_C1_3, C2=v_C2_3} AuxVars[] AssignedVars[]" "[83] L60-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[70] L23-1-->L23: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[86] L60-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[72] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (store v_C1_6 v_i_8 (+ (select v_B_4 v_i_8) (select v_A_4 v_i_8))) v_C1_5)) InVars {A=v_A_4, i=v_i_8, C1=v_C1_6, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, C1=v_C1_5, B=v_B_4} AuxVars[] AssignedVars[C1, i]" "[70] L23-1-->L23: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[72] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (store v_C1_6 v_i_8 (+ (select v_B_4 v_i_8) (select v_A_4 v_i_8))) v_C1_5)) InVars {A=v_A_4, i=v_i_8, C1=v_C1_6, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, C1=v_C1_5, B=v_B_4} AuxVars[] AssignedVars[C1, i]" "[69] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:54,338 INFO L754 eck$LassoCheckResult]: Loop: "[74] L34-1-->L34: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[76] L34-->L34-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= v_C2_7 (store v_C2_8 v_j_8 (+ (select v_B_6 v_j_8) (select v_A_6 v_j_8))))) InVars {A=v_A_6, C2=v_C2_8, j=v_j_8, B=v_B_6} OutVars{A=v_A_6, C2=v_C2_7, j=v_j_7, B=v_B_6} AuxVars[] AssignedVars[C2, j]" [2025-04-26 16:55:54,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash -258955693, now seen corresponding path program 2 times [2025-04-26 16:55:54,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028207837] [2025-04-26 16:55:54,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:54,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-26 16:55:54,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:54,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:54,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:54,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:54,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 3 times [2025-04-26 16:55:54,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302615354] [2025-04-26 16:55:54,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:54,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:54,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,371 INFO L85 PathProgramCache]: Analyzing trace with hash 251684565, now seen corresponding path program 2 times [2025-04-26 16:55:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526243648] [2025-04-26 16:55:54,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:55:54,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:54,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:54,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,387 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:54,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:54,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,560 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:54,560 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:54,560 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:54,560 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:54,560 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:54,560 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,560 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:54,560 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:54,560 INFO L132 ssoRankerPreferences]: Filename of dumped script: vector-add.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:55:54,560 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:54,560 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:54,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,769 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:54,769 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:54,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,771 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:55:54,773 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:55:54,774 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:55:54,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,788 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,794 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:55:54,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,796 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:55:54,797 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:55:54,797 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:55:54,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,817 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:55:54,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,833 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:55:54,835 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:55:54,836 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:55:54,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,858 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:54,865 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:55:54,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,867 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:55:54,871 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:55:54,875 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:55:54,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:54,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:54,891 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:54,904 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:54,904 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:54,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,906 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:55:54,915 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:54,922 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:55:54,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:54,939 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:54,939 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:54,939 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 16:55:54,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:55:54,947 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:54,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:54,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:54,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:54,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:54,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,993 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:54,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,008 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:55:55,009 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:55:55,009 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 245 transitions. cyclomatic complexity: 148 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:55:55,061 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 245 transitions. cyclomatic complexity: 148. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 268 states and 558 transitions. Complement of second has 6 states. [2025-04-26 16:55:55,061 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:55:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:55:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-04-26 16:55:55,062 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:55,062 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,062 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:55:55,062 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,063 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:55:55,063 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 268 states and 558 transitions. [2025-04-26 16:55:55,065 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:55:55,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 268 states to 159 states and 311 transitions. [2025-04-26 16:55:55,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2025-04-26 16:55:55,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2025-04-26 16:55:55,070 INFO L74 IsDeterministic]: Start isDeterministic. Operand 159 states and 311 transitions. [2025-04-26 16:55:55,070 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:55,070 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 311 transitions. [2025-04-26 16:55:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 311 transitions. [2025-04-26 16:55:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 122. [2025-04-26 16:55:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 2.0655737704918034) internal successors, (in total 252), 121 states have internal predecessors, (252), 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:55:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 252 transitions. [2025-04-26 16:55:55,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 122 states and 252 transitions. [2025-04-26 16:55:55,082 INFO L438 stractBuchiCegarLoop]: Abstraction has 122 states and 252 transitions. [2025-04-26 16:55:55,082 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:55,082 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 252 transitions. [2025-04-26 16:55:55,083 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:55:55,083 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:55,083 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:55,083 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:55,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:55,084 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[64] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_C2_3 v_C1_3) InVars {C1=v_C1_3, C2=v_C2_3} OutVars{C1=v_C1_3, C2=v_C2_3} AuxVars[] AssignedVars[]" "[83] L60-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[70] L23-1-->L23: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[86] L60-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[72] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (store v_C1_6 v_i_8 (+ (select v_B_4 v_i_8) (select v_A_4 v_i_8))) v_C1_5)) InVars {A=v_A_4, i=v_i_8, C1=v_C1_6, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, C1=v_C1_5, B=v_B_4} AuxVars[] AssignedVars[C1, i]" "[89] L61-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[69] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[73] L34-1-->thread2FINAL: Formula: (<= v_M_2 v_j_5) InVars {M=v_M_2, j=v_j_5} OutVars{M=v_M_2, j=v_j_5} AuxVars[] AssignedVars[]" [2025-04-26 16:55:55,084 INFO L754 eck$LassoCheckResult]: Loop: "[78] L45-1-->L45: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L45-->L45-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= v_C2_11 (store v_C2_12 v_k_8 (+ (select v_B_8 v_k_8) (select v_A_8 v_k_8))))) InVars {A=v_A_8, C2=v_C2_12, k=v_k_8, B=v_B_8} OutVars{A=v_A_8, C2=v_C2_11, k=v_k_7, B=v_B_8} AuxVars[] AssignedVars[C2, k]" [2025-04-26 16:55:55,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash -258937523, now seen corresponding path program 1 times [2025-04-26 16:55:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847044556] [2025-04-26 16:55:55,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:55,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:55,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:55,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:55,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:55,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:55,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,097 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-04-26 16:55:55,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093830749] [2025-04-26 16:55:55,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:55,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,104 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:55,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:55,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash 269146063, now seen corresponding path program 1 times [2025-04-26 16:55:55,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923602433] [2025-04-26 16:55:55,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:55,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:55,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:55,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:55,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:55,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:55,250 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:55,250 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:55,250 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:55,250 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:55,250 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:55,250 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,250 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:55,250 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:55,250 INFO L132 ssoRankerPreferences]: Filename of dumped script: vector-add.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:55:55,250 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:55,250 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:55,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,423 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:55,423 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:55,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,428 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:55:55,430 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:55:55,431 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:55:55,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:55,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:55,447 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:55,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:55:55,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,455 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:55:55,457 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:55:55,458 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:55:55,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:55,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:55,474 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:55,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:55,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,483 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:55:55,486 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:55:55,487 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:55:55,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:55,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:55,501 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:55,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:55:55,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,513 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:55:55,515 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:55:55,516 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:55:55,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:55,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:55,534 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:55,540 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:55:55,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,543 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:55:55,544 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:55:55,546 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:55:55,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:55,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:55,566 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:55,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:55,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,573 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:55:55,574 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:55:55,575 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:55:55,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:55,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:55,591 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:55,600 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:55:55,600 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:55:55,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,602 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:55:55,603 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:55:55,604 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:55,620 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:55:55,620 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:55:55,620 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:55,620 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k) = -2*k + 1 Supporting invariants [-1*N + 1 >= 0] [2025-04-26 16:55:55,626 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:55:55,628 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:55,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:55,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:55,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,718 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,730 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:55:55,730 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-04-26 16:55:55,730 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 252 transitions. cyclomatic complexity: 149 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 states have internal predecessors, (14), 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:55:55,824 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 252 transitions. cyclomatic complexity: 149. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 states have internal predecessors, (14), 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 234 states and 432 transitions. Complement of second has 11 states. [2025-04-26 16:55:55,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 16:55:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 states have internal predecessors, (14), 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:55:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2025-04-26 16:55:55,826 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:55,826 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,827 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:55:55,827 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,827 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:55:55,827 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234 states and 432 transitions. [2025-04-26 16:55:55,828 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:55:55,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234 states to 149 states and 291 transitions. [2025-04-26 16:55:55,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-04-26 16:55:55,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-04-26 16:55:55,832 INFO L74 IsDeterministic]: Start isDeterministic. Operand 149 states and 291 transitions. [2025-04-26 16:55:55,832 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:55,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 291 transitions. [2025-04-26 16:55:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 291 transitions. [2025-04-26 16:55:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 118. [2025-04-26 16:55:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 2.0508474576271185) internal successors, (in total 242), 117 states have internal predecessors, (242), 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:55:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 242 transitions. [2025-04-26 16:55:55,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 242 transitions. [2025-04-26 16:55:55,841 INFO L438 stractBuchiCegarLoop]: Abstraction has 118 states and 242 transitions. [2025-04-26 16:55:55,841 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:55,841 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 242 transitions. [2025-04-26 16:55:55,842 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:55:55,842 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:55,842 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:55,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:55,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:55,843 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[45] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[64] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[47] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[42] L59-->L60: Formula: (= v_C2_3 v_C1_3) InVars {C1=v_C1_3, C2=v_C2_3} OutVars{C1=v_C1_3, C2=v_C2_3} AuxVars[] AssignedVars[]" "[83] L60-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[70] L23-1-->L23: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[86] L60-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[72] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (store v_C1_6 v_i_8 (+ (select v_B_4 v_i_8) (select v_A_4 v_i_8))) v_C1_5)) InVars {A=v_A_4, i=v_i_8, C1=v_C1_6, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, C1=v_C1_5, B=v_B_4} AuxVars[] AssignedVars[C1, i]" "[70] L23-1-->L23: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[72] L23-->L23-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (store v_C1_6 v_i_8 (+ (select v_B_4 v_i_8) (select v_A_4 v_i_8))) v_C1_5)) InVars {A=v_A_4, i=v_i_8, C1=v_C1_6, B=v_B_4} OutVars{A=v_A_4, i=v_i_7, C1=v_C1_5, B=v_B_4} AuxVars[] AssignedVars[C1, i]" "[89] L61-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[69] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[73] L34-1-->thread2FINAL: Formula: (<= v_M_2 v_j_5) InVars {M=v_M_2, j=v_j_5} OutVars{M=v_M_2, j=v_j_5} AuxVars[] AssignedVars[]" [2025-04-26 16:55:55,843 INFO L754 eck$LassoCheckResult]: Loop: "[78] L45-1-->L45: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L45-->L45-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= v_C2_11 (store v_C2_12 v_k_8 (+ (select v_B_8 v_k_8) (select v_A_8 v_k_8))))) InVars {A=v_A_8, C2=v_C2_12, k=v_k_8, B=v_B_8} OutVars{A=v_A_8, C2=v_C2_11, k=v_k_7, B=v_B_8} AuxVars[] AssignedVars[C2, k]" [2025-04-26 16:55:55,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash 251703627, now seen corresponding path program 2 times [2025-04-26 16:55:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208588596] [2025-04-26 16:55:55,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:55:55,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:55,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:55,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:55,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:55,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:55,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:55,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2025-04-26 16:55:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005328798] [2025-04-26 16:55:55,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:55,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:55,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:55,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1369019469, now seen corresponding path program 2 times [2025-04-26 16:55:55,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949483023] [2025-04-26 16:55:55,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:55,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-26 16:55:55,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:55:55,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:55,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:55,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:55:55,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:55:55,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:56,046 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:56,046 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:56,046 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:56,046 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:56,046 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:56,046 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:56,047 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:56,047 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:56,047 INFO L132 ssoRankerPreferences]: Filename of dumped script: vector-add.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:55:56,047 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:56,047 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:56,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,231 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:56,232 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:56,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:56,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:56,235 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:55:56,236 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:55:56,236 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:55:56,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:56,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:56,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:56,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:56,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:56,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:56,252 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:56,257 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:55:56,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:56,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:56,260 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:55:56,260 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:55:56,261 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:55:56,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:56,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:56,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:56,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:56,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:56,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:56,279 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:56,289 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:55:56,289 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:56,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:56,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:56,291 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:55:56,292 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:55:56,293 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:56,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:55:56,309 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:56,309 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:56,309 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:55:56,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:55:56,317 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:56,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:56,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:56,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:56,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:56,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:56,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:56,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:56,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:56,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:56,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:56,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:56,358 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:56,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:56,369 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:55:56,369 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:55:56,370 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 242 transitions. cyclomatic complexity: 143 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:55:56,416 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 242 transitions. cyclomatic complexity: 143. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 221 states and 433 transitions. Complement of second has 6 states. [2025-04-26 16:55:56,417 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:55:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:55:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:55:56,417 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:55:56,417 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:56,417 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:55:56,417 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:56,418 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:55:56,418 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:56,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 433 transitions. [2025-04-26 16:55:56,419 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:56,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 0 states and 0 transitions. [2025-04-26 16:55:56,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:56,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:56,419 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:56,419 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:56,420 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:56,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:56,420 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:56,420 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:55:56,420 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:56,420 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:56,420 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:56,430 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:55:56,431 INFO L201 PluginConnector]: Adding new model vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:56 BoogieIcfgContainer [2025-04-26 16:55:56,431 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:56,433 INFO L158 Benchmark]: Toolchain (without parser) took 4032.93ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 73.5MB in the end (delta: 10.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:56,434 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:56,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.32ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:56,435 INFO L158 Benchmark]: Boogie Preprocessor took 25.16ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:56,436 INFO L158 Benchmark]: RCFGBuilder took 185.40ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 71.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:56,436 INFO L158 Benchmark]: BuchiAutomizer took 3789.74ms. Allocated memory is still 155.2MB. Free memory was 71.1MB in the beginning and 73.5MB in the end (delta: -2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:56,437 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.23ms. Allocated memory is still 155.2MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.32ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.16ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 185.40ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 71.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3789.74ms. Allocated memory is still 155.2MB. Free memory was 71.1MB in the beginning and 73.5MB in the end (delta: -2.4MB). 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.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 114 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 279 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 296 IncrementalHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 81 mSDtfsCounter, 296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital72 mio100 ax100 hnf100 lsp73 ukn87 mio100 lsp60 div100 bol100 ite100 ukn100 eq200 hnf88 smp100 dnf100 smp100 tf103 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 178, Number of transitions in reduction automaton: 228, Number of states in reduction automaton: 115, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -2 * k + 1 and consists of 8 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:55:56,449 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...