/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/max-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:37,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:37,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:37,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:37,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:37,249 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:37,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:37,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:37,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:37,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:37,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:37,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:37,265 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:37,266 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:37,267 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:37,267 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:37,267 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:37,267 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:37,267 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:37,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:37,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:37,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:37,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:37,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:37,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:37,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:37,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:37,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:37,269 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:37,269 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:37,269 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:37,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:37,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:37,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:37,487 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:37,489 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:37,490 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/max-array.wvr.bpl [2025-04-26 16:55:37,490 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array.wvr.bpl' [2025-04-26 16:55:37,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:37,511 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:37,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:37,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:37,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:37,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,545 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:37,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:37,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:37,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:37,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:37,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,557 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:37,577 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:37,577 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:37,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:37,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/1) ... [2025-04-26 16:55:37,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:37,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:37,602 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:37,607 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:37,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:37,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:37,630 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:37,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:37,630 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:37,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:37,630 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:37,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:37,631 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:37,669 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:37,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:37,771 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:37,771 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:37,789 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:37,789 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:37,790 INFO L201 PluginConnector]: Adding new model max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:37 BoogieIcfgContainer [2025-04-26 16:55:37,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:37,791 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:37,791 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:37,795 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:37,796 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:37,796 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:37" (1/2) ... [2025-04-26 16:55:37,797 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13571db and model type max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:37, skipping insertion in model container [2025-04-26 16:55:37,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:37,797 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:37" (2/2) ... [2025-04-26 16:55:37,798 INFO L376 chiAutomizerObserver]: Analyzing ICFG max-array.wvr.bpl [2025-04-26 16:55:37,841 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:55:37,870 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:37,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:37,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:37,872 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:37,873 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:37,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 16:55:37,940 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 16:55:37,941 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:55:37,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 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/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:55:37,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 16:55:37,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2025-04-26 16:55:37,947 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 70 flow [2025-04-26 16:55:37,952 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:38,031 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 16:55:38,031 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:38,031 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 16:55:38,031 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 16:55:38,031 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 16:55:38,031 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 16:55:38,031 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:55:38,031 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:38,037 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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:38,042 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:38,042 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:38,042 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:38,042 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:38,042 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:38,043 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:38,043 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:38,043 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:38,044 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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:38,070 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:55:38,071 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:38,071 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:38,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:38,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:38,073 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:38,074 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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:38,078 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:55:38,078 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:38,078 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:38,078 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:38,078 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:38,081 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[56] L55-->L56: 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[]" "[45] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L57-->L58: 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[]" "[81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:38,082 INFO L754 eck$LassoCheckResult]: Loop: "[68] L22-1-->L22: 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[]" "[70] L22-->L22-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" [2025-04-26 16:55:38,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash 87601028, now seen corresponding path program 1 times [2025-04-26 16:55:38,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:38,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886516157] [2025-04-26 16:55:38,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:38,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:38,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:38,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:38,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:38,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:38,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:38,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 16:55:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:38,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893191876] [2025-04-26 16:55:38,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:38,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:38,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:38,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,185 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:38,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:38,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:38,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:38,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1714755834, now seen corresponding path program 1 times [2025-04-26 16:55:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:38,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803429466] [2025-04-26 16:55:38,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:38,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:38,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:38,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:38,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:38,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:38,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:38,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:38,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:38,399 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:38,400 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:38,400 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:38,400 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:38,400 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:38,400 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:38,400 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:38,400 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:38,401 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-array.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:55:38,401 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:38,401 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:38,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:38,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:38,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:38,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:38,648 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:38,651 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:38,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:38,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:38,654 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:38,658 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:38,659 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:38,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:38,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:38,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:38,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:38,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:38,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:38,682 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:38,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:55:38,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:38,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:38,692 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:38,693 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:38,694 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:38,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:38,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:38,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:38,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:38,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:38,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:38,709 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:38,715 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:38,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:38,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:38,718 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:38,719 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:38,721 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:38,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:38,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:38,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:38,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:38,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:38,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:38,737 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:38,743 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:38,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:38,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:38,745 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:38,747 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:38,748 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:38,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:38,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:38,758 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:55:38,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:38,765 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:55:38,765 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:55:38,780 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:38,785 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:38,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:38,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:38,788 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:38,788 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:38,792 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:38,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:38,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:38,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:38,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:38,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:38,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:38,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:38,825 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:38,825 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:55:38,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:38,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:38,845 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:38,846 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:38,848 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:38,864 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:38,865 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:38,865 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:38,865 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:55:38,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:55:38,873 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:38,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:38,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:38,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:38,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:38,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:38,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:38,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:38,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:38,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:38,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:38,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:38,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:38,945 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:38,960 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:38,961 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:39,058 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 260 states and 529 transitions. Complement of second has 7 states. [2025-04-26 16:55:39,060 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:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-26 16:55:39,067 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:55:39,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:39,067 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:55:39,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:39,067 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:55:39,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:39,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 529 transitions. [2025-04-26 16:55:39,081 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:39,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 119 states and 241 transitions. [2025-04-26 16:55:39,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-04-26 16:55:39,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-04-26 16:55:39,088 INFO L74 IsDeterministic]: Start isDeterministic. Operand 119 states and 241 transitions. [2025-04-26 16:55:39,088 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:39,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 241 transitions. [2025-04-26 16:55:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 241 transitions. [2025-04-26 16:55:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2025-04-26 16:55:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.019230769230769) internal successors, (in total 210), 103 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:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 210 transitions. [2025-04-26 16:55:39,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 16:55:39,116 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 16:55:39,116 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:39,117 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 210 transitions. [2025-04-26 16:55:39,119 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:39,119 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:39,119 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:39,119 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:39,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:39,119 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[56] L55-->L56: 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[]" "[45] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L57-->L58: 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[]" "[81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L22-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[]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L58-1-->L33-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:39,120 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-1-->L33: 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[]" "[74] L33-->L33-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< v_max2_8 .cse0) .cse0 v_max2_8)) v_max2_7)) InVars {A=v_A_6, max2=v_max2_8, j=v_j_8} OutVars{A=v_A_6, max2=v_max2_7, j=v_j_7} AuxVars[] AssignedVars[j, max2]" [2025-04-26 16:55:39,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1617824210, now seen corresponding path program 1 times [2025-04-26 16:55:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:39,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892000959] [2025-04-26 16:55:39,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:39,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:39,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:39,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:39,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:39,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:39,185 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:39,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:39,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892000959] [2025-04-26 16:55:39,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892000959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:39,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:39,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:55:39,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523449874] [2025-04-26 16:55:39,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:39,193 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:39,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:39,194 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 16:55:39,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:39,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33634975] [2025-04-26 16:55:39,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:39,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:39,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:39,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:39,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:39,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:39,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:39,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:39,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:39,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:39,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:55:39,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:55:39,250 INFO L87 Difference]: Start difference. First operand 104 states and 210 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 4 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:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:39,295 INFO L93 Difference]: Finished difference Result 106 states and 212 transitions. [2025-04-26 16:55:39,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 212 transitions. [2025-04-26 16:55:39,296 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:39,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 212 transitions. [2025-04-26 16:55:39,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-04-26 16:55:39,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 16:55:39,297 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106 states and 212 transitions. [2025-04-26 16:55:39,297 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:39,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 212 transitions. [2025-04-26 16:55:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 212 transitions. [2025-04-26 16:55:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-04-26 16:55:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.0096153846153846) internal successors, (in total 209), 103 states have internal predecessors, (209), 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:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 209 transitions. [2025-04-26 16:55:39,303 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 16:55:39,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:55:39,307 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 16:55:39,307 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:39,307 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 209 transitions. [2025-04-26 16:55:39,307 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:39,307 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:39,308 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:39,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:39,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:39,308 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[56] L55-->L56: 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[]" "[45] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L57-->L58: 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[]" "[81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-1-->L22: 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[]" "[84] L58-1-->L33-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]" "[70] L22-->L22-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[67] L22-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:39,308 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-1-->L33: 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[]" "[74] L33-->L33-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< v_max2_8 .cse0) .cse0 v_max2_8)) v_max2_7)) InVars {A=v_A_6, max2=v_max2_8, j=v_j_8} OutVars{A=v_A_6, max2=v_max2_7, j=v_j_7} AuxVars[] AssignedVars[j, max2]" [2025-04-26 16:55:39,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1387100881, now seen corresponding path program 1 times [2025-04-26 16:55:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:39,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696864040] [2025-04-26 16:55:39,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:39,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:39,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:39,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:39,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:39,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:39,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:39,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:39,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:39,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 2 times [2025-04-26 16:55:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:39,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416947892] [2025-04-26 16:55:39,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:39,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:39,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:39,336 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:39,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:39,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,336 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:39,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:39,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:39,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:39,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:39,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1564087187, now seen corresponding path program 1 times [2025-04-26 16:55:39,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:39,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122516090] [2025-04-26 16:55:39,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:39,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:39,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:39,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:39,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:39,426 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:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:39,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122516090] [2025-04-26 16:55:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122516090] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:39,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:39,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 16:55:39,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345791451] [2025-04-26 16:55:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:39,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:39,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:55:39,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:55:39,462 INFO L87 Difference]: Start difference. First operand 104 states and 209 transitions. cyclomatic complexity: 132 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:39,570 INFO L93 Difference]: Finished difference Result 154 states and 290 transitions. [2025-04-26 16:55:39,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 290 transitions. [2025-04-26 16:55:39,572 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 56 [2025-04-26 16:55:39,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 152 states and 288 transitions. [2025-04-26 16:55:39,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-04-26 16:55:39,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 16:55:39,573 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 288 transitions. [2025-04-26 16:55:39,573 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:39,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 288 transitions. [2025-04-26 16:55:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 288 transitions. [2025-04-26 16:55:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2025-04-26 16:55:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.983739837398374) internal successors, (in total 244), 122 states have internal predecessors, (244), 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:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 244 transitions. [2025-04-26 16:55:39,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 16:55:39,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:55:39,586 INFO L438 stractBuchiCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 16:55:39,586 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:39,586 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 244 transitions. [2025-04-26 16:55:39,587 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 16:55:39,587 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:39,587 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:39,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:39,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:39,588 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[56] L55-->L56: 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[]" "[45] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L57-->L58: 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[]" "[81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-1-->L22: 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[]" "[84] L58-1-->L33-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]" "[70] L22-->L22-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[68] L22-1-->L22: 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[]" "[70] L22-->L22-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[67] L22-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:39,588 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-1-->L33: 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[]" "[74] L33-->L33-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< v_max2_8 .cse0) .cse0 v_max2_8)) v_max2_7)) InVars {A=v_A_6, max2=v_max2_8, j=v_j_8} OutVars{A=v_A_6, max2=v_max2_7, j=v_j_7} AuxVars[] AssignedVars[j, max2]" [2025-04-26 16:55:39,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1564088079, now seen corresponding path program 2 times [2025-04-26 16:55:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:39,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99318293] [2025-04-26 16:55:39,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:39,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:39,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-26 16:55:39,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:39,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:39,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:39,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:39,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:39,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:39,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:39,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 3 times [2025-04-26 16:55:39,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:39,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715685252] [2025-04-26 16:55:39,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:39,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:39,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:39,608 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:39,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:39,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:39,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:39,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:39,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:39,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:39,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash -149907375, now seen corresponding path program 2 times [2025-04-26 16:55:39,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:39,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234572491] [2025-04-26 16:55:39,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:39,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:39,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-26 16:55:39,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:39,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:39,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:39,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:39,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:39,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:39,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:39,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:39,915 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:39,916 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:39,916 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:39,916 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:39,916 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:39,916 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:39,916 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:39,916 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:39,916 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-array.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:55:39,916 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:39,916 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:39,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:39,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:39,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,347 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:40,347 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:40,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:40,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:40,349 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:40,350 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:40,351 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:40,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:40,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:40,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:40,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:40,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:40,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:40,364 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:40,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:40,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:40,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:40,372 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:40,372 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:40,373 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:40,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:40,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:40,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:40,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:40,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:40,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:40,387 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:40,392 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:40,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:40,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:40,394 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:40,395 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:40,396 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:40,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:40,405 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-04-26 16:55:40,405 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:55:40,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:40,417 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2025-04-26 16:55:40,418 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:55:40,434 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:40,441 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:40,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:40,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:40,443 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:40,444 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:40,445 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:40,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:40,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:40,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:40,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:40,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:40,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:40,462 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:40,468 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:40,468 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:55:40,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:40,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:40,470 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:40,473 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:40,473 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:40,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:55:40,490 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:40,490 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:40,490 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 16:55:40,495 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:40,502 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:40,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:40,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:40,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:40,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:40,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:40,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:40,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:40,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:40,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:40,532 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:40,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:40,541 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:40,542 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:40,542 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 244 transitions. cyclomatic complexity: 148 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:40,594 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 244 transitions. cyclomatic complexity: 148. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 267 states and 557 transitions. Complement of second has 6 states. [2025-04-26 16:55:40,595 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:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 16:55:40,595 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:55:40,595 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:40,595 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:55:40,596 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:40,596 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:55:40,596 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:40,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 557 transitions. [2025-04-26 16:55:40,598 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:55:40,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 158 states and 310 transitions. [2025-04-26 16:55:40,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-04-26 16:55:40,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2025-04-26 16:55:40,600 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158 states and 310 transitions. [2025-04-26 16:55:40,600 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:40,600 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 310 transitions. [2025-04-26 16:55:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 310 transitions. [2025-04-26 16:55:40,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2025-04-26 16:55:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 2.074380165289256) internal successors, (in total 251), 120 states have internal predecessors, (251), 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:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 251 transitions. [2025-04-26 16:55:40,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 16:55:40,604 INFO L438 stractBuchiCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 16:55:40,604 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:40,604 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 251 transitions. [2025-04-26 16:55:40,605 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:55:40,605 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:40,605 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:40,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:40,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:40,606 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[56] L55-->L56: 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[]" "[45] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6} AuxVars[] AssignedVars[]" "[63] L57-->L58: 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[]" "[81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-1-->L22: 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[]" "[84] L58-1-->L33-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]" "[70] L22-->L22-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[87] L59-->L44-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]" "[67] L22-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] L33-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:40,606 INFO L754 eck$LassoCheckResult]: Loop: "[76] L44-1-->L44: 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[]" "[78] L44-->L44-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= v_max2_11 (let ((.cse0 (select v_A_8 v_k_8))) (ite (< v_max2_12 .cse0) .cse0 v_max2_12)))) InVars {A=v_A_8, k=v_k_8, max2=v_max2_12} OutVars{A=v_A_8, k=v_k_7, max2=v_max2_11} AuxVars[] AssignedVars[k, max2]" [2025-04-26 16:55:40,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1564106249, now seen corresponding path program 1 times [2025-04-26 16:55:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:40,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163696826] [2025-04-26 16:55:40,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:40,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:40,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:40,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:40,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:40,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:40,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:40,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 16:55:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:40,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512963488] [2025-04-26 16:55:40,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:40,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:40,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:40,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:40,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:40,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:40,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:40,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash -132445877, now seen corresponding path program 1 times [2025-04-26 16:55:40,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:40,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133524576] [2025-04-26 16:55:40,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:40,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:40,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:40,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:40,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:40,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:40,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:40,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:40,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:40,807 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:40,807 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:40,807 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:40,807 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:40,807 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:40,807 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:40,807 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:40,807 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:40,807 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-array.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:55:40,807 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:40,807 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:40,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:40,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:41,075 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:41,076 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:41,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:41,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:41,078 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:41,079 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:41,079 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:41,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:41,089 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:55:41,089 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:55:41,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:41,098 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:55:41,098 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:55:41,113 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:41,122 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:41,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:41,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:41,128 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:41,128 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:41,129 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:41,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:41,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:41,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:41,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:41,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:41,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:41,147 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:41,153 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:55:41,153 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:41,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:41,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:41,158 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:41,163 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:41,163 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:41,179 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:41,180 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:41,180 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:41,180 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:55:41,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:55:41,188 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:41,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:41,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:41,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:41,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:41,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:41,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:41,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:41,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:41,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:41,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:41,254 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:41,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:41,268 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:41,269 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:41,269 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 251 transitions. cyclomatic complexity: 149 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:41,309 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 251 transitions. cyclomatic complexity: 149. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 224 states and 442 transitions. Complement of second has 6 states. [2025-04-26 16:55:41,310 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:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 16:55:41,311 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:55:41,311 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:41,311 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:55:41,311 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:41,311 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:55:41,311 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:41,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 442 transitions. [2025-04-26 16:55:41,313 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:41,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2025-04-26 16:55:41,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:41,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:41,313 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:41,313 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:41,313 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:41,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:41,313 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:41,313 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:41,313 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:41,317 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:41,318 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:41,328 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:41,329 INFO L201 PluginConnector]: Adding new model max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:41 BoogieIcfgContainer [2025-04-26 16:55:41,330 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:41,330 INFO L158 Benchmark]: Toolchain (without parser) took 3819.68ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 86.0MB in the beginning and 75.1MB in the end (delta: 10.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 16:55:41,331 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:41,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.55ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:41,332 INFO L158 Benchmark]: Boogie Preprocessor took 28.73ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 83.1MB in the end (delta: 903.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:41,332 INFO L158 Benchmark]: RCFGBuilder took 213.40ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 73.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:41,333 INFO L158 Benchmark]: BuchiAutomizer took 3539.16ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 73.1MB in the beginning and 75.1MB in the end (delta: -2.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:41,335 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.22ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.55ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.73ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 83.1MB in the end (delta: 903.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 213.40ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 73.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3539.16ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 73.1MB in the beginning and 75.1MB in the end (delta: -2.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 222 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 60 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp218 ukn43 mio100 lsp64 div100 bol100 ite100 ukn100 eq158 hnf94 smp100 dnf467 smp46 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 167, Number of transitions in reduction automaton: 227, Number of states in reduction automaton: 114, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 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 -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:41,346 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...