/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:53:40,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:53:40,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:53:40,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:53:40,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:53:40,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:53:40,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:53:40,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:53:40,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:53:40,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:53:40,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:53:40,927 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:53:40,927 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:53:40,928 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:53:40,928 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:53:40,929 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:53:40,929 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:53:40,929 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:53:40,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:53:40,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:53:40,930 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:53:40,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:53:40,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:53:40,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:53:40,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:53:40,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:53:40,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:53:40,932 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:53:40,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:53:40,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:53:40,934 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:53:40,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:53:40,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:53:40,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:53:40,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:53:40,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:53:40,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:53:40,935 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:53:40,935 INFO L153 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_PETRI_NET [2024-02-09 23:53:41,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:53:41,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:53:41,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:53:41,346 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:53:41,347 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:53:41,348 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.bpl [2024-02-09 23:53:41,348 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl' [2024-02-09 23:53:41,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:53:41,388 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:53:41,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:53:41,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:53:41,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:53:41,405 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 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,412 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 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,417 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:53:41,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:53:41,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:53:41,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:53:41,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:53:41,440 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 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,440 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 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,449 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 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,449 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 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,452 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 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,466 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 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,482 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 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,484 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 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:53:41,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:53:41,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:53:41,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:53:41,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:41" (1/1) ... [2024-02-09 23:53:41,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:41,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:41,537 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) [2024-02-09 23:53:41,564 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 [2024-02-09 23:53:41,610 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-09 23:53:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-09 23:53:41,610 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-09 23:53:41,612 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:53:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:53:41,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:53:41,614 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-09 23:53:41,614 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-09 23:53:41,614 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-09 23:53:41,615 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2024-02-09 23:53:41,615 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2024-02-09 23:53:41,615 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2024-02-09 23:53:41,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-09 23:53:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-09 23:53:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-09 23:53:41,617 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:53:41,672 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:53:41,674 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:53:41,788 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:53:41,794 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:53:41,794 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:53:41,796 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:53:41 BoogieIcfgContainer [2024-02-09 23:53:41,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:53:41,797 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:53:41,797 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:53:41,803 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:53:41,803 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:53:41,803 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:41" (1/2) ... [2024-02-09 23:53:41,805 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@123caa10 and model type min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:53:41, skipping insertion in model container [2024-02-09 23:53:41,805 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:53:41,805 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 09.02 11:53:41" (2/2) ... [2024-02-09 23:53:41,806 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs.bpl [2024-02-09 23:53:41,921 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:53:41,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 104 flow [2024-02-09 23:53:41,986 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-02-09 23:53:41,986 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:53:41,991 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 85 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. [2024-02-09 23:53:41,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 104 flow [2024-02-09 23:53:41,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 84 flow [2024-02-09 23:53:42,001 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:53:42,001 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:53:42,001 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:53:42,001 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:53:42,002 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:53:42,002 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:53:42,002 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:53:42,002 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:53:42,003 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 places, 33 transitions, 84 flow [2024-02-09 23:53:42,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:42,013 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-02-09 23:53:42,013 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-09 23:53:42,014 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:42,016 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:53:42,016 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 places, 33 transitions, 84 flow [2024-02-09 23:53:42,021 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:42,022 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-02-09 23:53:42,022 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-09 23:53:42,022 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:42,028 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [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] 53#[$Ultimate##0, L77]true [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] 55#[L30, L77]true [96] L30-->L32-1: Formula: (= v_computeMinThread1of1ForFork0_i1_1 0) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_1} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1] 57#[L32-1, L77]true [2024-02-09 23:53:42,029 INFO L750 eck$LassoCheckResult]: Loop: 57#[L32-1, L77]true [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[] 60#[L33, L77]true [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] 62#[L34, L77]true [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] 57#[L32-1, L77]true [2024-02-09 23:53:42,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash 132776, now seen corresponding path program 1 times [2024-02-09 23:53:42,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:42,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916183712] [2024-02-09 23:53:42,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:42,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash 127170, now seen corresponding path program 1 times [2024-02-09 23:53:42,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:42,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389915450] [2024-02-09 23:53:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:42,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:42,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash -339340101, now seen corresponding path program 1 times [2024-02-09 23:53:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:42,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206163674] [2024-02-09 23:53:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:42,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:42,523 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:53:42,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:53:42,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:53:42,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:53:42,524 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:53:42,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:42,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:53:42,525 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:53:42,525 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:53:42,525 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:53:42,525 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:53:42,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:42,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:53:43,012 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:53:43,016 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:53:43,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:43,024 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) [2024-02-09 23:53:43,028 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 [2024-02-09 23:53:43,042 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 [2024-02-09 23:53:43,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:43,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:43,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:43,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:43,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:43,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:43,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:43,107 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 [2024-02-09 23:53:43,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:43,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:43,115 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) [2024-02-09 23:53:43,118 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 [2024-02-09 23:53:43,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:43,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:43,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:43,131 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-02-09 23:53:43,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:43,176 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-02-09 23:53:43,176 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-02-09 23:53:43,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:43,245 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 [2024-02-09 23:53:43,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:43,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:43,248 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) [2024-02-09 23:53:43,258 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 [2024-02-09 23:53:43,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:43,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:43,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:43,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:43,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:43,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:43,277 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 [2024-02-09 23:53:43,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:53:43,283 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:53:43,283 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:53:43,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:43,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:43,287 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) [2024-02-09 23:53:43,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:53:43,301 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 [2024-02-09 23:53:43,314 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:53:43,314 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:53:43,315 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2024-02-09 23:53:43,320 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 [2024-02-09 23:53:43,325 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:53:43,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:43,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:53:43,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:43,377 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:53:43,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:53:43,441 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 [2024-02-09 23:53:43,444 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-02-09 23:53:43,639 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 9 states and 517 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:53:43,640 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:53:43,641 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:53:43,659 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:53:43,659 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:53:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:53:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-02-09 23:53:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2024-02-09 23:53:43,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-09 23:53:43,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:43,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-09 23:53:43,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:43,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-09 23:53:43,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:43,685 INFO L428 stractBuchiCegarLoop]: Abstraction has has 61 places, 826 transitions, 3742 flow [2024-02-09 23:53:43,688 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:53:43,688 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 places, 826 transitions, 3742 flow [2024-02-09 23:53:43,797 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:43,797 INFO L124 PetriNetUnfolderBase]: 297/418 cut-off events. [2024-02-09 23:53:43,797 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-02-09 23:53:43,797 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:43,798 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [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] 53#[$Ultimate##0, L77]true [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] 127#[$Ultimate##0, L78, $Ultimate##0]true [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] 129#[$Ultimate##0, L78, L44]true [79] L44-->L46-1: Formula: (= v_computeMaxThread1of1ForFork1_i2_1 0) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_1} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2] 131#[$Ultimate##0, L46-1, L78]true [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[] 133#[$Ultimate##0, L47, L78]true [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] 135#[$Ultimate##0, L78, L48]true [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] 131#[$Ultimate##0, L46-1, L78]true [2024-02-09 23:53:43,798 INFO L750 eck$LassoCheckResult]: Loop: 131#[$Ultimate##0, L46-1, L78]true [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[] 133#[$Ultimate##0, L47, L78]true [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] 135#[$Ultimate##0, L78, L48]true [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] 131#[$Ultimate##0, L46-1, L78]true [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[] 133#[$Ultimate##0, L47, L78]true [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] 135#[$Ultimate##0, L78, L48]true [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] 131#[$Ultimate##0, L46-1, L78]true [2024-02-09 23:53:43,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1603266867, now seen corresponding path program 1 times [2024-02-09 23:53:43,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:43,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767839720] [2024-02-09 23:53:43,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:43,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:43,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:43,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1009267199, now seen corresponding path program 1 times [2024-02-09 23:53:43,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922721246] [2024-02-09 23:53:43,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:43,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:43,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1087806413, now seen corresponding path program 2 times [2024-02-09 23:53:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678146582] [2024-02-09 23:53:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:43,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:44,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-09 23:53:45,196 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:53:45,196 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:53:45,196 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:53:45,196 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:53:45,196 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:53:45,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:45,197 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:53:45,197 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:53:45,197 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:53:45,197 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:53:45,197 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:53:45,318 WARN L176 XnfTransformerHelper]: Simplifying conjunction of 28304 disjunctions. This might take some time... [2024-02-09 23:54:28,281 INFO L192 XnfTransformerHelper]: Simplified to conjunction of 28304 disjunctions. [2024-02-09 23:54:28,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:54:28,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true Received shutdown request... [2024-02-09 23:58:04,310 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-09 23:58:04,416 WARN L235 SmtUtils]: Removed 8665 from assertion stack [2024-02-09 23:58:04,422 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:58:04 BoogieIcfgContainer [2024-02-09 23:58:04,422 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:58:04,423 INFO L158 Benchmark]: Toolchain (without parser) took 263033.88ms. Allocated memory was 151.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 118.7MB in the beginning and 804.9MB in the end (delta: -686.3MB). Peak memory consumption was 892.3MB. Max. memory is 8.0GB. [2024-02-09 23:58:04,423 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 151.0MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:58:04,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.24ms. Allocated memory is still 151.0MB. Free memory was 118.4MB in the beginning and 116.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:58:04,424 INFO L158 Benchmark]: Boogie Preprocessor took 65.16ms. Allocated memory was 151.0MB in the beginning and 245.4MB in the end (delta: 94.4MB). Free memory was 116.8MB in the beginning and 220.5MB in the end (delta: -103.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-09 23:58:04,425 INFO L158 Benchmark]: RCFGBuilder took 310.40ms. Allocated memory is still 245.4MB. Free memory was 220.5MB in the beginning and 210.2MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:58:04,425 INFO L158 Benchmark]: BuchiAutomizer took 262625.11ms. Allocated memory was 245.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 210.0MB in the beginning and 804.9MB in the end (delta: -594.9MB). Peak memory consumption was 890.0MB. Max. memory is 8.0GB. [2024-02-09 23:58:04,427 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.12ms. Allocated memory is still 151.0MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.24ms. Allocated memory is still 151.0MB. Free memory was 118.4MB in the beginning and 116.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.16ms. Allocated memory was 151.0MB in the beginning and 245.4MB in the end (delta: 94.4MB). Free memory was 116.8MB in the beginning and 220.5MB in the end (delta: -103.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 310.40ms. Allocated memory is still 245.4MB. Free memory was 220.5MB in the beginning and 210.2MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 262625.11ms. Allocated memory was 245.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 210.0MB in the beginning and 804.9MB in the end (delta: -594.9MB). Peak memory consumption was 890.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Decomposition not yet finished - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 262.4s and 2 iterations. TraceHistogramMax:0. Analysis of lassos took 261.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 89 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp610 ukn15 mio100 lsp84 div100 bol100 ite100 ukn100 eq156 hnf98 smp100 dnf188 smp35 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 132ms 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.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while BuchiPetriNetCegarLoop was analyzing lasso (stem: length 8 TraceHistMax 1 loop: length 7 TraceHistMax 2),while LassoBuilder was applying MapEliminationLassoPreprocessor to lasso for termination ,while SimplifyDDAWithTimeout was simplifying term of DAG size 11595 for 215001ms.. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown