/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:29:39,225 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:29:39,301 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:29:39,330 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:29:39,330 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:29:39,331 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:29:39,332 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:29:39,333 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:29:39,333 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:29:39,336 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:29:39,336 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:29:39,336 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:29:39,337 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:29:39,338 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:29:39,338 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:29:39,338 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:29:39,338 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:29:39,339 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:29:39,339 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:29:39,339 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:29:39,339 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:29:39,339 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:29:39,340 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:29:39,340 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:29:39,340 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:29:39,340 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:29:39,340 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:29:39,340 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:29:39,340 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:29:39,341 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:29:39,341 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:29:39,341 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:29:39,342 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:29:39,343 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:29:39,343 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:29:39,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:29:39,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:29:39,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:29:39,568 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:29:39,570 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:29:39,571 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-array.wvr.bpl [2023-10-12 17:29:39,571 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-array.wvr.bpl' [2023-10-12 17:29:39,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:29:39,594 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:29:39,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:29:39,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:29:39,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:29:39,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,617 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:29:39,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:29:39,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:29:39,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:29:39,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:29:39,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:29:39,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:29:39,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:29:39,635 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:29:39,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/1) ... [2023-10-12 17:29:39,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:39,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:39,655 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:29:39,675 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:29:39,700 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:29:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:29:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:29:39,701 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:29:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:29:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:29:39,701 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:29:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:29:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:29:39,701 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:29:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:29:39,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:29:39,702 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:29:39,739 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:29:39,740 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:29:39,908 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:29:39,920 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:29:39,920 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:29:39,925 INFO L201 PluginConnector]: Adding new model min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:29:39 BoogieIcfgContainer [2023-10-12 17:29:39,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:29:39,935 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:29:39,936 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:29:39,940 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:29:39,941 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:29:39,941 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:39" (1/2) ... [2023-10-12 17:29:39,950 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@798575ab and model type min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:29:39, skipping insertion in model container [2023-10-12 17:29:39,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:29:39,951 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:29:39" (2/2) ... [2023-10-12 17:29:39,952 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-array.wvr.bpl [2023-10-12 17:29:40,047 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:29:40,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:29:40,090 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:29:40,091 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:29:40,094 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 5. Compared 36 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:29:40,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:29:40,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:40,100 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:29:40,109 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:40,111 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:40,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:40,117 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:29:40,117 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:29:40,117 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 5. Compared 36 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:29:40,118 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:29:40,365 INFO L134 LiptonReduction]: Checked pairs total: 106 [2023-10-12 17:29:40,365 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:29:40,374 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:29:40,374 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:29:40,375 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:29:40,375 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:29:40,375 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:29:40,375 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:29:40,375 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:29:40,375 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:29:40,375 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:29:40,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:40,378 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:29:40,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:29:40,378 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:40,380 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:29:40,380 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:29:40,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:40,381 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:29:40,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:29:40,381 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:40,385 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_j_19) (= v_i_19 v_min1_19) (= v_i_19 v_min2_29)) InVars {min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [2023-10-12 17:29:40,385 INFO L750 eck$LassoCheckResult]: Loop: 44#[L22-1, L58-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_min1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< .cse0 v_min1_16) .cse0 v_min1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, min1=v_min1_16, N=v_N_12, i=v_i_16} OutVars{A=v_A_14, min1=v_min1_15, N=v_N_12, i=v_i_15} AuxVars[] AssignedVars[min1, i] 44#[L22-1, L58-1]true [2023-10-12 17:29:40,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash 4204, now seen corresponding path program 1 times [2023-10-12 17:29:40,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:40,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703386872] [2023-10-12 17:29:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:40,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:40,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:40,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:40,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:29:40,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:40,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683716515] [2023-10-12 17:29:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:40,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:40,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:40,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:40,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash 130423, now seen corresponding path program 1 times [2023-10-12 17:29:40,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:40,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220730515] [2023-10-12 17:29:40,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:40,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:40,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:40,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:40,668 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:40,668 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:40,668 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:40,669 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:40,669 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:40,669 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:40,669 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:40,669 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:40,669 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-array.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:29:40,669 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:40,669 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:40,680 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:29:40,716 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:29:40,718 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:29:40,720 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:29:40,802 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:40,804 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:40,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:40,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:40,808 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:29:40,828 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:29:40,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:40,835 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:29:40,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:40,836 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:29:40,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:40,845 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:29:40,845 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:29:40,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:40,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:29:40,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:40,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:40,878 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:29:40,906 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:29:40,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:40,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:40,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:40,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:40,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:40,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:40,924 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:29:40,940 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:40,960 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:29:40,960 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:29:40,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:40,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:40,975 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:29:40,993 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:41,001 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:29:41,021 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:29:41,021 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:41,021 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:29:41,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:29:41,030 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:29:41,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:41,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:41,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:41,072 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:29:41,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:41,073 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:29:41,097 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:29:41,098 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:29:41,206 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 256 transitions. [2023-10-12 17:29:41,207 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:41,211 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:41,212 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:29:41,217 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:29:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:29:41,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:29:41,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:41,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:29:41,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:41,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:29:41,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:41,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:41,272 INFO L124 PetriNetUnfolderBase]: 135/207 cut-off events. [2023-10-12 17:29:41,272 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-10-12 17:29:41,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 207 events. 135/207 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 554 event pairs, 18 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 344. Up to 71 conditions per place. [2023-10-12 17:29:41,273 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:41,276 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:41,276 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:41,276 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:29:41,276 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:41,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:41,280 INFO L124 PetriNetUnfolderBase]: 29/44 cut-off events. [2023-10-12 17:29:41,280 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:29:41,280 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:41,281 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_j_19) (= v_i_19 v_min1_19) (= v_i_19 v_min2_29)) InVars {min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-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] 89#[L22-1, L59, L33-1]true [2023-10-12 17:29:41,281 INFO L750 eck$LassoCheckResult]: Loop: 89#[L22-1, L59, L33-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= v_min2_25 (let ((.cse0 (select v_A_12 v_j_16))) (ite (< .cse0 v_min2_26) .cse0 v_min2_26))) (< v_j_16 v_M_10)) InVars {min2=v_min2_26, A=v_A_12, M=v_M_10, j=v_j_16} OutVars{min2=v_min2_25, A=v_A_12, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[min2, j] 89#[L22-1, L59, L33-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= v_min2_25 (let ((.cse0 (select v_A_12 v_j_16))) (ite (< .cse0 v_min2_26) .cse0 v_min2_26))) (< v_j_16 v_M_10)) InVars {min2=v_min2_26, A=v_A_12, M=v_M_10, j=v_j_16} OutVars{min2=v_min2_25, A=v_A_12, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[min2, j] 89#[L22-1, L59, L33-1]true [2023-10-12 17:29:41,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:41,282 INFO L85 PathProgramCache]: Analyzing trace with hash 130408, now seen corresponding path program 1 times [2023-10-12 17:29:41,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:41,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320060446] [2023-10-12 17:29:41,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:41,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:41,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash 4065, now seen corresponding path program 1 times [2023-10-12 17:29:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:41,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503712400] [2023-10-12 17:29:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:41,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash 125325192, now seen corresponding path program 1 times [2023-10-12 17:29:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653568252] [2023-10-12 17:29:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:41,453 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:41,454 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:41,454 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:41,454 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:41,454 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:41,454 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:41,454 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:41,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:41,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-array.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:29:41,454 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:41,454 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:41,457 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:29:41,459 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:29:41,461 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:29:41,537 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:29:41,540 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:29:41,542 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:29:41,712 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:41,712 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:41,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:41,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:41,725 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:29:41,753 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:29:41,754 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:29:41,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:41,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:41,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:41,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:41,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:41,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:41,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:41,803 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:29:41,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:41,812 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:29:41,837 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:29:41,837 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:29:41,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:41,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:41,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:41,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:41,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:41,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:41,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:41,869 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:29:41,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:41,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:41,879 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:29:41,881 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:29:41,883 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:29:41,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:41,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:41,890 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:29:41,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:41,910 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:29:41,910 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:29:41,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:41,979 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:29:41,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:41,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:42,002 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:29:42,012 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:29:42,025 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:29:42,026 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:29:42,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:42,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:42,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:42,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:42,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:42,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:42,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:42,072 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:29:42,072 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:29:42,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:42,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:42,090 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:29:42,159 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:29:42,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:42,176 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:29:42,176 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:42,176 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:29:42,194 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:29:42,197 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:29:42,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:42,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:42,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:42,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:29:42,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:42,238 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:29:42,239 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:29:42,355 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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) Result 7 states and 338 transitions. [2023-10-12 17:29:42,358 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:42,385 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:29:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:29:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2023-10-12 17:29:42,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:29:42,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:42,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:29:42,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:42,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:29:42,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:42,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:29:42,495 INFO L124 PetriNetUnfolderBase]: 383/568 cut-off events. [2023-10-12 17:29:42,495 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2023-10-12 17:29:42,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 568 events. 383/568 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2007 event pairs, 26 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 1278. Up to 202 conditions per place. [2023-10-12 17:29:42,498 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:29:42,531 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:29:42,531 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:29:42,531 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:29:42,532 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:29:42,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:42,571 INFO L124 PetriNetUnfolderBase]: 151/213 cut-off events. [2023-10-12 17:29:42,571 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-10-12 17:29:42,571 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:42,572 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_j_19) (= v_i_19 v_min1_19) (= v_i_19 v_min2_29)) InVars {min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-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] 89#[L22-1, L59, L33-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_min1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< .cse0 v_min1_16) .cse0 v_min1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, min1=v_min1_16, N=v_N_12, i=v_i_16} OutVars{A=v_A_14, min1=v_min1_15, N=v_N_12, i=v_i_15} AuxVars[] AssignedVars[min1, i] 89#[L22-1, L59, L33-1]true [87] L59-->L44-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] 148#[L22-1, L60, L33-1, L44-1]true [98] L22-1-->thread1EXIT: Formula: (<= v_N_10 v_i_13) InVars {N=v_N_10, i=v_i_13} OutVars{N=v_N_10, i=v_i_13} AuxVars[] AssignedVars[] 150#[L60, L33-1, L44-1, thread1EXIT]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_min2_21 (let ((.cse0 (select v_A_10 v_k_16))) (ite (< .cse0 v_min2_22) .cse0 v_min2_22))) (< v_k_16 v_N_8)) InVars {min2=v_min2_22, A=v_A_10, N=v_N_8, k=v_k_16} OutVars{min2=v_min2_21, A=v_A_10, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[min2, k] 150#[L60, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:29:42,572 INFO L750 eck$LassoCheckResult]: Loop: 150#[L60, L33-1, L44-1, thread1EXIT]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_min2_21 (let ((.cse0 (select v_A_10 v_k_16))) (ite (< .cse0 v_min2_22) .cse0 v_min2_22))) (< v_k_16 v_N_8)) InVars {min2=v_min2_22, A=v_A_10, N=v_N_8, k=v_k_16} OutVars{min2=v_min2_21, A=v_A_10, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[min2, k] 150#[L60, L33-1, L44-1, thread1EXIT]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_min2_21 (let ((.cse0 (select v_A_10 v_k_16))) (ite (< .cse0 v_min2_22) .cse0 v_min2_22))) (< v_k_16 v_N_8)) InVars {min2=v_min2_22, A=v_A_10, N=v_N_8, k=v_k_16} OutVars{min2=v_min2_21, A=v_A_10, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[min2, k] 150#[L60, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:29:42,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 178478329, now seen corresponding path program 1 times [2023-10-12 17:29:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778053519] [2023-10-12 17:29:42,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:42,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:42,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:42,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:42,597 INFO L85 PathProgramCache]: Analyzing trace with hash 4001, now seen corresponding path program 1 times [2023-10-12 17:29:42,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:42,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778608007] [2023-10-12 17:29:42,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:42,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:42,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:42,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:42,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash -281014631, now seen corresponding path program 2 times [2023-10-12 17:29:42,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:42,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945365854] [2023-10-12 17:29:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:42,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:42,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:29:42,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945365854] [2023-10-12 17:29:42,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945365854] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:29:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444322139] [2023-10-12 17:29:42,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:29:42,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:29:42,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:42,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:29:42,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-10-12 17:29:42,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:29:42,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:29:42,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:29:42,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:42,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:29:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:42,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444322139] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:29:42,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:29:42,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-10-12 17:29:42,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289454205] [2023-10-12 17:29:42,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:29:42,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:29:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-10-12 17:29:42,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-10-12 17:29:42,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 2608 transitions, 19104 flow. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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:29:42,918 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:29:42,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:29:43,096 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:29:43,479 INFO L124 PetriNetUnfolderBase]: 1809/2807 cut-off events. [2023-10-12 17:29:43,479 INFO L125 PetriNetUnfolderBase]: For 1010/1010 co-relation queries the response was YES. [2023-10-12 17:29:43,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 2807 events. 1809/2807 cut-off events. For 1010/1010 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14703 event pairs, 27 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 8551. Up to 989 conditions per place. [2023-10-12 17:29:43,494 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 645 selfloop transitions, 271 changer transitions 384/1300 dead transitions. [2023-10-12 17:29:43,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:43,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:43,752 INFO L124 PetriNetUnfolderBase]: 1809/2807 cut-off events. [2023-10-12 17:29:43,752 INFO L125 PetriNetUnfolderBase]: For 1010/1010 co-relation queries the response was YES. [2023-10-12 17:29:43,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 2807 events. 1809/2807 cut-off events. For 1010/1010 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14689 event pairs, 27 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 8551. Up to 989 conditions per place. [2023-10-12 17:29:43,756 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:43,767 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-10-12 17:29:43,769 INFO L430 stractBuchiCegarLoop]: Abstraction has has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:43,769 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:29:43,769 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:43,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:43,811 INFO L124 PetriNetUnfolderBase]: 260/390 cut-off events. [2023-10-12 17:29:43,811 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-10-12 17:29:43,812 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:43,812 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_j_19) (= v_i_19 v_min1_19) (= v_i_19 v_min2_29)) InVars {min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-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] 89#[L22-1, L59, L33-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_min1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< .cse0 v_min1_16) .cse0 v_min1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, min1=v_min1_16, N=v_N_12, i=v_i_16} OutVars{A=v_A_14, min1=v_min1_15, N=v_N_12, i=v_i_15} AuxVars[] AssignedVars[min1, i] 89#[L22-1, L59, L33-1]true [87] L59-->L44-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] 148#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:29:43,812 INFO L750 eck$LassoCheckResult]: Loop: 148#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_min2_21 (let ((.cse0 (select v_A_10 v_k_16))) (ite (< .cse0 v_min2_22) .cse0 v_min2_22))) (< v_k_16 v_N_8)) InVars {min2=v_min2_22, A=v_A_10, N=v_N_8, k=v_k_16} OutVars{min2=v_min2_21, A=v_A_10, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[min2, k] 148#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_min2_21 (let ((.cse0 (select v_A_10 v_k_16))) (ite (< .cse0 v_min2_22) .cse0 v_min2_22))) (< v_k_16 v_N_8)) InVars {min2=v_min2_22, A=v_A_10, N=v_N_8, k=v_k_16} OutVars{min2=v_min2_21, A=v_A_10, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[min2, k] 148#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:29:43,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:43,813 INFO L85 PathProgramCache]: Analyzing trace with hash 125325244, now seen corresponding path program 1 times [2023-10-12 17:29:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:43,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105984041] [2023-10-12 17:29:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:43,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:43,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:43,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash 4001, now seen corresponding path program 2 times [2023-10-12 17:29:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:43,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221623096] [2023-10-12 17:29:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:43,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:43,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:43,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:43,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash 178478236, now seen corresponding path program 1 times [2023-10-12 17:29:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:43,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280615916] [2023-10-12 17:29:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:43,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:43,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:44,093 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:44,093 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:44,093 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:44,093 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:44,093 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:44,093 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:44,093 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:44,093 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:44,093 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-array.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:29:44,093 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:44,093 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:44,098 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:29:44,208 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:29:44,210 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:29:44,214 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:29:44,216 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:29:44,218 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:29:44,221 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:29:44,223 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:29:44,225 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:29:44,439 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:44,439 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:44,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:44,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:44,440 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:29:44,455 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:29:44,456 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:29:44,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:44,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:44,463 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:29:44,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:44,473 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:29:44,473 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:29:44,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:44,527 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:29:44,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:44,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:44,541 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:29:44,544 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:29:44,545 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:29:44,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:44,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:44,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:44,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:44,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:44,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:44,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:44,590 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:29:44,591 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:29:44,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:44,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:44,593 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:29:44,594 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:29:44,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:44,629 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:29:44,629 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:44,629 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:29:44,633 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:29:44,635 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:29:44,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:44,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:44,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:44,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:29:44,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:44,659 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:29:44,659 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:29:44,725 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 338 transitions. [2023-10-12 17:29:44,725 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:44,875 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:29:44,879 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:29:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:29:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2023-10-12 17:29:44,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:29:44,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:44,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:29:44,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:44,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:29:44,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:44,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:29:49,511 INFO L124 PetriNetUnfolderBase]: 4062/6244 cut-off events. [2023-10-12 17:29:49,511 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2023-10-12 17:29:49,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32787 conditions, 6244 events. 4062/6244 cut-off events. For 2163/2163 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 37270 event pairs, 4 based on Foata normal form. 0/3699 useless extension candidates. Maximal degree in co-relation 23231. Up to 2296 conditions per place. [2023-10-12 17:29:49,515 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:29:49,749 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:29:49,749 INFO L430 stractBuchiCegarLoop]: Abstraction has has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:29:49,749 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:29:49,749 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:29:55,824 INFO L124 PetriNetUnfolderBase]: 4062/6244 cut-off events. [2023-10-12 17:29:55,824 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2023-10-12 17:29:55,824 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:29:55,829 INFO L201 PluginConnector]: Adding new model min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:29:55 BoogieIcfgContainer [2023-10-12 17:29:55,829 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:29:55,829 INFO L158 Benchmark]: Toolchain (without parser) took 16235.14ms. Allocated memory was 198.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 152.4MB in the beginning and 963.9MB in the end (delta: -811.5MB). Peak memory consumption was 645.0MB. Max. memory is 8.0GB. [2023-10-12 17:29:55,830 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.30ms. Allocated memory is still 198.2MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:29:55,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.80ms. Allocated memory is still 198.2MB. Free memory was 152.4MB in the beginning and 150.9MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:29:55,830 INFO L158 Benchmark]: Boogie Preprocessor took 13.98ms. Allocated memory is still 198.2MB. Free memory was 150.9MB in the beginning and 149.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:29:55,831 INFO L158 Benchmark]: RCFGBuilder took 290.92ms. Allocated memory is still 198.2MB. Free memory was 149.8MB in the beginning and 139.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:29:55,831 INFO L158 Benchmark]: BuchiAutomizer took 15893.78ms. Allocated memory was 198.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 139.3MB in the beginning and 963.9MB in the end (delta: -824.6MB). Peak memory consumption was 630.3MB. Max. memory is 8.0GB. [2023-10-12 17:29:55,832 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.30ms. Allocated memory is still 198.2MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.80ms. Allocated memory is still 198.2MB. Free memory was 152.4MB in the beginning and 150.9MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.98ms. Allocated memory is still 198.2MB. Free memory was 150.9MB in the beginning and 149.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 290.92ms. Allocated memory is still 198.2MB. Free memory was 149.8MB in the beginning and 139.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 15893.78ms. Allocated memory was 198.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 139.3MB in the beginning and 963.9MB in the end (delta: -824.6MB). Peak memory consumption was 630.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). 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 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.7s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.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: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 499 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 589 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 146 mSDtfsCounter, 589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital104 mio100 ax100 hnf100 lsp314 ukn30 mio100 lsp58 div100 bol100 ite100 ukn100 eq157 hnf97 smp100 dnf329 smp41 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 87ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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.3s, 33 PlacesBefore, 22 PlacesAfterwards, 26 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 106, independent conditional: 0, independent unconditional: 106, 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: 106, independent: 24, independent conditional: 0, independent unconditional: 24, 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:29:55,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:56,054 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...