/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 --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -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-10 01:01:13,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:01:13,997 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-10 01:01:14,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:01:14,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:01:14,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:01:14,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:01:14,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:01:14,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:01:14,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:01:14,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:01:14,039 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:01:14,039 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:01:14,040 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:01:14,040 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:01:14,040 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:01:14,041 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:01:14,041 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:01:14,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:01:14,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:01:14,042 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:01:14,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:01:14,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:01:14,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:01:14,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:01:14,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:01:14,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:01:14,045 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:01:14,045 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:01:14,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:01:14,045 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:01:14,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:01:14,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:01:14,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:01:14,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:01:14,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:01:14,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:01:14,048 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:01:14,048 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 01:01:14,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:01:14,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:01:14,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:01:14,388 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:01:14,389 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:01:14,391 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-10 01:01:14,391 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl' [2024-02-10 01:01:14,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:01:14,421 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:01:14,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:01:14,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:01:14,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:01:14,434 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 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,442 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 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,448 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:01:14,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:01:14,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:01:14,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:01:14,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:01:14,468 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 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,469 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 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,471 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 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,471 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 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,480 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 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,505 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 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,506 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 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,507 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 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:01:14,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:01:14,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:01:14,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:01:14,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:14" (1/1) ... [2024-02-10 01:01:14,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:14,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:14,553 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-10 01:01:14,576 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-10 01:01:14,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-10 01:01:14,607 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-10 01:01:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-10 01:01:14,608 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:01:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:01:14,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:01:14,608 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 01:01:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 01:01:14,609 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 01:01:14,609 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2024-02-10 01:01:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2024-02-10 01:01:14,610 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2024-02-10 01:01:14,610 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-10 01:01:14,610 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-10 01:01:14,611 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-10 01:01:14,611 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:01:14,661 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:01:14,663 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:01:14,813 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:01:14,820 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:01:14,820 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:01:14,822 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:01:14 BoogieIcfgContainer [2024-02-10 01:01:14,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:01:14,833 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:01:14,833 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:01:14,838 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:01:14,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:01:14,839 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:01:14" (1/2) ... [2024-02-10 01:01:14,841 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ad6e2ee and model type min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:01:14, skipping insertion in model container [2024-02-10 01:01:14,841 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:01:14,842 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 10.02 01:01:14" (2/2) ... [2024-02-10 01:01:14,844 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs.bpl [2024-02-10 01:01:14,910 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:01:14,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 104 flow [2024-02-10 01:01:14,952 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-02-10 01:01:14,952 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:01:14,957 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-10 01:01:14,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 104 flow [2024-02-10 01:01:14,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 84 flow [2024-02-10 01:01:14,965 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:01:14,966 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:01:14,966 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:01:14,966 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:01:14,966 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:01:14,966 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:01:14,966 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:01:14,967 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:01:14,968 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 places, 33 transitions, 84 flow [2024-02-10 01:01:14,975 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:01:14,975 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-02-10 01:01:14,975 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 01:01:14,982 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:01:14,985 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:01:14,985 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 places, 33 transitions, 84 flow [2024-02-10 01:01:14,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:01:14,990 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-02-10 01:01:14,990 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 01:01:14,990 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:01:14,994 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-10 01:01:14,995 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-10 01:01:14,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash 132776, now seen corresponding path program 1 times [2024-02-10 01:01:15,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:15,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191915798] [2024-02-10 01:01:15,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:15,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:15,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:15,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:15,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash 127170, now seen corresponding path program 1 times [2024-02-10 01:01:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:15,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562072981] [2024-02-10 01:01:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:15,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:15,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:15,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash -339340101, now seen corresponding path program 1 times [2024-02-10 01:01:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678414305] [2024-02-10 01:01:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:15,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:15,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:15,394 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:01:15,395 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:01:15,395 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:01:15,395 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:01:15,395 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:01:15,395 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:15,395 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:01:15,396 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:01:15,396 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:01:15,396 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:01:15,396 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:01:15,421 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-10 01:01:15,432 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-10 01:01:15,854 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:01:15,858 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:01:15,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:15,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:15,863 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-10 01:01:15,872 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-10 01:01:15,875 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-10 01:01:15,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:15,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:15,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:15,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:15,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:01:15,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:15,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:15,915 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-10 01:01:15,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:15,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:15,933 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-10 01:01:15,941 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-10 01:01:15,948 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-10 01:01:15,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:15,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:15,958 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-02-10 01:01:15,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:15,995 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-02-10 01:01:15,996 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-02-10 01:01:16,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:16,070 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-10 01:01:16,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:16,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:16,080 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-10 01:01:16,087 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-10 01:01:16,088 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-10 01:01:16,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:16,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:16,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:16,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:16,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:01:16,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:16,119 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:01:16,127 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:01:16,127 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:01:16,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:16,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:16,132 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-10 01:01:16,137 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:01:16,145 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-10 01:01:16,157 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:01:16,157 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:01:16,158 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2024-02-10 01:01:16,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 01:01:16,165 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:01:16,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:16,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:01:16,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:01:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:16,214 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:01:16,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:01:16,233 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-10 01:01:16,267 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-10 01:01:16,270 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-10 01:01:16,441 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-10 01:01:16,464 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-10 01:01:16,465 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:01:16,465 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:01:16,467 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 01:01:16,494 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 01:01:16,495 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:01:16,503 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-10 01:01:16,510 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-10 01:01:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2024-02-10 01:01:16,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-10 01:01:16,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:16,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 01:01:16,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:16,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 01:01:16,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:16,525 INFO L428 stractBuchiCegarLoop]: Abstraction has has 52 places, 413 transitions, 1871 flow [2024-02-10 01:01:16,528 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:01:16,528 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 places, 413 transitions, 1871 flow [2024-02-10 01:01:16,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:01:16,607 INFO L124 PetriNetUnfolderBase]: 246/328 cut-off events. [2024-02-10 01:01:16,607 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-02-10 01:01:16,608 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:01:16,608 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] 118#[$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] 120#[$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] 122#[$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[] 124#[$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] 126#[$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] 122#[$Ultimate##0, L46-1, L78]true [2024-02-10 01:01:16,608 INFO L750 eck$LassoCheckResult]: Loop: 122#[$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[] 124#[$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] 126#[$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] 122#[$Ultimate##0, L46-1, L78]true [2024-02-10 01:01:16,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1603266867, now seen corresponding path program 1 times [2024-02-10 01:01:16,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:16,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565277005] [2024-02-10 01:01:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:16,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:16,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:16,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:16,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash 110289, now seen corresponding path program 1 times [2024-02-10 01:01:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:16,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083264261] [2024-02-10 01:01:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:16,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:16,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:16,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:16,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1408144517, now seen corresponding path program 2 times [2024-02-10 01:01:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:16,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793911149] [2024-02-10 01:01:16,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:16,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:16,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:16,997 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:01:16,998 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:01:16,998 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:01:16,998 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:01:16,998 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:01:16,998 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:16,998 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:01:16,998 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:01:16,999 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:01:16,999 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:01:16,999 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:01:17,003 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-10 01:01:17,162 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-10 01:01:17,164 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-10 01:01:17,167 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-10 01:01:17,172 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-10 01:01:17,441 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:01:17,441 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:01:17,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:17,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:17,465 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) [2024-02-10 01:01:17,488 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 [2024-02-10 01:01:17,488 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-10 01:01:17,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:17,498 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-10 01:01:17,498 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2024-02-10 01:01:17,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:17,558 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2024-02-10 01:01:17,558 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2024-02-10 01:01:17,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:17,666 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 [2024-02-10 01:01:17,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:17,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:17,668 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) [2024-02-10 01:01:17,674 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 [2024-02-10 01:01:17,675 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-10 01:01:17,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:17,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:17,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:17,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:17,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:01:17,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:17,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:01:17,708 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:01:17,709 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-10 01:01:17,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:17,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:17,711 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) [2024-02-10 01:01:17,716 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:01:17,725 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 [2024-02-10 01:01:17,735 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:01:17,735 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:01:17,735 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMaxThread1of1ForFork1_i2, N) = -1*computeMaxThread1of1ForFork1_i2 + 1*N Supporting invariants [] [2024-02-10 01:01:17,744 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 [2024-02-10 01:01:17,745 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:01:17,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:17,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:01:17,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:01:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:17,776 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:01:17,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:01:17,818 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 [2024-02-10 01:01:17,831 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-10 01:01:17,832 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-10 01:01:17,832 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10 01:01:17,929 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10 01:01:17,930 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:01:17,930 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:01:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 517 transitions. [2024-02-10 01:01:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 517 transitions. [2024-02-10 01:01:17,954 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:01:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 517 transitions. [2024-02-10 01:01:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 517 transitions. [2024-02-10 01:01:18,179 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:01:18,180 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:01:18,180 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-10 01:01:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10 01:01:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2024-02-10 01:01:18,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 7 letters. Loop has 3 letters. [2024-02-10 01:01:18,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:18,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 10 letters. Loop has 3 letters. [2024-02-10 01:01:18,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:18,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 7 letters. Loop has 6 letters. [2024-02-10 01:01:18,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:18,187 INFO L428 stractBuchiCegarLoop]: Abstraction has has 65 places, 6722 transitions, 43782 flow [2024-02-10 01:01:18,188 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:01:18,188 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 places, 6722 transitions, 43782 flow [2024-02-10 01:01:22,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:01:22,600 INFO L124 PetriNetUnfolderBase]: 18997/21834 cut-off events. [2024-02-10 01:01:22,600 INFO L125 PetriNetUnfolderBase]: For 1118/1118 co-relation queries the response was YES. [2024-02-10 01:01:22,600 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:01:22,600 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] 118#[$Ultimate##0, L78, $Ultimate##0]true [110] L78-->$Ultimate##0: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1] 195#[$Ultimate##0, $Ultimate##0, L79, $Ultimate##0]true [113] L79-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j] 197#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L80]true [89] $Ultimate##0-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 199#[$Ultimate##0, $Ultimate##0, L58-1, $Ultimate##0, L80]true [91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[] 201#[$Ultimate##0, $Ultimate##0, L59, $Ultimate##0, L80]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] 203#[$Ultimate##0, L59, L30, $Ultimate##0, L80]true [96] L30-->L32-1: Formula: (= v_computeMinThread1of1ForFork0_i1_1 0) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_1} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1] 205#[$Ultimate##0, L59, L32-1, $Ultimate##0, L80]true [93] L59-->L60: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A] 207#[$Ultimate##0, L32-1, $Ultimate##0, L60, L80]true [97] L32-1-->computeMinFINAL: Formula: (<= v_N_6 v_computeMinThread1of1ForFork0_i1_3) InVars {computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_3, N=v_N_6} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_3, N=v_N_6} AuxVars[] AssignedVars[] 209#[$Ultimate##0, computeMinFINAL, $Ultimate##0, L60, L80]true [94] L60-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 211#[$Ultimate##0, computeMinFINAL, L58-1, $Ultimate##0, L80]true [2024-02-10 01:01:22,601 INFO L750 eck$LassoCheckResult]: Loop: 211#[$Ultimate##0, computeMinFINAL, L58-1, $Ultimate##0, L80]true [91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[] 214#[$Ultimate##0, computeMinFINAL, L59, $Ultimate##0, L80]true [93] L59-->L60: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A] 209#[$Ultimate##0, computeMinFINAL, $Ultimate##0, L60, L80]true [94] L60-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 211#[$Ultimate##0, computeMinFINAL, L58-1, $Ultimate##0, L80]true [91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[] 214#[$Ultimate##0, computeMinFINAL, L59, $Ultimate##0, L80]true [93] L59-->L60: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A] 209#[$Ultimate##0, computeMinFINAL, $Ultimate##0, L60, L80]true [94] L60-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 211#[$Ultimate##0, computeMinFINAL, L58-1, $Ultimate##0, L80]true [2024-02-10 01:01:22,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash 869559408, now seen corresponding path program 1 times [2024-02-10 01:01:22,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:22,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642416015] [2024-02-10 01:01:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:22,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:22,700 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-10 01:01:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 01:01:22,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642416015] [2024-02-10 01:01:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642416015] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 01:01:22,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 01:01:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-10 01:01:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654270918] [2024-02-10 01:01:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 01:01:22,703 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-10 01:01:22,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash -713432639, now seen corresponding path program 1 times [2024-02-10 01:01:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173834632] [2024-02-10 01:01:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:22,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:22,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:22,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 01:01:22,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-10 01:01:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-10 01:01:22,961 INFO L175 Difference]: Start difference. First operand has 65 places, 6722 transitions, 43782 flow. Second operand 7 states and 287 transitions. [2024-02-10 01:01:22,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 6722 transitions, 43782 flow. Second operand 7 states and 287 transitions. [2024-02-10 01:01:22,963 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 41 [2024-02-10 01:01:22,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 01:01:45,092 INFO L124 PetriNetUnfolderBase]: 213367/246582 cut-off events. [2024-02-10 01:01:45,093 INFO L125 PetriNetUnfolderBase]: For 27173/27173 co-relation queries the response was YES. [2024-02-10 01:01:45,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811061 conditions, 246582 events. 213367/246582 cut-off events. For 27173/27173 co-relation queries the response was YES. Maximal size of possible extension queue 3408. Compared 916520 event pairs, 6026 based on Foata normal form. 2150/107480 useless extension candidates. Maximal degree in co-relation 572248. Up to 82553 conditions per place. [2024-02-10 01:01:46,835 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 905 selfloop transitions, 274 changer transitions 0/2919 dead transitions. [2024-02-10 01:01:46,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 2919 transitions, 20916 flow [2024-02-10 01:01:46,850 INFO L231 Difference]: Finished difference. Result has 74 places, 2472 transitions, 17250 flow [2024-02-10 01:01:46,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-10 01:01:46,852 INFO L428 stractBuchiCegarLoop]: Abstraction has has 74 places, 2472 transitions, 17250 flow [2024-02-10 01:01:46,852 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:01:46,852 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 74 places, 2472 transitions, 17250 flow [2024-02-10 01:01:49,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:01:49,783 INFO L124 PetriNetUnfolderBase]: 18954/21775 cut-off events. [2024-02-10 01:01:49,784 INFO L125 PetriNetUnfolderBase]: For 3240/3240 co-relation queries the response was YES. [2024-02-10 01:01:49,784 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:01:49,784 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] 118#[$Ultimate##0, L78, $Ultimate##0]true [110] L78-->$Ultimate##0: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1] 195#[$Ultimate##0, $Ultimate##0, L79, $Ultimate##0]true [113] L79-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j] 197#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L80]true [89] $Ultimate##0-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 199#[$Ultimate##0, $Ultimate##0, L58-1, $Ultimate##0, L80]true [91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[] 201#[$Ultimate##0, $Ultimate##0, L59, $Ultimate##0, L80]true [93] L59-->L60: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A] 245#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L60, L80]true [94] L60-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 199#[$Ultimate##0, $Ultimate##0, L58-1, $Ultimate##0, L80]true [85] $Ultimate##0-->L69: 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] 248#[$Ultimate##0, L58-1, $Ultimate##0, L80, L69]true [86] L69-->L71: Formula: (= v_array_max_6 v_sampleThread1of1ForFork2_max_l_1) InVars {array_max=v_array_max_6} OutVars{array_max=v_array_max_6, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_max_l] 250#[$Ultimate##0, L58-1, L71, $Ultimate##0, L80]true [91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[] 252#[$Ultimate##0, L59, L71, $Ultimate##0, L80]true [2024-02-10 01:01:49,784 INFO L750 eck$LassoCheckResult]: Loop: 252#[$Ultimate##0, L59, L71, $Ultimate##0, L80]true [93] L59-->L60: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A] 255#[$Ultimate##0, L71, $Ultimate##0, L60, L80]true [94] L60-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 250#[$Ultimate##0, L58-1, L71, $Ultimate##0, L80]true [91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[] 252#[$Ultimate##0, L59, L71, $Ultimate##0, L80]true [93] L59-->L60: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A] 255#[$Ultimate##0, L71, $Ultimate##0, L60, L80]true [94] L60-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 250#[$Ultimate##0, L58-1, L71, $Ultimate##0, L80]true [91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[] 252#[$Ultimate##0, L59, L71, $Ultimate##0, L80]true [2024-02-10 01:01:49,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash 867644752, now seen corresponding path program 1 times [2024-02-10 01:01:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:49,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290459213] [2024-02-10 01:01:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:49,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:49,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:49,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash -655338239, now seen corresponding path program 2 times [2024-02-10 01:01:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:49,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910002876] [2024-02-10 01:01:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:49,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:49,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:49,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 616043280, now seen corresponding path program 2 times [2024-02-10 01:01:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:01:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650174753] [2024-02-10 01:01:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:01:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:01:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:49,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:01:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:01:49,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:01:50,088 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:01:50,088 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:01:50,088 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:01:50,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:01:50,089 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:01:50,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:50,090 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:01:50,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:01:50,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration4_Lasso [2024-02-10 01:01:50,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:01:50,090 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:01:50,097 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-10 01:01:50,100 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-10 01:01:50,101 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-10 01:01:50,103 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-10 01:01:50,104 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-10 01:01:50,222 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-10 01:01:50,223 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-10 01:01:50,226 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-10 01:01:50,227 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-10 01:01:50,229 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-10 01:01:50,231 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-10 01:01:50,234 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-10 01:01:50,238 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-10 01:01:50,240 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-10 01:01:50,242 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-10 01:01:50,244 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-10 01:01:50,412 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:01:50,412 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:01:50,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:50,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:50,429 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) [2024-02-10 01:01:50,432 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 [2024-02-10 01:01:50,452 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-10 01:01:50,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:50,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:50,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:50,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:50,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:01:50,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:50,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:50,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 01:01:50,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:50,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:50,487 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10 01:01:50,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 01:01:50,495 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-10 01:01:50,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:50,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:01:50,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:50,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:50,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:50,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:01:50,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:01:50,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:50,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-02-10 01:01:50,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:50,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:50,516 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10 01:01:50,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 01:01:50,519 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-10 01:01:50,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:50,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:50,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:50,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:50,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:01:50,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:50,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:50,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-02-10 01:01:50,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:50,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:50,543 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10 01:01:50,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 01:01:50,546 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-10 01:01:50,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:50,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:01:50,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:50,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:50,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:50,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:01:50,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:01:50,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:50,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-02-10 01:01:50,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:50,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:50,567 INFO L229 MonitoredProcess]: Starting monitored process 13 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-10 01:01:50,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 01:01:50,569 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-10 01:01:50,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:50,578 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-10 01:01:50,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:50,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:50,581 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-02-10 01:01:50,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:50,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:50,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 01:01:50,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:50,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:50,590 INFO L229 MonitoredProcess]: Starting monitored process 14 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-10 01:01:50,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 01:01:50,593 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-10 01:01:50,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:50,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:01:50,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:50,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:50,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:50,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:01:50,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:01:50,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:01:50,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 01:01:50,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:50,608 INFO L229 MonitoredProcess]: Starting monitored process 15 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-10 01:01:50,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 01:01:50,611 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-10 01:01:50,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:01:50,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:01:50,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:01:50,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:01:50,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:01:50,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:01:50,630 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:01:50,638 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 01:01:50,638 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 01:01:50,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:01:50,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:01:50,639 INFO L229 MonitoredProcess]: Starting monitored process 16 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-10 01:01:50,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 01:01:50,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:01:50,653 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:01:50,653 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:01:50,653 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mapAbsThread1of1ForFork3_j, N) = -1*mapAbsThread1of1ForFork3_j + 1*N Supporting invariants [] [2024-02-10 01:01:50,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-02-10 01:01:50,666 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:01:50,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:01:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:50,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:01:50,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:01:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:01:50,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:01:50,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:01:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:01:50,733 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:01:50,733 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-10 01:01:50,834 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 10 states and 595 transitions.6 powerset states4 rank states. The highest rank that occured is 1 [2024-02-10 01:01:50,834 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:01:50,834 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:01:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states and 595 transitions. [2024-02-10 01:01:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 595 transitions. [2024-02-10 01:01:50,837 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:01:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states and 595 transitions. [2024-02-10 01:01:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 595 transitions. [2024-02-10 01:01:51,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-02-10 01:01:52,081 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:01:52,081 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:01:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-10 01:01:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-10 01:01:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2024-02-10 01:01:52,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 197 transitions. Stem has 11 letters. Loop has 6 letters. [2024-02-10 01:01:52,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:52,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 197 transitions. Stem has 17 letters. Loop has 6 letters. [2024-02-10 01:01:52,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:52,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 197 transitions. Stem has 11 letters. Loop has 12 letters. [2024-02-10 01:01:52,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:01:52,083 INFO L428 stractBuchiCegarLoop]: Abstraction has has 89 places, 44652 transitions, 391212 flow [2024-02-10 01:01:52,083 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-10 01:01:52,083 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 89 places, 44652 transitions, 391212 flow Received shutdown request... [2024-02-10 01:05:37,120 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-10 01:05:37,392 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:05:37,398 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:05:37 BoogieIcfgContainer [2024-02-10 01:05:37,398 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:05:37,399 INFO L158 Benchmark]: Toolchain (without parser) took 262978.23ms. Allocated memory was 180.4MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 152.7MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 6.3GB. Max. memory is 8.0GB. [2024-02-10 01:05:37,399 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:05:37,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.41ms. Allocated memory is still 180.4MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-10 01:05:37,400 INFO L158 Benchmark]: Boogie Preprocessor took 57.14ms. Allocated memory was 180.4MB in the beginning and 286.3MB in the end (delta: 105.9MB). Free memory was 151.1MB in the beginning and 265.1MB in the end (delta: -114.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:05:37,400 INFO L158 Benchmark]: RCFGBuilder took 313.63ms. Allocated memory is still 286.3MB. Free memory was 265.1MB in the beginning and 254.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:05:37,401 INFO L158 Benchmark]: BuchiAutomizer took 262565.57ms. Allocated memory was 286.3MB in the beginning and 7.1GB in the end (delta: 6.8GB). Free memory was 254.0MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 6.3GB. Max. memory is 8.0GB. [2024-02-10 01:05:37,402 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.11ms. Allocated memory is still 180.4MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.41ms. Allocated memory is still 180.4MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.14ms. Allocated memory was 180.4MB in the beginning and 286.3MB in the end (delta: 105.9MB). Free memory was 151.1MB in the beginning and 265.1MB in the end (delta: -114.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 313.63ms. Allocated memory is still 286.3MB. Free memory was 265.1MB in the beginning and 254.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 262565.57ms. Allocated memory was 286.3MB in the beginning and 7.1GB in the end (delta: 6.8GB). Free memory was 254.0MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 6.3GB. 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i2 and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 391212 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 262.4s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 3.4s. Construction of modules took 0.2s. Büchi inclusion checks took 25.9s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 570 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 567 mSDsluCounter, 908 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 496 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 441 IncrementalHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 412 mSDtfsCounter, 441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital155 mio100 ax100 hnf100 lsp579 ukn10 mio100 lsp75 div100 bol100 ite100 ukn100 eq152 hnf98 smp94 dnf337 smp37 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 202ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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 executing PetriNetUnfolderBuchi. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown