/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:11,883 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:11,957 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:37:11,985 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:11,985 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:11,986 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:11,988 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:11,988 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:11,988 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:11,992 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:11,992 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:11,992 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:11,993 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:11,994 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:11,994 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:11,994 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:11,994 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:11,994 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:11,995 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:11,995 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:11,995 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:11,995 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:11,996 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:11,996 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:11,996 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:11,996 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:11,996 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:11,996 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:11,997 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:11,997 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:11,998 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:11,998 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:11,998 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:12,000 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:12,000 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:37:12,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:12,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:12,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:12,230 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:12,231 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:12,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl [2023-10-12 17:37:12,232 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample.bpl' [2023-10-12 17:37:12,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:12,254 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:12,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:12,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:12,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:12,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,275 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:12,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:12,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:12,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:12,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:12,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:12,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:12,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:12,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:12,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/1) ... [2023-10-12 17:37:12,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:12,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:12,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:12,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:37:12,371 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:37:12,371 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:37:12,371 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:37:12,371 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:12,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:12,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:12,372 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:37:12,373 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:37:12,373 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:37:12,373 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:37:12,374 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:37:12,374 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:37:12,375 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:37:12,421 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:12,423 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:12,509 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:12,523 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:12,523 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:37:12,525 INFO L201 PluginConnector]: Adding new model min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:12 BoogieIcfgContainer [2023-10-12 17:37:12,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:12,526 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:12,526 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:12,529 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:12,530 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:12,530 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:12" (1/2) ... [2023-10-12 17:37:12,531 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37fb1f4e and model type min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:12, skipping insertion in model container [2023-10-12 17:37:12,532 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:12,532 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:12" (2/2) ... [2023-10-12 17:37:12,533 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample.bpl [2023-10-12 17:37:12,604 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:37:12,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow [2023-10-12 17:37:12,654 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2023-10-12 17:37:12,654 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:12,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 23 events. 3/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 39 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2023-10-12 17:37:12,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow [2023-10-12 17:37:12,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 61 flow [2023-10-12 17:37:12,665 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:12,682 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 61 flow [2023-10-12 17:37:12,684 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 61 flow [2023-10-12 17:37:12,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 61 flow [2023-10-12 17:37:12,699 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2023-10-12 17:37:12,699 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:12,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 23 events. 3/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 39 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2023-10-12 17:37:12,701 INFO L119 LiptonReduction]: Number of co-enabled transitions 222 [2023-10-12 17:37:12,835 INFO L134 LiptonReduction]: Checked pairs total: 214 [2023-10-12 17:37:12,835 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-10-12 17:37:12,847 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:12,847 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:12,847 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:12,847 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:12,848 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:12,848 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:12,848 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:12,848 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:12,848 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 51 flow [2023-10-12 17:37:12,852 ERROR L47 etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][9], 3:2A:[70] $Ultimate##0-->L32: Formula: (= v_array_min_4 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_min=v_array_min_4} AuxVars[] AssignedVars[array_min][7], 5:3A:[71] L32-->L35-1: Formula: (= v_i1_5 0) InVars {} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1][1]][6:4A:[90] L35-1-->L35-1: Formula: (and (< v_i1_15 v_N_11) (= (let ((.cse0 (select v_A_13 v_i1_15))) (ite (< v_array_min_12 .cse0) v_array_min_12 .cse0)) v_array_min_11) (= v_i1_14 (+ v_i1_15 1))) InVars {A=v_A_13, array_min=v_array_min_12, N=v_N_11, i1=v_i1_15} OutVars{A=v_A_13, array_min=v_array_min_11, N=v_N_11, i1=v_i1_14} AuxVars[] AssignedVars[array_min, i1][15]] [2023-10-12 17:37:12,854 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:12,854 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:37:12,854 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:12,854 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:12,857 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:12,857 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 51 flow [2023-10-12 17:37:12,860 ERROR L47 etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][9], 3:2A:[70] $Ultimate##0-->L32: Formula: (= v_array_min_4 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_min=v_array_min_4} AuxVars[] AssignedVars[array_min][7], 5:3A:[71] L32-->L35-1: Formula: (= v_i1_5 0) InVars {} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1][1]][6:4A:[90] L35-1-->L35-1: Formula: (and (< v_i1_15 v_N_11) (= (let ((.cse0 (select v_A_13 v_i1_15))) (ite (< v_array_min_12 .cse0) v_array_min_12 .cse0)) v_array_min_11) (= v_i1_14 (+ v_i1_15 1))) InVars {A=v_A_13, array_min=v_array_min_12, N=v_N_11, i1=v_i1_15} OutVars{A=v_A_13, array_min=v_array_min_11, N=v_N_11, i1=v_i1_14} AuxVars[] AssignedVars[array_min, i1][15]] [2023-10-12 17:37:12,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:12,860 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:37:12,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:12,860 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:12,864 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 39#[$Ultimate##0, L68]true [70] $Ultimate##0-->L32: Formula: (= v_array_min_4 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_min=v_array_min_4} AuxVars[] AssignedVars[array_min] 41#[L32, L68]true [71] L32-->L35-1: Formula: (= v_i1_5 0) InVars {} OutVars{i1=v_i1_5} AuxVars[] AssignedVars[i1] 43#[L68, L35-1]true [2023-10-12 17:37:12,865 INFO L750 eck$LassoCheckResult]: Loop: 43#[L68, L35-1]true [90] L35-1-->L35-1: Formula: (and (< v_i1_15 v_N_11) (= (let ((.cse0 (select v_A_13 v_i1_15))) (ite (< v_array_min_12 .cse0) v_array_min_12 .cse0)) v_array_min_11) (= v_i1_14 (+ v_i1_15 1))) InVars {A=v_A_13, array_min=v_array_min_12, N=v_N_11, i1=v_i1_15} OutVars{A=v_A_13, array_min=v_array_min_11, N=v_N_11, i1=v_i1_14} AuxVars[] AssignedVars[array_min, i1] 43#[L68, L35-1]true [2023-10-12 17:37:12,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash 106990, now seen corresponding path program 1 times [2023-10-12 17:37:12,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:12,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022060935] [2023-10-12 17:37:12,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:12,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:12,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:12,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:12,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:12,981 INFO L85 PathProgramCache]: Analyzing trace with hash 121, now seen corresponding path program 1 times [2023-10-12 17:37:12,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:12,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069685679] [2023-10-12 17:37:12,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:12,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:13,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash 3316780, now seen corresponding path program 1 times [2023-10-12 17:37:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066678173] [2023-10-12 17:37:13,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:13,198 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:13,199 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:13,199 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:13,199 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:13,199 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:13,199 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:13,199 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:13,199 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:13,200 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:13,201 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:13,201 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:13,216 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:13,225 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:13,391 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:13,394 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:13,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:13,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:13,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:13,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:37:13,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:13,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:13,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:13,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:13,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:13,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:13,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:13,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:13,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:13,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:13,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:13,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:13,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:37:13,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:13,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:13,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:13,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:13,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:13,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:13,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:13,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:13,541 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:37:13,541 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:37:13,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:13,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:13,558 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:13,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:37:13,560 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:13,585 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:13,585 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:13,586 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2023-10-12 17:37:13,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:13,596 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:13,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:13,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:13,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:13,672 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:13,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:13,720 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2023-10-12 17:37:13,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:13,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:13,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:13,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:13,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:13,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:13,813 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 72 transitions, 348 flow [2023-10-12 17:37:13,813 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:13,813 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 72 transitions, 348 flow [2023-10-12 17:37:13,817 ERROR L47 etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][36], 2:2A:[81] L68-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1][20], 5:3A:[61] $Ultimate##0-->L46: 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][0], 14:4A:[62] L46-->L49-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2][16]][16:5A:[88] L49-1-->L49-1: Formula: (and (= (+ v_i2_20 1) v_i2_19) (= v_array_max_16 (let ((.cse0 (select v_A_11 v_i2_20))) (ite (< v_array_max_17 .cse0) .cse0 v_array_max_17))) (< v_i2_20 v_N_7)) InVars {A=v_A_11, N=v_N_7, array_max=v_array_max_17, i2=v_i2_20} OutVars{A=v_A_11, N=v_N_7, array_max=v_array_max_16, i2=v_i2_19} AuxVars[] AssignedVars[array_max, i2][68]] [2023-10-12 17:37:13,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:13,818 INFO L124 PetriNetUnfolderBase]: 6/15 cut-off events. [2023-10-12 17:37:13,818 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:37:13,818 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:13,819 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 39#[$Ultimate##0, L68]true [81] L68-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 82#[$Ultimate##0, $Ultimate##0, L69]true [61] $Ultimate##0-->L46: 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] 84#[$Ultimate##0, L46, L69]true [62] L46-->L49-1: Formula: (= v_i2_1 0) InVars {} OutVars{i2=v_i2_1} AuxVars[] AssignedVars[i2] 86#[$Ultimate##0, L49-1, L69]true [2023-10-12 17:37:13,819 INFO L750 eck$LassoCheckResult]: Loop: 86#[$Ultimate##0, L49-1, L69]true [88] L49-1-->L49-1: Formula: (and (= (+ v_i2_20 1) v_i2_19) (= v_array_max_16 (let ((.cse0 (select v_A_11 v_i2_20))) (ite (< v_array_max_17 .cse0) .cse0 v_array_max_17))) (< v_i2_20 v_N_7)) InVars {A=v_A_11, N=v_N_7, array_max=v_array_max_17, i2=v_i2_20} OutVars{A=v_A_11, N=v_N_7, array_max=v_array_max_16, i2=v_i2_19} AuxVars[] AssignedVars[array_max, i2] 86#[$Ultimate##0, L49-1, L69]true [2023-10-12 17:37:13,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:13,820 INFO L85 PathProgramCache]: Analyzing trace with hash 3327013, now seen corresponding path program 1 times [2023-10-12 17:37:13,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:13,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686146292] [2023-10-12 17:37:13,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:13,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:13,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times [2023-10-12 17:37:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:13,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579666100] [2023-10-12 17:37:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:13,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash 103137491, now seen corresponding path program 1 times [2023-10-12 17:37:13,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:13,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816825292] [2023-10-12 17:37:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:13,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:13,939 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:13,939 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:13,939 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:13,939 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:13,939 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:13,940 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:13,940 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:13,940 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:13,940 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:13,940 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:13,940 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:13,942 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:13,984 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:13,987 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:13,991 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:14,087 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:14,088 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:14,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:14,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:14,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:37:14,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:14,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:14,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:14,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:14,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:14,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:14,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:14,143 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:37:14,144 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:37:14,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:14,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:14,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:14,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:37:14,454 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:14,479 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:14,479 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:14,479 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i2) = 1*N - 1*i2 Supporting invariants [] [2023-10-12 17:37:14,486 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 [2023-10-12 17:37:14,487 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:14,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:14,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:14,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:14,523 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:14,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:14,524 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:14,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2023-10-12 17:37:14,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:14,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:14,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:14,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:14,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 100 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:14,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:14,594 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 288 transitions, 1968 flow [2023-10-12 17:37:14,594 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:14,594 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 33 places, 288 transitions, 1968 flow [2023-10-12 17:37:14,612 ERROR L47 etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0][146], 2:2A:[81] L68-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1][82], 8:3A:[84] L69-->L59: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_thidvar1][34]][32:4A:[68] L59-->L61: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_1) v_array_min_3)) InVars {min_samples=v_min_samples_2, i1=v_i1_1, array_min=v_array_min_3} OutVars{min_samples=v_min_samples_1, i1=v_i1_1, array_min=v_array_min_3} AuxVars[] AssignedVars[min_samples][178], 34:5A:[69] L61-->L59: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1) InVars {i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_2} OutVars{i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_1} AuxVars[] AssignedVars[max_samples][50]] [2023-10-12 17:37:14,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:14,613 INFO L124 PetriNetUnfolderBase]: 17/33 cut-off events. [2023-10-12 17:37:14,613 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-10-12 17:37:14,613 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:14,614 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [78] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_thidvar0] 39#[$Ultimate##0, L68]true [81] L68-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 82#[$Ultimate##0, $Ultimate##0, L69]true [84] L69-->L59: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_thidvar1] 123#[$Ultimate##0, $Ultimate##0, L59, L70]true [2023-10-12 17:37:14,614 INFO L750 eck$LassoCheckResult]: Loop: 123#[$Ultimate##0, $Ultimate##0, L59, L70]true [68] L59-->L61: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_1) v_array_min_3)) InVars {min_samples=v_min_samples_2, i1=v_i1_1, array_min=v_array_min_3} OutVars{min_samples=v_min_samples_1, i1=v_i1_1, array_min=v_array_min_3} AuxVars[] AssignedVars[min_samples] 126#[$Ultimate##0, $Ultimate##0, L61, L70]true [69] L61-->L59: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1) InVars {i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_2} OutVars{i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_1} AuxVars[] AssignedVars[max_samples] 123#[$Ultimate##0, $Ultimate##0, L59, L70]true [2023-10-12 17:37:14,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash 107344, now seen corresponding path program 1 times [2023-10-12 17:37:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:14,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8008452] [2023-10-12 17:37:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:14,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:14,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 3138, now seen corresponding path program 1 times [2023-10-12 17:37:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:14,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620960834] [2023-10-12 17:37:14,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:14,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 103159761, now seen corresponding path program 1 times [2023-10-12 17:37:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365633810] [2023-10-12 17:37:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:14,759 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 [2023-10-12 17:37:14,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:14,824 INFO L201 PluginConnector]: Adding new model min-max-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:14 BoogieIcfgContainer [2023-10-12 17:37:14,827 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:14,829 INFO L158 Benchmark]: Toolchain (without parser) took 2574.05ms. Allocated memory was 181.4MB in the beginning and 264.2MB in the end (delta: 82.8MB). Free memory was 130.9MB in the beginning and 225.3MB in the end (delta: -94.4MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:14,830 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.31ms. Allocated memory is still 181.4MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:14,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.75ms. Allocated memory is still 181.4MB. Free memory was 130.9MB in the beginning and 129.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:14,831 INFO L158 Benchmark]: Boogie Preprocessor took 19.39ms. Allocated memory is still 181.4MB. Free memory was 129.4MB in the beginning and 128.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:14,832 INFO L158 Benchmark]: RCFGBuilder took 226.95ms. Allocated memory is still 181.4MB. Free memory was 128.2MB in the beginning and 118.5MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:14,837 INFO L158 Benchmark]: BuchiAutomizer took 2301.57ms. Allocated memory was 181.4MB in the beginning and 264.2MB in the end (delta: 82.8MB). Free memory was 118.3MB in the beginning and 225.3MB in the end (delta: -107.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:14,838 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.31ms. Allocated memory is still 181.4MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.75ms. Allocated memory is still 181.4MB. Free memory was 130.9MB in the beginning and 129.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.39ms. Allocated memory is still 181.4MB. Free memory was 129.4MB in the beginning and 128.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 226.95ms. Allocated memory is still 181.4MB. Free memory was 128.2MB in the beginning and 118.5MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2301.57ms. Allocated memory was 181.4MB in the beginning and 264.2MB in the end (delta: 82.8MB). Free memory was 118.3MB in the beginning and 225.3MB in the end (delta: -107.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 3 locations. The remainder module has 1968 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 78 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital45 mio100 ax100 hnf100 lsp129 ukn56 mio100 lsp66 div100 bol100 ite100 ukn100 eq172 hnf94 smp100 dnf150 smp62 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 92ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 59]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L68] FORK 0 fork 1 computeMin(); [L69] FORK 0 fork 2, 2 computeMax(); [L70] FORK 0 fork 3, 3, 3 sample(); Loop: [L60] min_samples[i1 - 1] := array_min; [L61] max_samples[i2 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 59]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L68] FORK 0 fork 1 computeMin(); [L69] FORK 0 fork 2, 2 computeMax(); [L70] FORK 0 fork 3, 3, 3 sample(); Loop: [L60] min_samples[i1 - 1] := array_min; [L61] max_samples[i2 - 1] := array_max; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 30 PlacesBefore, 25 PlacesAfterwards, 23 TransitionsBefore, 18 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 214 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 98, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 98, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 98, unknown conditional: 0, unknown unconditional: 98] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:37:14,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...