/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:31,442 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:31,516 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:12:31,536 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:31,541 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:31,542 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:31,544 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:31,544 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:31,545 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:31,548 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:31,548 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:31,548 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:31,548 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:31,549 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:31,549 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:31,550 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:31,550 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:31,550 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:31,550 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:31,550 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:31,550 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:31,552 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:31,552 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:31,552 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:31,552 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:31,552 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:31,553 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:31,553 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:31,553 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:31,553 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:31,554 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:31,554 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:31,554 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:31,556 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:31,556 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:12:31,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:31,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:31,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:31,735 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:31,736 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:31,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl [2023-10-12 17:12:31,737 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl' [2023-10-12 17:12:31,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:31,765 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:31,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:31,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:31,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:31,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,795 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:31,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:31,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:31,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:31,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:31,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:31,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:31,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:31,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:31,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:31,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:31,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:31,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:12:31,885 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:12:31,885 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:12:31,885 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:12:31,885 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:31,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:31,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:31,885 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:12:31,885 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:12:31,885 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:12:31,885 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2023-10-12 17:12:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2023-10-12 17:12:31,886 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2023-10-12 17:12:31,886 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:12:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:12:31,886 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:12:31,886 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:12:31,922 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:31,923 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:32,010 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:32,015 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:32,016 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:12:32,017 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:32 BoogieIcfgContainer [2023-10-12 17:12:32,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:32,018 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:32,018 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:32,022 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:32,023 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:32,023 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/2) ... [2023-10-12 17:12:32,024 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74336b92 and model type min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:32, skipping insertion in model container [2023-10-12 17:12:32,024 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:32,024 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:32" (2/2) ... [2023-10-12 17:12:32,025 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs-nonatomic.bpl [2023-10-12 17:12:32,082 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:12:32,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 126 flow [2023-10-12 17:12:32,125 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2023-10-12 17:12:32,125 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:12:32,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 6/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 97 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-10-12 17:12:32,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 47 transitions, 126 flow [2023-10-12 17:12:32,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 102 flow [2023-10-12 17:12:32,135 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:32,157 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 102 flow [2023-10-12 17:12:32,159 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 102 flow [2023-10-12 17:12:32,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 102 flow [2023-10-12 17:12:32,168 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2023-10-12 17:12:32,168 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:12:32,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 6/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 97 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-10-12 17:12:32,170 INFO L119 LiptonReduction]: Number of co-enabled transitions 738 [2023-10-12 17:12:32,543 INFO L134 LiptonReduction]: Checked pairs total: 878 [2023-10-12 17:12:32,543 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-10-12 17:12:32,556 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:32,556 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:32,556 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:32,556 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:32,556 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:32,556 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:32,556 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:32,556 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:32,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:32,611 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 133 [2023-10-12 17:12:32,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:32,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:32,615 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:32,615 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:32,616 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:32,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 162 states, but on-demand construction may add more states [2023-10-12 17:12:32,622 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 133 [2023-10-12 17:12:32,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:32,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:32,623 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:32,623 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:32,626 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]don't care [131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 56#[$Ultimate##0, L79]don't care [156] $Ultimate##0-->L28-1: Formula: (and (= v_computeMinThread1of1ForFork0_i1_27 0) (= (select v_A_49 0) v_array_min_23)) InVars {A=v_A_49} OutVars{A=v_A_49, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_27, array_min=v_array_min_23} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 60#[L28-1, L79]don't care [2023-10-12 17:12:32,626 INFO L750 eck$LassoCheckResult]: Loop: 60#[L28-1, L79]don't care [165] L28-1-->L28-1: Formula: (let ((.cse1 (= (+ v_computeMinThread1of1ForFork0_i1_In_1 1) v_computeMinThread1of1ForFork0_i1_Out_2)) (.cse2 (< v_computeMinThread1of1ForFork0_i1_In_1 v_N_In_3)) (.cse0 (let ((.cse3 (select v_A_In_3 v_computeMinThread1of1ForFork0_i1_In_1))) (ite (< .cse3 0) (- .cse3) .cse3)))) (or (and (<= v_array_min_In_1 .cse0) .cse1 (= v_array_min_Out_2 v_array_min_In_1) .cse2) (and .cse1 (= v_array_min_Out_2 .cse0) .cse2 (< .cse0 v_array_min_In_1)))) InVars {A=v_A_In_3, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_In_1, array_min=v_array_min_In_1, N=v_N_In_3} OutVars{A=v_A_In_3, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_Out_2, array_min=v_array_min_Out_2, N=v_N_In_3} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 60#[L28-1, L79]don't care [2023-10-12 17:12:32,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash 5178, now seen corresponding path program 1 times [2023-10-12 17:12:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:32,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889604640] [2023-10-12 17:12:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:32,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:32,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 1 times [2023-10-12 17:12:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:32,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033173555] [2023-10-12 17:12:32,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:32,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:32,713 INFO L85 PathProgramCache]: Analyzing trace with hash 160683, now seen corresponding path program 1 times [2023-10-12 17:12:32,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:32,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646990612] [2023-10-12 17:12:32,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:32,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:32,900 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:32,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:32,900 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:32,900 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:32,900 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:32,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:32,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:32,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:32,901 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-nonatomic.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:12:32,901 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:32,901 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:32,916 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:32,928 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:33,181 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:33,184 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:33,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:33,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:33,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:33,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:12:33,265 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 [2023-10-12 17:12:33,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:33,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:33,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:33,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:33,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:33,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:33,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:33,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:33,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:33,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:33,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:33,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:12:33,316 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 [2023-10-12 17:12:33,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:33,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:33,322 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:12:33,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:33,349 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:12:33,349 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:12:33,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:33,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:33,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:33,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:33,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:33,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:12:33,426 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 [2023-10-12 17:12:33,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:33,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:33,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:33,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:33,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:33,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:33,453 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:33,459 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:12:33,459 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:33,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:33,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:33,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:33,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:12:33,513 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:33,535 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:33,536 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:33,536 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2023-10-12 17:12:33,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:12:33,553 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:33,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:33,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:33,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:33,595 WARN L260 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:12:33,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:33,624 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:33,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 162 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:33,718 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 162 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 440 states and 2010 transitions. Complement of second has 4 states. [2023-10-12 17:12:33,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2023-10-12 17:12:33,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:12:33,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:33,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:33,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:33,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:12:33,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:33,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 2010 transitions. [2023-10-12 17:12:33,745 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 124 [2023-10-12 17:12:33,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 344 states and 1581 transitions. [2023-10-12 17:12:33,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2023-10-12 17:12:33,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2023-10-12 17:12:33,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 344 states and 1581 transitions. [2023-10-12 17:12:33,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:33,758 INFO L219 hiAutomatonCegarLoop]: Abstraction has 344 states and 1581 transitions. [2023-10-12 17:12:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states and 1581 transitions. [2023-10-12 17:12:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 269. [2023-10-12 17:12:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 269 states have (on average 4.825278810408922) internal successors, (1298), 268 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 1298 transitions. [2023-10-12 17:12:33,798 INFO L241 hiAutomatonCegarLoop]: Abstraction has 269 states and 1298 transitions. [2023-10-12 17:12:33,798 INFO L430 stractBuchiCegarLoop]: Abstraction has 269 states and 1298 transitions. [2023-10-12 17:12:33,798 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:33,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 1298 transitions. [2023-10-12 17:12:33,802 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 124 [2023-10-12 17:12:33,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:33,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:33,802 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:33,802 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:33,803 INFO L748 eck$LassoCheckResult]: Stem: 1089#[$Ultimate##0]don't care [131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 1063#[$Ultimate##0, L79]don't care [134] L79-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 1031#[$Ultimate##0, L80, $Ultimate##0]don't care [146] $Ultimate##0-->L44-1: Formula: (and (= (select v_A_15 0) v_array_max_12) (= v_computeMaxThread1of1ForFork1_i2_19 0)) InVars {A=v_A_15} OutVars{A=v_A_15, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_19, array_max=v_array_max_12} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 1033#[L44-1, L80, $Ultimate##0]don't care [2023-10-12 17:12:33,803 INFO L750 eck$LassoCheckResult]: Loop: 1033#[L44-1, L80, $Ultimate##0]don't care [163] L44-1-->L44-1: Formula: (let ((.cse0 (< v_computeMaxThread1of1ForFork1_i2_In_1 v_N_In_1)) (.cse1 (= v_computeMaxThread1of1ForFork1_i2_Out_2 (+ v_computeMaxThread1of1ForFork1_i2_In_1 1))) (.cse2 (let ((.cse3 (select v_A_In_1 v_computeMaxThread1of1ForFork1_i2_In_1))) (ite (< .cse3 0) (- .cse3) .cse3)))) (or (and .cse0 (= v_array_max_In_1 v_array_max_Out_2) .cse1 (<= .cse2 v_array_max_In_1)) (and (< v_array_max_In_1 .cse2) .cse0 .cse1 (= v_array_max_Out_2 .cse2)))) InVars {A=v_A_In_1, N=v_N_In_1, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_In_1, array_max=v_array_max_In_1} OutVars{A=v_A_In_1, N=v_N_In_1, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_Out_2, array_max=v_array_max_Out_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 1033#[L44-1, L80, $Ultimate##0]don't care [2023-10-12 17:12:33,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash 159982, now seen corresponding path program 1 times [2023-10-12 17:12:33,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:33,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951096661] [2023-10-12 17:12:33,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:33,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:33,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 194, now seen corresponding path program 1 times [2023-10-12 17:12:33,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:33,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335288579] [2023-10-12 17:12:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:33,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash 4959605, now seen corresponding path program 1 times [2023-10-12 17:12:33,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:33,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4820913] [2023-10-12 17:12:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:33,982 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:33,982 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:33,982 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:33,982 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:33,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:33,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:33,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:33,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:33,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-nonatomic.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:12:33,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:33,984 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:33,986 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:33,988 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:34,048 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:34,051 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:34,053 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:34,210 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:34,210 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:34,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,221 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:34,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:12:34,225 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 [2023-10-12 17:12:34,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:34,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:34,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:34,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:34,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:34,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:34,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:34,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:34,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:34,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,390 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:34,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:12:34,394 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 [2023-10-12 17:12:34,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:34,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:34,400 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:12:34,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:34,434 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:12:34,434 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:12:34,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:34,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:34,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:34,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:12:34,498 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 [2023-10-12 17:12:34,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:34,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:34,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:34,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:34,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:34,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:34,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:34,537 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:34,537 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:34,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,540 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:34,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:12:34,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:34,551 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:34,551 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:34,551 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, computeMaxThread1of1ForFork1_i2) = 1*N - 1*computeMaxThread1of1ForFork1_i2 Supporting invariants [] [2023-10-12 17:12:34,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:34,557 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:34,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:34,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:34,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:34,598 WARN L260 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:12:34,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:34,600 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:34,601 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 269 states and 1298 transitions. cyclomatic complexity: 1132 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:34,653 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 269 states and 1298 transitions. cyclomatic complexity: 1132. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 798 states and 4068 transitions. Complement of second has 4 states. [2023-10-12 17:12:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2023-10-12 17:12:34,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:34,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:34,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:34,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:34,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:12:34,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:34,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 798 states and 4068 transitions. [2023-10-12 17:12:34,671 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 110 [2023-10-12 17:12:34,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 798 states to 618 states and 3098 transitions. [2023-10-12 17:12:34,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2023-10-12 17:12:34,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331 [2023-10-12 17:12:34,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 618 states and 3098 transitions. [2023-10-12 17:12:34,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:34,688 INFO L219 hiAutomatonCegarLoop]: Abstraction has 618 states and 3098 transitions. [2023-10-12 17:12:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states and 3098 transitions. [2023-10-12 17:12:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 474. [2023-10-12 17:12:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 474 states have (on average 5.187763713080169) internal successors, (2459), 473 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 2459 transitions. [2023-10-12 17:12:34,727 INFO L241 hiAutomatonCegarLoop]: Abstraction has 474 states and 2459 transitions. [2023-10-12 17:12:34,727 INFO L430 stractBuchiCegarLoop]: Abstraction has 474 states and 2459 transitions. [2023-10-12 17:12:34,727 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:34,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 474 states and 2459 transitions. [2023-10-12 17:12:34,731 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 110 [2023-10-12 17:12:34,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:34,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:34,732 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:34,732 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:34,732 INFO L748 eck$LassoCheckResult]: Stem: 2529#[$Ultimate##0]don't care [131] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 2493#[$Ultimate##0, L79]don't care [134] L79-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 2449#[$Ultimate##0, L80, $Ultimate##0]don't care [137] L80-->L68: 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] 2447#[$Ultimate##0, L68, $Ultimate##0, L81]don't care [2023-10-12 17:12:34,732 INFO L750 eck$LassoCheckResult]: Loop: 2447#[$Ultimate##0, L68, $Ultimate##0, L81]don't care [117] L68-->L70: Formula: (= v_array_min_3 v_sampleThread1of1ForFork2_min_l_1) InVars {array_min=v_array_min_3} OutVars{array_min=v_array_min_3, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_min_l] 2439#[L70, $Ultimate##0, $Ultimate##0, L81]don't care [157] L70-->L68: Formula: (and (= (+ v_sampleThread1of1ForFork2_diff_5 v_sampleThread1of1ForFork2_min_l_9) v_sampleThread1of1ForFork2_max_l_13) (= v_array_max_31 v_sampleThread1of1ForFork2_max_l_13)) InVars {array_max=v_array_max_31, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_9} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_5, array_max=v_array_max_31, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_9, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_13} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_max_l] 2447#[$Ultimate##0, L68, $Ultimate##0, L81]don't care [2023-10-12 17:12:34,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash 159973, now seen corresponding path program 1 times [2023-10-12 17:12:34,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:34,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145731321] [2023-10-12 17:12:34,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:34,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:34,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:34,738 INFO L85 PathProgramCache]: Analyzing trace with hash 4745, now seen corresponding path program 1 times [2023-10-12 17:12:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:34,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483092651] [2023-10-12 17:12:34,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:34,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:34,742 INFO L85 PathProgramCache]: Analyzing trace with hash 153737837, now seen corresponding path program 1 times [2023-10-12 17:12:34,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:34,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079357557] [2023-10-12 17:12:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,817 INFO L201 PluginConnector]: Adding new model min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:34 BoogieIcfgContainer [2023-10-12 17:12:34,817 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:34,817 INFO L158 Benchmark]: Toolchain (without parser) took 3051.97ms. Allocated memory was 187.7MB in the beginning and 356.5MB in the end (delta: 168.8MB). Free memory was 139.1MB in the beginning and 164.1MB in the end (delta: -24.9MB). Peak memory consumption was 145.8MB. Max. memory is 8.0GB. [2023-10-12 17:12:34,818 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 187.7MB. Free memory was 140.4MB in the beginning and 140.2MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:34,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.69ms. Allocated memory is still 187.7MB. Free memory was 139.1MB in the beginning and 137.5MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:12:34,821 INFO L158 Benchmark]: Boogie Preprocessor took 19.57ms. Allocated memory is still 187.7MB. Free memory was 137.5MB in the beginning and 136.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:34,821 INFO L158 Benchmark]: RCFGBuilder took 198.83ms. Allocated memory is still 187.7MB. Free memory was 136.3MB in the beginning and 126.2MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:34,823 INFO L158 Benchmark]: BuchiAutomizer took 2798.90ms. Allocated memory was 187.7MB in the beginning and 356.5MB in the end (delta: 168.8MB). Free memory was 126.0MB in the beginning and 164.1MB in the end (delta: -38.1MB). Peak memory consumption was 131.2MB. Max. memory is 8.0GB. [2023-10-12 17:12:34,828 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22ms. Allocated memory is still 187.7MB. Free memory was 140.4MB in the beginning and 140.2MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.69ms. Allocated memory is still 187.7MB. Free memory was 139.1MB in the beginning and 137.5MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.57ms. Allocated memory is still 187.7MB. Free memory was 137.5MB in the beginning and 136.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 198.83ms. Allocated memory is still 187.7MB. Free memory was 136.3MB in the beginning and 126.2MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2798.90ms. Allocated memory was 187.7MB in the beginning and 356.5MB in the end (delta: 168.8MB). Free memory was 126.0MB in the beginning and 164.1MB in the end (delta: -38.1MB). Peak memory consumption was 131.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i2 and consists of 3 locations. The remainder module has 474 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 219 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 13 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital100 mio100 ax100 hnf100 lsp329 ukn20 mio100 lsp82 div100 bol100 ite100 ukn100 eq159 hnf97 smp100 dnf421 smp29 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 86ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 68]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L79] FORK 0 fork 1 computeMin(); [L80] FORK 0 fork 2, 2 computeMax(); [L81] FORK 0 fork 3, 3, 3 sample(); Loop: [L69] min_l := array_min; [L70] max_l := array_max; [L72] diff := max_l - min_l; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 68]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L79] FORK 0 fork 1 computeMin(); [L80] FORK 0 fork 2, 2 computeMax(); [L81] FORK 0 fork 3, 3, 3 sample(); Loop: [L69] min_l := array_min; [L70] max_l := array_max; [L72] diff := max_l - min_l; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 46 PlacesBefore, 31 PlacesAfterwards, 39 TransitionsBefore, 22 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 21 TotalNumberOfCompositions, 878 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 732, independent: 718, independent conditional: 0, independent unconditional: 718, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 461, independent: 450, independent conditional: 0, independent unconditional: 450, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 461, independent: 444, independent conditional: 0, independent unconditional: 444, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 732, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 461, unknown conditional: 0, unknown unconditional: 461] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:12:34,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:12:35,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:12:35,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...