/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/POPL2023/min-max-sample-abs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:26,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:26,658 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:21:26,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:26,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:26,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:26,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:26,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:26,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:26,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:26,689 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:26,689 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:26,689 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:26,689 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:26,689 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:26,689 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:26,689 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:26,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:26,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:26,689 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:26,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:26,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:26,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:26,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:26,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:26,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:26,692 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:26,692 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:26,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:26,692 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:26,692 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:26,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:26,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:26,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:26,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:26,693 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:26,693 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:26,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:26,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:26,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:26,945 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:26,946 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:26,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl [2025-04-26 16:21:26,949 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl' [2025-04-26 16:21:26,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:26,969 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:26,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:26,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:26,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:26,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:26,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,003 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:27,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:27,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:27,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:27,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:27,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:27,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:27,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:27,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:27,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/1) ... [2025-04-26 16:21:27,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:27,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:27,059 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:21:27,064 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:21:27,082 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2025-04-26 16:21:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2025-04-26 16:21:27,082 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2025-04-26 16:21:27,082 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:27,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:27,082 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 16:21:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 16:21:27,082 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 16:21:27,083 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2025-04-26 16:21:27,083 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2025-04-26 16:21:27,083 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2025-04-26 16:21:27,083 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2025-04-26 16:21:27,083 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2025-04-26 16:21:27,083 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2025-04-26 16:21:27,083 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:21:27,119 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:27,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:27,204 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:27,204 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:27,216 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:27,216 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:27,217 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:27 BoogieIcfgContainer [2025-04-26 16:21:27,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:27,217 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:27,217 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:27,223 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:27,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:27,224 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:26" (1/2) ... [2025-04-26 16:21:27,227 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@389c6db and model type min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:27, skipping insertion in model container [2025-04-26 16:21:27,228 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:27,228 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:27" (2/2) ... [2025-04-26 16:21:27,229 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs.bpl [2025-04-26 16:21:27,288 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:21:27,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 104 flow [2025-04-26 16:21:27,346 INFO L116 PetriNetUnfolderBase]: 3/33 cut-off events. [2025-04-26 16:21:27,348 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:21:27,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 87 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-26 16:21:27,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 104 flow [2025-04-26 16:21:27,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 84 flow [2025-04-26 16:21:27,356 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 43 places, 33 transitions, 84 flow [2025-04-26 16:21:27,366 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:27,366 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:27,366 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:27,367 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:27,367 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:27,367 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:27,367 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:27,367 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:27,369 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:27,693 INFO L131 ngComponentsAnalysis]: Automaton has 375 accepting balls. 1641 [2025-04-26 16:21:27,693 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:27,693 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:27,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:27,697 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:27,699 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:27,699 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2101 states, but on-demand construction may add more states [2025-04-26 16:21:27,733 INFO L131 ngComponentsAnalysis]: Automaton has 375 accepting balls. 1641 [2025-04-26 16:21:27,733 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:27,733 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:27,733 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:27,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:27,737 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0]" "[95] $Ultimate##0-->L30: Formula: (= (select v_A_5 0) v_array_min_4) InVars {A=v_A_5} OutVars{A=v_A_5, array_min=v_array_min_4} AuxVars[] AssignedVars[array_min]" "[96] L30-->L32-1: Formula: (= v_computeMinThread1of1ForFork0_i1_1 0) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_1} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1]" [2025-04-26 16:21:27,738 INFO L754 eck$LassoCheckResult]: Loop: "[98] L32-1-->L33: Formula: (< v_computeMinThread1of1ForFork0_i1_5 v_N_5) InVars {computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_5, N=v_N_5} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_5, N=v_N_5} AuxVars[] AssignedVars[]" "[100] L33-->L34: Formula: (= (let ((.cse0 (let ((.cse1 (select v_A_6 v_computeMinThread1of1ForFork0_i1_7))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_min_6 .cse0) v_array_min_6 .cse0)) v_array_min_5) InVars {A=v_A_6, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_7, array_min=v_array_min_6} OutVars{A=v_A_6, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_7, array_min=v_array_min_5} AuxVars[] AssignedVars[array_min]" "[101] L34-->L32-1: Formula: (= v_computeMinThread1of1ForFork0_i1_10 (+ v_computeMinThread1of1ForFork0_i1_9 1)) InVars {computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_9} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_10} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1]" [2025-04-26 16:21:27,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:27,742 INFO L85 PathProgramCache]: Analyzing trace with hash 132776, now seen corresponding path program 1 times [2025-04-26 16:21:27,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:27,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848821867] [2025-04-26 16:21:27,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:27,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:27,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:27,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:27,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:27,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:27,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:27,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:27,830 INFO L85 PathProgramCache]: Analyzing trace with hash 127170, now seen corresponding path program 1 times [2025-04-26 16:21:27,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:27,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001096799] [2025-04-26 16:21:27,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:27,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:27,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:27,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:27,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:27,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:27,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:27,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:27,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:27,865 INFO L85 PathProgramCache]: Analyzing trace with hash -339340101, now seen corresponding path program 1 times [2025-04-26 16:21:27,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:27,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431640716] [2025-04-26 16:21:27,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:27,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:27,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:27,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,880 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:27,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:27,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:27,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:28,171 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:28,172 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:28,172 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:28,172 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:28,172 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:28,172 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:28,172 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:28,172 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:28,172 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:28,172 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:28,173 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:28,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:28,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:28,505 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:28,507 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:28,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:28,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:28,510 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:21:28,512 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:21:28,513 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:21:28,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:28,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:28,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:28,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:28,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:28,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:28,555 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:28,561 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:21:28,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:28,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:28,564 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:21:28,565 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:21:28,567 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:21:28,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:28,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:28,587 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:21:28,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:28,620 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 16:21:28,620 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:21:28,655 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:28,662 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:21:28,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:28,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:28,664 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:21:28,666 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:21:28,668 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:21:28,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:28,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:28,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:28,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:28,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:28,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:28,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:28,696 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:21:28,697 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:28,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:28,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:28,703 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:21:28,704 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:21:28,705 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:28,724 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:21:28,724 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:28,725 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:28,725 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2025-04-26 16:21:28,730 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:21:28,733 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:28,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:28,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:28,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:28,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:28,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:28,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:28,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:28,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:28,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:28,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:28,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:28,782 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:28,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:28,803 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:21:28,829 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:21:28,832 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 2101 states, but on-demand construction may add more states 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:21:29,039 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 2101 states, but on-demand construction may add more states. 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 4956 states and 21390 transitions. Complement of second has 6 states. [2025-04-26 16:21:29,041 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:21:29,044 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:21:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 16:21:29,053 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:21:29,054 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:29,054 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:21:29,054 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:29,054 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:21:29,054 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:29,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4956 states and 21390 transitions. [2025-04-26 16:21:29,154 INFO L131 ngComponentsAnalysis]: Automaton has 382 accepting balls. 1386 [2025-04-26 16:21:29,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4956 states to 3760 states and 16323 transitions. [2025-04-26 16:21:29,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2131 [2025-04-26 16:21:29,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2829 [2025-04-26 16:21:29,226 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3760 states and 16323 transitions. [2025-04-26 16:21:29,226 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:29,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3760 states and 16323 transitions. [2025-04-26 16:21:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states and 16323 transitions. [2025-04-26 16:21:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3065. [2025-04-26 16:21:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3065 states, 3065 states have (on average 4.3938009787928225) internal successors, (in total 13467), 3064 states have internal predecessors, (13467), 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:21:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 13467 transitions. [2025-04-26 16:21:29,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3065 states and 13467 transitions. [2025-04-26 16:21:29,389 INFO L438 stractBuchiCegarLoop]: Abstraction has 3065 states and 13467 transitions. [2025-04-26 16:21:29,389 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:29,389 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3065 states and 13467 transitions. [2025-04-26 16:21:29,412 INFO L131 ngComponentsAnalysis]: Automaton has 382 accepting balls. 1386 [2025-04-26 16:21:29,413 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:29,413 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:29,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:29,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:29,413 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0]" "[107] L77-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1]" "[78] $Ultimate##0-->L44: Formula: (= (select v_A_1 0) v_array_max_1) InVars {A=v_A_1} OutVars{A=v_A_1, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[79] L44-->L46-1: Formula: (= v_computeMaxThread1of1ForFork1_i2_1 0) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_1} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2]" [2025-04-26 16:21:29,414 INFO L754 eck$LassoCheckResult]: Loop: "[81] L46-1-->L47: Formula: (< v_computeMaxThread1of1ForFork1_i2_5 v_N_1) InVars {computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_5, N=v_N_1} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_5, N=v_N_1} AuxVars[] AssignedVars[]" "[83] L47-->L48: Formula: (= (let ((.cse0 (let ((.cse1 (select v_A_2 v_computeMaxThread1of1ForFork1_i2_7))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_max_3 .cse0) .cse0 v_array_max_3)) v_array_max_2) InVars {A=v_A_2, array_max=v_array_max_3, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_7} OutVars{A=v_A_2, array_max=v_array_max_2, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_7} AuxVars[] AssignedVars[array_max]" "[84] L48-->L46-1: Formula: (= v_computeMaxThread1of1ForFork1_i2_10 (+ v_computeMaxThread1of1ForFork1_i2_9 1)) InVars {computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_9} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_10} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2]" [2025-04-26 16:21:29,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash 4127109, now seen corresponding path program 1 times [2025-04-26 16:21:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:29,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789909178] [2025-04-26 16:21:29,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:29,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:29,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:29,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:29,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:29,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:29,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:29,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:29,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:29,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:29,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:29,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash 110289, now seen corresponding path program 1 times [2025-04-26 16:21:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:29,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602977714] [2025-04-26 16:21:29,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:29,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:29,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:29,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:29,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:29,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:29,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:29,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:29,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:29,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:29,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:29,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:29,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1603266867, now seen corresponding path program 1 times [2025-04-26 16:21:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:29,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251911282] [2025-04-26 16:21:29,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:29,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:29,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:29,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:29,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:29,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:29,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:29,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:29,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:29,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:29,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:29,685 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:29,685 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:29,685 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:29,685 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:29,685 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:29,685 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:29,685 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:29,685 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:29,686 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:29,686 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:29,686 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:29,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:29,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:29,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:29,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:29,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:29,990 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:29,991 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:29,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:29,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:29,993 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:21:29,994 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:21:29,996 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:21:30,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:30,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:30,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:30,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:30,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:30,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:30,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:30,008 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:30,032 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:21:30,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:30,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:30,034 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:21:30,035 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:21:30,038 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:21:30,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:30,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:30,049 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-04-26 16:21:30,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:30,092 INFO L402 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2025-04-26 16:21:30,093 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2025-04-26 16:21:30,161 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:30,168 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:21:30,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:30,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:30,172 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:21:30,172 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:21:30,174 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:21:30,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:30,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:30,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:30,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:30,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:30,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:30,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:30,198 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:30,198 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:30,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:30,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:30,200 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:21:30,202 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:21:30,203 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:30,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:21:30,220 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:30,220 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:30,220 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMaxThread1of1ForFork1_i2, N) = -1*computeMaxThread1of1ForFork1_i2 + 1*N Supporting invariants [] [2025-04-26 16:21:30,226 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:21:30,227 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:30,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:30,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:30,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:30,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:30,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:30,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:30,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:30,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:30,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:30,256 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:30,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:30,273 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:21:30,273 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:21:30,274 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3065 states and 13467 transitions. cyclomatic complexity: 10895 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:21:30,441 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3065 states and 13467 transitions. cyclomatic complexity: 10895. 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 8212 states and 39134 transitions. Complement of second has 6 states. [2025-04-26 16:21:30,442 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:21:30,442 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:21:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 16:21:30,443 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:21:30,443 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:30,443 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:21:30,443 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:30,443 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:21:30,443 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:30,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8212 states and 39134 transitions. [2025-04-26 16:21:30,610 INFO L131 ngComponentsAnalysis]: Automaton has 300 accepting balls. 900 [2025-04-26 16:21:30,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8212 states to 5394 states and 25653 transitions. [2025-04-26 16:21:30,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2113 [2025-04-26 16:21:30,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2717 [2025-04-26 16:21:30,676 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5394 states and 25653 transitions. [2025-04-26 16:21:30,676 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:30,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5394 states and 25653 transitions. [2025-04-26 16:21:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states and 25653 transitions. [2025-04-26 16:21:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 4431. [2025-04-26 16:21:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 4431 states have (on average 4.761227713834349) internal successors, (in total 21097), 4430 states have internal predecessors, (21097), 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:21:30,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 21097 transitions. [2025-04-26 16:21:30,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4431 states and 21097 transitions. [2025-04-26 16:21:30,844 INFO L438 stractBuchiCegarLoop]: Abstraction has 4431 states and 21097 transitions. [2025-04-26 16:21:30,845 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:30,845 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4431 states and 21097 transitions. [2025-04-26 16:21:30,868 INFO L131 ngComponentsAnalysis]: Automaton has 300 accepting balls. 900 [2025-04-26 16:21:30,868 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:30,868 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:30,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:30,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:30,869 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0]" "[107] L77-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1]" "[110] L78-->$Ultimate##0: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1]" "[113] L79-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j]" "[89] $Ultimate##0-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j]" [2025-04-26 16:21:30,869 INFO L754 eck$LassoCheckResult]: Loop: "[91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[93] L59-->L60: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A]" "[94] L60-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j]" [2025-04-26 16:21:30,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:30,870 INFO L85 PathProgramCache]: Analyzing trace with hash 127972274, now seen corresponding path program 1 times [2025-04-26 16:21:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:30,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865884786] [2025-04-26 16:21:30,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:30,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:30,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:30,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:30,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:30,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:30,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:30,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 120219, now seen corresponding path program 1 times [2025-04-26 16:21:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:30,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794733595] [2025-04-26 16:21:30,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:30,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:30,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:30,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:30,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:30,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:30,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:30,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1508853686, now seen corresponding path program 1 times [2025-04-26 16:21:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:30,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035954453] [2025-04-26 16:21:30,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:30,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:30,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:30,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:30,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:30,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:30,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:30,990 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:30,990 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:30,990 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:30,990 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:30,990 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:30,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:30,990 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:30,990 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:30,990 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:30,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:30,990 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:30,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,123 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:31,123 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:31,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,126 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:21:31,127 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:21:31,128 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:21:31,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:31,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:31,145 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,151 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:21:31,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,153 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:21:31,154 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:21:31,156 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:21:31,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:31,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:31,169 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:31,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,179 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:21:31,180 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:21:31,181 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:21:31,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:31,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:31,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:31,192 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,198 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:21:31,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,200 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:21:31,201 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:21:31,202 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:21:31,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:31,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:31,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:31,214 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:31,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,222 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:21:31,224 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:21:31,226 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:21:31,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:31,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:31,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:31,250 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:21:31,251 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,252 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:21:31,254 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:21:31,255 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:31,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:31,270 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:31,271 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:31,271 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(mapAbsThread1of1ForFork3_j, N) = -1*mapAbsThread1of1ForFork3_j + 1*N Supporting invariants [] [2025-04-26 16:21:31,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:31,276 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:31,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:31,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:31,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:31,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:31,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:31,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:31,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:31,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:31,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:31,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:31,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:31,300 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:31,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:31,312 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:21:31,313 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:21:31,313 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4431 states and 21097 transitions. cyclomatic complexity: 17233 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:31,475 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4431 states and 21097 transitions. cyclomatic complexity: 17233. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 11735 states and 57362 transitions. Complement of second has 6 states. [2025-04-26 16:21:31,479 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:21:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-04-26 16:21:31,480 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:31,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:31,480 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:21:31,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:31,480 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:21:31,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:31,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11735 states and 57362 transitions. [2025-04-26 16:21:31,709 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:31,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11735 states to 0 states and 0 transitions. [2025-04-26 16:21:31,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:31,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:31,709 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:31,709 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:31,709 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:31,709 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:31,710 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:31,710 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:31,710 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:31,710 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:31,710 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:31,715 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:31 BoogieIcfgContainer [2025-04-26 16:21:31,716 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:31,716 INFO L158 Benchmark]: Toolchain (without parser) took 4747.42ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 85.0MB in the beginning and 87.6MB in the end (delta: -2.6MB). Peak memory consumption was 100.8MB. Max. memory is 8.0GB. [2025-04-26 16:21:31,716 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.72ms. Allocated memory is still 155.2MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:31,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.22ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 83.1MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:31,717 INFO L158 Benchmark]: Boogie Preprocessor took 26.59ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 82.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:31,717 INFO L158 Benchmark]: RCFGBuilder took 183.97ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 72.5MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:31,719 INFO L158 Benchmark]: BuchiAutomizer took 4498.26ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 72.5MB in the beginning and 87.6MB in the end (delta: -15.1MB). Peak memory consumption was 88.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:31,719 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.72ms. Allocated memory is still 155.2MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.22ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 83.1MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.59ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 82.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 183.97ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 72.5MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4498.26ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 72.5MB in the beginning and 87.6MB in the end (delta: -15.1MB). Peak memory consumption was 88.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.3s AutomataMinimizationTime, 2 MinimizatonAttempts, 1658 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.6s 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, 223 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 299 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 154 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp421 ukn15 mio100 lsp87 div100 bol100 ite100 ukn100 eq157 hnf97 smp100 dnf328 smp53 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 128ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i2 and consists of 4 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:21:31,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...