/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/weaver-benchmarks/generated/popl20-more/min-fun.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:30,223 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:30,271 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:40:30,288 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:30,289 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:30,289 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:30,290 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:30,290 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:30,291 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:30,291 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:30,291 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:30,291 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:30,292 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:30,292 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:30,292 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:30,292 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:30,293 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:30,293 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:30,293 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:30,293 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:30,293 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:30,296 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:30,297 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:30,297 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:30,300 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:30,300 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:30,300 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:30,300 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:30,301 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:30,301 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:30,302 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:30,302 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:30,302 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:30,303 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:30,303 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:40:30,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:30,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:30,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:30,511 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:30,511 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:30,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-fun.wvr.bpl [2023-10-12 17:40:30,513 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-fun.wvr.bpl' [2023-10-12 17:40:30,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:30,537 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:30,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:30,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:30,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:30,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,561 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:30,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:30,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:30,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:30,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:30,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:30,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:30,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:30,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:30,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/1) ... [2023-10-12 17:40:30,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:30,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:30,600 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:40:30,616 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:40:30,655 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:30,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:30,655 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:30,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:30,656 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:30,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:30,656 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:40:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:40:30,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:40:30,657 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:40:30,704 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:30,706 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:30,829 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:30,845 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:30,845 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:30,847 INFO L201 PluginConnector]: Adding new model min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:30 BoogieIcfgContainer [2023-10-12 17:40:30,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:30,847 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:30,848 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:30,855 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:30,855 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:30,856 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:30" (1/2) ... [2023-10-12 17:40:30,857 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4da22c13 and model type min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:30, skipping insertion in model container [2023-10-12 17:40:30,857 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:30,857 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:30" (2/2) ... [2023-10-12 17:40:30,858 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-fun.wvr.bpl [2023-10-12 17:40:30,917 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:40:30,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:40:30,961 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:40:30,961 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:30,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:40:30,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:40:30,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:30,969 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:30,979 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:30,981 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:30,986 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:40:30,986 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:30,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:40:30,987 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:40:31,226 INFO L134 LiptonReduction]: Checked pairs total: 124 [2023-10-12 17:40:31,227 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:40:31,239 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:31,240 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:31,240 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:31,240 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:31,240 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:31,240 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:31,240 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:31,241 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:31,241 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:40:31,244 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_min3_21) (<= 0 v_M_14) (= v_i_21 v_min1_21) (= v_i_21 v_min2_21) (= v_M_14 v_k_17) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][14], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[96] L23-1-->L23-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_10) (= (let ((.cse0 (select v_A_12 v_i_16))) (ite (< .cse0 v_min1_12) .cse0 v_min1_12)) v_min1_11)) InVars {A=v_A_12, min1=v_min1_12, N=v_N_10, i=v_i_16} OutVars{A=v_A_12, min1=v_min1_11, N=v_N_10, i=v_i_15} AuxVars[] AssignedVars[min1, i][10]] [2023-10-12 17:40:31,246 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:31,247 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:31,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:31,249 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:31,252 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:31,252 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:40:31,254 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_min3_21) (<= 0 v_M_14) (= v_i_21 v_min1_21) (= v_i_21 v_min2_21) (= v_M_14 v_k_17) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][14], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[96] L23-1-->L23-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_10) (= (let ((.cse0 (select v_A_12 v_i_16))) (ite (< .cse0 v_min1_12) .cse0 v_min1_12)) v_min1_11)) InVars {A=v_A_12, min1=v_min1_12, N=v_N_10, i=v_i_16} OutVars{A=v_A_12, min1=v_min1_11, N=v_N_10, i=v_i_15} AuxVars[] AssignedVars[min1, i][10]] [2023-10-12 17:40:31,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:31,255 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:31,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:31,255 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:31,259 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_min3_21) (<= 0 v_M_14) (= v_i_21 v_min1_21) (= v_i_21 v_min2_21) (= v_M_14 v_k_17) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 42#[L59]true [81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L23-1, L59-1]true [2023-10-12 17:40:31,260 INFO L750 eck$LassoCheckResult]: Loop: 44#[L23-1, L59-1]true [96] L23-1-->L23-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_10) (= (let ((.cse0 (select v_A_12 v_i_16))) (ite (< .cse0 v_min1_12) .cse0 v_min1_12)) v_min1_11)) InVars {A=v_A_12, min1=v_min1_12, N=v_N_10, i=v_i_16} OutVars{A=v_A_12, min1=v_min1_11, N=v_N_10, i=v_i_15} AuxVars[] AssignedVars[min1, i] 44#[L23-1, L59-1]true [2023-10-12 17:40:31,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash 4204, now seen corresponding path program 1 times [2023-10-12 17:40:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298943743] [2023-10-12 17:40:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:31,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:31,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:31,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 127, now seen corresponding path program 1 times [2023-10-12 17:40:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425280057] [2023-10-12 17:40:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:31,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:31,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:31,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:31,387 INFO L85 PathProgramCache]: Analyzing trace with hash 130420, now seen corresponding path program 1 times [2023-10-12 17:40:31,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:31,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202117436] [2023-10-12 17:40:31,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:31,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:31,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:31,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:31,537 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:31,538 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:31,538 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:31,538 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:31,538 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:31,538 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:31,538 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:31,538 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:31,538 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-fun.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:40:31,539 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:31,539 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:31,551 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:40:31,558 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:40:31,560 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:40:31,596 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:40:31,598 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:40:31,691 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:31,694 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:31,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:31,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:31,698 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:40:31,699 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:40:31,700 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:40:31,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:31,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:31,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:31,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:31,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:31,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:31,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:31,733 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:40:31,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:31,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:31,735 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:40:31,737 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:40:31,738 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:40:31,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:31,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:31,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:31,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:31,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:31,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:31,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:31,766 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:40:31,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:31,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:31,768 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:40:31,770 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:40:31,776 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:40:31,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:31,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:31,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:31,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:31,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:31,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:31,804 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:31,814 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:40:31,814 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:40:31,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:31,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:31,819 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:40:31,819 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:40:31,821 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:31,838 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:31,838 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:31,839 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:40:31,845 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:40:31,847 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:31,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:31,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:31,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:31,888 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:31,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:31,889 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:40:31,910 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:40:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:31,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:40:31,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:31,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:31,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:31,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:40:31,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:31,992 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 60 transitions, 312 flow [2023-10-12 17:40:31,996 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:31,996 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 60 transitions, 312 flow [2023-10-12 17:40:31,998 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_min3_21) (<= 0 v_M_14) (= v_i_21 v_min1_21) (= v_i_21 v_min2_21) (= v_M_14 v_k_17) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][56], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 4:3A:[84] L59-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][14]][5:4A:[94] L34-1-->L34-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_10 v_j_16))) (ite (< .cse0 v_min2_12) .cse0 v_min2_12)) v_min2_11) (< v_j_16 v_M_10)) InVars {min2=v_min2_12, A=v_A_10, M=v_M_10, j=v_j_16} OutVars{min2=v_min2_11, A=v_A_10, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[min2, j][51]] [2023-10-12 17:40:31,998 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:31,998 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:40:31,998 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:31,998 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:31,999 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_min3_21) (<= 0 v_M_14) (= v_i_21 v_min1_21) (= v_i_21 v_min2_21) (= v_M_14 v_k_17) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 42#[L59]true [81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L23-1, L59-1]true [84] L59-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 79#[L23-1, L60, L34-1]true [2023-10-12 17:40:31,999 INFO L750 eck$LassoCheckResult]: Loop: 79#[L23-1, L60, L34-1]true [94] L34-1-->L34-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_10 v_j_16))) (ite (< .cse0 v_min2_12) .cse0 v_min2_12)) v_min2_11) (< v_j_16 v_M_10)) InVars {min2=v_min2_12, A=v_A_10, M=v_M_10, j=v_j_16} OutVars{min2=v_min2_11, A=v_A_10, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[min2, j] 79#[L23-1, L60, L34-1]true [2023-10-12 17:40:31,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash 130408, now seen corresponding path program 1 times [2023-10-12 17:40:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:31,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678269552] [2023-10-12 17:40:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:32,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash 125, now seen corresponding path program 1 times [2023-10-12 17:40:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:32,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553886847] [2023-10-12 17:40:32,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:32,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:32,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash 4042742, now seen corresponding path program 1 times [2023-10-12 17:40:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:32,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421450466] [2023-10-12 17:40:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:32,113 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:32,113 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:32,113 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:32,113 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:32,113 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:32,113 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:32,113 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:32,113 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:32,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-fun.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:40:32,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:32,114 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:32,115 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:40:32,117 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:40:32,119 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:40:32,144 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:40:32,146 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:40:32,148 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:40:32,150 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:40:32,245 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:32,246 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:32,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:32,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:32,260 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:40:32,261 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:40:32,262 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:40:32,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:32,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:32,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:32,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:32,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:32,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:32,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:32,302 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:40:32,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:32,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:32,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:32,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:40:32,307 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:40:32,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:32,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:32,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:32,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:32,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:32,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:32,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:32,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:32,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:32,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:32,377 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:32,379 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:40:32,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:32,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:32,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:32,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:32,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:40:32,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:32,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:32,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:32,422 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:40:32,422 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:40:32,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:32,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:32,424 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:32,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:40:32,427 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:32,448 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:32,448 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:32,448 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:40:32,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:32,460 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:32,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:32,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:32,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:32,483 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:32,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:32,484 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:40:32,484 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:40:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:32,544 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:40:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:32,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:32,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:32,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:32,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:32,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:40:32,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:32,550 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 240 transitions, 1728 flow [2023-10-12 17:40:32,550 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:40:32,550 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 240 transitions, 1728 flow [2023-10-12 17:40:32,553 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_min3_21) (<= 0 v_M_14) (= v_i_21 v_min1_21) (= v_i_21 v_min2_21) (= v_M_14 v_k_17) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][225], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[84] L59-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][57], 7:4A:[87] L60-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][95]][8:5A:[99] L45-1-->L45-1: Formula: (and (= (let ((.cse0 (select v_A_14 v_k_14))) (ite (< .cse0 v_min3_14) .cse0 v_min3_14)) v_min3_13) (= v_k_13 (+ v_k_14 1)) (< v_k_14 v_N_14)) InVars {A=v_A_14, min3=v_min3_14, N=v_N_14, k=v_k_14} OutVars{A=v_A_14, min3=v_min3_13, N=v_N_14, k=v_k_13} AuxVars[] AssignedVars[min3, k][110]] [2023-10-12 17:40:32,553 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:32,553 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2023-10-12 17:40:32,553 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:40:32,553 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:32,554 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_min3_21) (<= 0 v_M_14) (= v_i_21 v_min1_21) (= v_i_21 v_min2_21) (= v_M_14 v_k_17) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{min2=v_min2_21, min3=v_min3_21, min1=v_min1_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 42#[L59]true [81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L23-1, L59-1]true [84] L59-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 79#[L23-1, L60, L34-1]true [87] L60-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 113#[L23-1, L61, L34-1, L45-1]true [2023-10-12 17:40:32,554 INFO L750 eck$LassoCheckResult]: Loop: 113#[L23-1, L61, L34-1, L45-1]true [99] L45-1-->L45-1: Formula: (and (= (let ((.cse0 (select v_A_14 v_k_14))) (ite (< .cse0 v_min3_14) .cse0 v_min3_14)) v_min3_13) (= v_k_13 (+ v_k_14 1)) (< v_k_14 v_N_14)) InVars {A=v_A_14, min3=v_min3_14, N=v_N_14, k=v_k_14} OutVars{A=v_A_14, min3=v_min3_13, N=v_N_14, k=v_k_13} AuxVars[] AssignedVars[min3, k] 113#[L23-1, L61, L34-1, L45-1]true [2023-10-12 17:40:32,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash 4042735, now seen corresponding path program 1 times [2023-10-12 17:40:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:32,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802819197] [2023-10-12 17:40:32,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:32,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:32,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:40:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:32,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640491020] [2023-10-12 17:40:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:32,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:32,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 125324884, now seen corresponding path program 1 times [2023-10-12 17:40:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599730727] [2023-10-12 17:40:32,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:32,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:40:32,710 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:40:32,742 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:32,742 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:32,742 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:32,742 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:32,742 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:32,742 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:32,742 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:32,742 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:32,742 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-fun.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:40:32,742 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:32,742 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:32,745 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:40:32,747 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:40:32,749 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:40:32,751 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:40:32,753 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:40:32,755 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:40:32,783 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:40:32,785 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:40:32,787 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:40:32,790 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:40:32,792 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:40:32,909 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:32,910 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:32,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:32,911 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) [2023-10-12 17:40:32,913 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 [2023-10-12 17:40:32,914 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:40:32,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:32,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:32,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:32,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:32,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:32,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:32,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:32,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:32,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:32,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,076 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) [2023-10-12 17:40:33,079 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 [2023-10-12 17:40:33,079 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:40:33,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:33,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:33,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:33,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:33,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:33,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,104 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) [2023-10-12 17:40:33,106 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 [2023-10-12 17:40:33,107 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:40:33,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:33,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:33,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:33,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:33,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:33,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,174 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) [2023-10-12 17:40:33,175 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 [2023-10-12 17:40:33,177 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:40:33,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:33,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:33,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:33,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:33,200 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 [2023-10-12 17:40:33,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,201 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) [2023-10-12 17:40:33,203 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 [2023-10-12 17:40:33,205 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:40:33,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:33,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:33,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:33,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:33,243 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 [2023-10-12 17:40:33,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,244 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) [2023-10-12 17:40:33,245 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 [2023-10-12 17:40:33,247 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:40:33,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,254 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:40:33,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,262 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:40:33,262 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:40:33,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:33,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:33,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,277 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) [2023-10-12 17:40:33,279 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 [2023-10-12 17:40:33,280 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:40:33,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:33,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:33,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:33,303 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:33,314 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:40:33,314 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:40:33,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,316 INFO L229 MonitoredProcess]: Starting monitored process 17 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:40:33,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:40:33,323 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:33,344 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:33,344 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:33,344 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:40:33,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:33,351 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:33,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:33,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:33,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:33,373 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:33,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:33,373 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:40:33,374 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:40:33,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:33,428 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:40:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:33,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:33,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:33,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:40:33,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:33,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:40:33,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:33,429 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 960 transitions, 8832 flow [2023-10-12 17:40:33,429 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:40:33,429 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 960 transitions, 8832 flow [2023-10-12 17:40:33,451 INFO L124 PetriNetUnfolderBase]: 90/133 cut-off events. [2023-10-12 17:40:33,452 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:40:33,452 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:40:33,456 INFO L201 PluginConnector]: Adding new model min-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:40:33 BoogieIcfgContainer [2023-10-12 17:40:33,456 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:40:33,456 INFO L158 Benchmark]: Toolchain (without parser) took 2919.31ms. Allocated memory was 204.5MB in the beginning and 257.9MB in the end (delta: 53.5MB). Free memory was 155.3MB in the beginning and 172.0MB in the end (delta: -16.8MB). Peak memory consumption was 37.3MB. Max. memory is 8.0GB. [2023-10-12 17:40:33,457 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 204.5MB. Free memory was 156.6MB in the beginning and 156.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:40:33,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.56ms. Allocated memory is still 204.5MB. Free memory was 155.3MB in the beginning and 153.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:33,457 INFO L158 Benchmark]: Boogie Preprocessor took 13.74ms. Allocated memory is still 204.5MB. Free memory was 153.7MB in the beginning and 152.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:33,457 INFO L158 Benchmark]: RCFGBuilder took 268.90ms. Allocated memory is still 204.5MB. Free memory was 152.5MB in the beginning and 142.4MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:40:33,458 INFO L158 Benchmark]: BuchiAutomizer took 2608.39ms. Allocated memory was 204.5MB in the beginning and 257.9MB in the end (delta: 53.5MB). Free memory was 142.2MB in the beginning and 172.0MB in the end (delta: -29.8MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2023-10-12 17:40:33,459 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.24ms. Allocated memory is still 204.5MB. Free memory was 156.6MB in the beginning and 156.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.56ms. Allocated memory is still 204.5MB. Free memory was 155.3MB in the beginning and 153.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.74ms. Allocated memory is still 204.5MB. Free memory was 153.7MB in the beginning and 152.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 268.90ms. Allocated memory is still 204.5MB. Free memory was 152.5MB in the beginning and 142.4MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2608.39ms. Allocated memory was 204.5MB in the beginning and 257.9MB in the end (delta: 53.5MB). Free memory was 142.2MB in the beginning and 172.0MB in the end (delta: -29.8MB). Peak memory consumption was 24.7MB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.8s. Construction of modules took 0.1s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 114 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf100 lsp99 ukn59 mio100 lsp55 div100 bol100 ite100 ukn100 eq161 hnf94 smp100 dnf150 smp65 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 22 PlacesAfterwards, 26 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 82, unknown conditional: 0, unknown unconditional: 82] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:40:33,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:33,673 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...