/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-le-max.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:23,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:23,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:23:23,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:23,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:23,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:23,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:23,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:23,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:23,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:23,115 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:23,115 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:23,115 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:23,115 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:23,115 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:23,115 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:23,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:23,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:23,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:23,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:23,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:23,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:23,117 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:23,117 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:23,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:23,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:23,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:23,350 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:23,351 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:23,352 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/min-le-max.wvr.bpl [2025-04-26 16:23:23,352 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-le-max.wvr.bpl' [2025-04-26 16:23:23,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:23,372 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:23,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:23,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:23,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:23,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,406 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:23,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:23,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:23,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:23,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:23,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:23,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:23,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:23,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:23,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/1) ... [2025-04-26 16:23:23,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:23,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:23,462 INFO L229 MonitoredProcess]: Starting monitored process 1 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:23:23,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:23:23,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:23,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:23,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:23,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:23,487 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:23,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:23,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:23,487 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:23,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:23,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:23,488 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:23:23,523 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:23,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:23,612 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:23,612 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:23,621 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:23,621 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:23,621 INFO L201 PluginConnector]: Adding new model min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:23 BoogieIcfgContainer [2025-04-26 16:23:23,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:23,622 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:23,622 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:23,628 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:23,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:23,629 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:23" (1/2) ... [2025-04-26 16:23:23,631 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18206eed and model type min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:23, skipping insertion in model container [2025-04-26 16:23:23,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:23,632 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:23" (2/2) ... [2025-04-26 16:23:23,633 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-le-max.wvr.bpl [2025-04-26 16:23:23,684 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:23:23,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 79 flow [2025-04-26 16:23:23,740 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-26 16:23:23,743 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:23:23,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 2/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:23:23,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 29 transitions, 79 flow [2025-04-26 16:23:23,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 23 transitions, 64 flow [2025-04-26 16:23:23,752 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 31 places, 23 transitions, 64 flow [2025-04-26 16:23:23,761 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:23,761 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:23,761 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:23,761 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:23,761 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:23,761 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:23,761 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:23,762 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:23,763 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:23,822 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 96 [2025-04-26 16:23:23,822 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:23,822 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:23,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:23:23,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:23,827 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:23,827 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 129 states, but on-demand construction may add more states [2025-04-26 16:23:23,834 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 96 [2025-04-26 16:23:23,835 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:23,835 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:23,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:23:23,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:23,843 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L45: Formula: (let ((.cse0 (select v_A_3 0))) (and (= v_min_3 .cse0) (= v_i_6 0) (= v_j_6 v_i_6) (not v_v_assert_1) (= v_max_3 .cse0))) InVars {A=v_A_3, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3, j=v_j_6} OutVars{A=v_A_3, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3, j=v_j_6} AuxVars[] AssignedVars[]" "[66] L45-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:23,843 INFO L754 eck$LassoCheckResult]: Loop: "[53] L20-->L21: 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[]" "[55] L21-->L22: Formula: (= (let ((.cse0 (select v_A_1 v_i_2))) (ite (< v_min_2 .cse0) v_min_2 .cse0)) v_min_1) InVars {A=v_A_1, i=v_i_2, min=v_min_2} OutVars{A=v_A_1, i=v_i_2, min=v_min_1} AuxVars[] AssignedVars[min]" "[56] L22-->L20: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 16:23:23,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:23,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2484, now seen corresponding path program 1 times [2025-04-26 16:23:23,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:23,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727782282] [2025-04-26 16:23:23,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:23,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:23,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:23,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:23,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:23,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:23,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:23,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:23,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:23,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:23,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:23,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:23,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash 82485, now seen corresponding path program 1 times [2025-04-26 16:23:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:23,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614766714] [2025-04-26 16:23:23,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:23,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:23,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:23,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:23,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:23,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:23,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:23,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:23,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:23,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:23,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:23,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:23,945 INFO L85 PathProgramCache]: Analyzing trace with hash 74053538, now seen corresponding path program 1 times [2025-04-26 16:23:23,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:23,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446106945] [2025-04-26 16:23:23,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:23,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:23,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:23,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:23,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:23,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:23,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:23,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:23,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:23,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:23,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:24,114 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:24,114 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:24,114 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:24,114 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:24,115 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:24,115 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,115 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:24,115 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:24,115 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-le-max.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:24,115 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:24,115 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:24,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,343 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:24,345 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:24,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:24,348 INFO L229 MonitoredProcess]: Starting monitored process 2 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:23:24,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:23:24,350 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:23:24,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:24,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:24,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:24,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:24,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:24,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:24,373 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:24,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:23:24,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:24,382 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:23:24,383 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:23:24,384 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:23:24,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:24,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:24,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:24,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:24,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:24,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:24,401 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:24,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:24,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:24,409 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:23:24,411 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:23:24,412 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:23:24,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:24,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:24,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:24,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:24,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:24,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:24,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:24,439 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:24,439 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:23:24,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:24,443 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:23:24,444 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:23:24,446 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:24,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:24,464 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:24,464 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:24,464 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:23:24,471 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:23:24,474 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:24,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:24,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:24,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:24,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:24,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:24,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:24,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:24,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:24,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:24,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:24,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:24,565 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:23:24,633 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:23:24,637 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 129 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:24,731 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 129 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 336 states and 990 transitions. Complement of second has 7 states. [2025-04-26 16:23:24,734 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:23:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2025-04-26 16:23:24,745 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:23:24,745 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:24,745 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:23:24,745 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:24,745 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:23:24,745 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:24,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 336 states and 990 transitions. [2025-04-26 16:23:24,754 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 69 [2025-04-26 16:23:24,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 336 states to 163 states and 487 transitions. [2025-04-26 16:23:24,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-04-26 16:23:24,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2025-04-26 16:23:24,760 INFO L74 IsDeterministic]: Start isDeterministic. Operand 163 states and 487 transitions. [2025-04-26 16:23:24,760 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:24,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 487 transitions. [2025-04-26 16:23:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 487 transitions. [2025-04-26 16:23:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 127. [2025-04-26 16:23:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 2.9606299212598426) internal successors, (in total 376), 126 states have internal predecessors, (376), 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:23:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 376 transitions. [2025-04-26 16:23:24,788 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 376 transitions. [2025-04-26 16:23:24,792 INFO L438 stractBuchiCegarLoop]: Abstraction has 127 states and 376 transitions. [2025-04-26 16:23:24,792 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:24,792 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 376 transitions. [2025-04-26 16:23:24,793 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 69 [2025-04-26 16:23:24,793 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:24,794 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:24,794 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:23:24,794 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:24,794 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L45: Formula: (let ((.cse0 (select v_A_3 0))) (and (= v_min_3 .cse0) (= v_i_6 0) (= v_j_6 v_i_6) (not v_v_assert_1) (= v_max_3 .cse0))) InVars {A=v_A_3, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3, j=v_j_6} OutVars{A=v_A_3, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3, j=v_j_6} AuxVars[] AssignedVars[]" "[66] L45-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[69] L45-1-->L29: 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:23:24,794 INFO L754 eck$LassoCheckResult]: Loop: "[58] L29-->L30: Formula: (< v_j_1 v_N_3) InVars {N=v_N_3, j=v_j_1} OutVars{N=v_N_3, j=v_j_1} AuxVars[] AssignedVars[]" "[60] L30-->L31: Formula: (= (let ((.cse0 (select v_A_2 v_j_2))) (ite (< .cse0 v_max_2) v_max_2 .cse0)) v_max_1) InVars {A=v_A_2, max=v_max_2, j=v_j_2} OutVars{A=v_A_2, max=v_max_1, j=v_j_2} AuxVars[] AssignedVars[max]" "[61] L31-->L29: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 16:23:24,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash 77073, now seen corresponding path program 1 times [2025-04-26 16:23:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:24,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446065182] [2025-04-26 16:23:24,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:24,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:24,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:24,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:24,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:24,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:24,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:24,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash 87450, now seen corresponding path program 1 times [2025-04-26 16:23:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:24,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034695792] [2025-04-26 16:23:24,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:24,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:24,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:24,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:24,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:24,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:24,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:24,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1998827894, now seen corresponding path program 1 times [2025-04-26 16:23:24,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:24,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457270091] [2025-04-26 16:23:24,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:24,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:24,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:24,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:24,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:24,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:24,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:24,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:24,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:24,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:24,922 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:24,922 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:24,922 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:24,922 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:24,922 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:24,922 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:24,923 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:24,923 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:24,923 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-le-max.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:23:24,923 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:24,923 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:24,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:24,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:25,088 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:25,088 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:25,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:25,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:25,091 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:23:25,092 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:23:25,093 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:23:25,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:25,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:25,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:25,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:25,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:25,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:25,109 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:25,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:23:25,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:25,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:25,117 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:23:25,118 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:23:25,119 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:23:25,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:25,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:25,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:25,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:25,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:25,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:25,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:25,141 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:23:25,141 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:23:25,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:25,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:25,143 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:23:25,145 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:23:25,146 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:25,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:25,163 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:25,164 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:25,164 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, j) = 1*N - 1*j Supporting invariants [] [2025-04-26 16:23:25,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:25,170 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:25,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:25,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:25,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:25,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:25,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:25,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:25,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:25,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:25,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:25,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:25,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:25,200 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:25,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:25,216 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:23:25,216 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:23:25,217 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 127 states and 376 transitions. cyclomatic complexity: 277 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:23:25,252 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 127 states and 376 transitions. cyclomatic complexity: 277. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 363 states and 1128 transitions. Complement of second has 6 states. [2025-04-26 16:23:25,253 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:23:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:23:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-04-26 16:23:25,254 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:23:25,254 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:25,254 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:23:25,254 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:25,254 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:23:25,254 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:25,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 1128 transitions. [2025-04-26 16:23:25,259 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:25,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 0 states and 0 transitions. [2025-04-26 16:23:25,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:25,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:25,259 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:25,259 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:25,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:25,259 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:25,259 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:25,259 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:25,259 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:25,260 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:25,260 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:25,265 INFO L201 PluginConnector]: Adding new model min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:25 BoogieIcfgContainer [2025-04-26 16:23:25,265 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:25,265 INFO L158 Benchmark]: Toolchain (without parser) took 1893.05ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.0MB in the beginning and 64.6MB in the end (delta: 20.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2025-04-26 16:23:25,266 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:25,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.78ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 83.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:25,266 INFO L158 Benchmark]: Boogie Preprocessor took 26.03ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 82.1MB in the end (delta: 931.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:25,266 INFO L158 Benchmark]: RCFGBuilder took 186.34ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 72.9MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:25,266 INFO L158 Benchmark]: BuchiAutomizer took 1642.59ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.8MB in the beginning and 64.6MB in the end (delta: 8.2MB). Peak memory consumption was 970.6kB. Max. memory is 8.0GB. [2025-04-26 16:23:25,267 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.21ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.78ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 83.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.03ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 82.1MB in the end (delta: 931.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 186.34ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 72.9MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1642.59ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.8MB in the beginning and 64.6MB in the end (delta: 8.2MB). Peak memory consumption was 970.6kB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 36 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 30 mSDtfsCounter, 65 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital59 mio100 ax100 hnf100 lsp117 ukn57 mio100 lsp67 div100 bol100 ite100 ukn100 eq174 hnf93 smp100 dnf145 smp65 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:25,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...