fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r297-tall-167873950300333
Last Updated
May 14, 2023

About the Execution of LTSMin+red for PhilosophersDyn-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4264.012 3600000.00 9071787.00 3457.20 ? ? ? ? ? ? ? 20 1 1 1 1 ? 1 ? 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950300333.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PhilosophersDyn-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950300333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 52M
-rw-r--r-- 1 mcc users 118K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 462K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Feb 26 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 9.6M Feb 26 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 66K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 189K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.6M Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 335K Feb 26 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0M Feb 26 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15M Feb 26 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679498166696

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 15:16:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 15:16:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:16:09] [INFO ] Load time of PNML (sax parser for PT used): 727 ms
[2023-03-22 15:16:09] [INFO ] Transformed 540 places.
[2023-03-22 15:16:09] [INFO ] Transformed 17220 transitions.
[2023-03-22 15:16:09] [INFO ] Parsed PT model containing 540 places and 17220 transitions and 140780 arcs in 988 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
Normalized transition count is 15510 out of 17030 initially.
// Phase 1: matrix 15510 rows 540 cols
[2023-03-22 15:16:11] [INFO ] Computed 79 place invariants in 1311 ms
FORMULA PhilosophersDyn-PT-20-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1147 resets, run finished after 742 ms. (steps per millisecond=13 ) properties (out of 15) seen :28
FORMULA PhilosophersDyn-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :21
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :21
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :22
[2023-03-22 15:16:12] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2023-03-22 15:16:13] [INFO ] Computed 79 place invariants in 1162 ms
[2023-03-22 15:16:14] [INFO ] [Real]Absence check using 53 positive place invariants in 20 ms returned sat
[2023-03-22 15:16:14] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 39 ms returned sat
[2023-03-22 15:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:16:18] [INFO ] [Real]Absence check using state equation in 4642 ms returned unknown
[2023-03-22 15:16:18] [INFO ] [Real]Absence check using 53 positive place invariants in 27 ms returned sat
[2023-03-22 15:16:18] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-22 15:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:16:23] [INFO ] [Real]Absence check using state equation in 4915 ms returned unknown
[2023-03-22 15:16:23] [INFO ] [Real]Absence check using 53 positive place invariants in 21 ms returned sat
[2023-03-22 15:16:23] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-22 15:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:16:28] [INFO ] [Real]Absence check using state equation in 4923 ms returned unknown
[2023-03-22 15:16:29] [INFO ] [Real]Absence check using 53 positive place invariants in 46 ms returned sat
[2023-03-22 15:16:29] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 27 ms returned sat
[2023-03-22 15:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:16:33] [INFO ] [Real]Absence check using state equation in 4748 ms returned unknown
[2023-03-22 15:16:33] [INFO ] [Real]Absence check using 53 positive place invariants in 14 ms returned sat
[2023-03-22 15:16:33] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-22 15:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:16:38] [INFO ] [Real]Absence check using state equation in 4907 ms returned unknown
[2023-03-22 15:16:38] [INFO ] [Real]Absence check using 53 positive place invariants in 13 ms returned sat
[2023-03-22 15:16:38] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-22 15:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:16:43] [INFO ] [Real]Absence check using state equation in 4900 ms returned unknown
[2023-03-22 15:16:43] [INFO ] [Real]Absence check using 53 positive place invariants in 13 ms returned sat
[2023-03-22 15:16:44] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-22 15:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:16:48] [INFO ] [Real]Absence check using state equation in 4914 ms returned unknown
[2023-03-22 15:16:48] [INFO ] [Real]Absence check using 53 positive place invariants in 13 ms returned sat
[2023-03-22 15:16:49] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 5 ms returned unsat
[2023-03-22 15:16:49] [INFO ] [Real]Absence check using 53 positive place invariants in 14 ms returned sat
[2023-03-22 15:16:49] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-22 15:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:16:54] [INFO ] [Real]Absence check using state equation in 4908 ms returned unknown
[2023-03-22 15:16:54] [INFO ] [Real]Absence check using 53 positive place invariants in 13 ms returned sat
[2023-03-22 15:16:54] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-22 15:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:16:59] [INFO ] [Real]Absence check using state equation in 4911 ms returned unknown
Current structural bounds on expressions (after SMT) : [20, 20, 20, -1, 20, 20, 20, 1, -1, -1] Max seen :[2, 2, 2, 4, 2, 4, 4, 1, 1, 1]
FORMULA PhilosophersDyn-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 482 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 4323 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
[2023-03-22 15:17:03] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
[2023-03-22 15:17:03] [INFO ] Invariant cache hit.
[2023-03-22 15:17:12] [INFO ] Dead Transitions using invariants and state equation in 9565 ms found 1560 transitions.
Found 1560 dead transitions using SMT.
Drop transitions removed 1560 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 540/540 places, 15470/17030 transitions.
Applied a total of 0 rules in 3145 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17047 ms. Remains : 540/540 places, 15470/17030 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2023-03-22 15:17:17] [INFO ] Computed 79 place invariants in 1847 ms
Finished random walk after 506134 steps, including 57882 resets, run visited all 9 properties in 30001 ms. (steps per millisecond=16 )
Incomplete Best-First random walk after 1000001 steps, including 3559 resets, run finished after 2832 ms. (steps per millisecond=353 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 1000001 steps, including 3583 resets, run finished after 2848 ms. (steps per millisecond=351 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 1000001 steps, including 3585 resets, run finished after 2849 ms. (steps per millisecond=351 ) properties (out of 9) seen :22
Finished Best-First random walk after 626207 steps, including 2192 resets, run visited all 9 properties in 5002 ms. (steps per millisecond=125 )
Incomplete Best-First random walk after 1000001 steps, including 3575 resets, run finished after 2826 ms. (steps per millisecond=353 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 1000001 steps, including 2718 resets, run finished after 2389 ms. (steps per millisecond=418 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2716 resets, run finished after 2382 ms. (steps per millisecond=419 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 1000001 steps, including 3488 resets, run finished after 2422 ms. (steps per millisecond=412 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 1000001 steps, including 3491 resets, run finished after 2411 ms. (steps per millisecond=414 ) properties (out of 9) seen :22
[2023-03-22 15:18:13] [INFO ] Invariant cache hit.
[2023-03-22 15:18:14] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:18:14] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 24 ms returned sat
[2023-03-22 15:18:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:18:26] [INFO ] [Real]Absence check using state equation in 12154 ms returned sat
[2023-03-22 15:18:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:18:26] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:18:26] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 23 ms returned sat
[2023-03-22 15:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:18:37] [INFO ] [Nat]Absence check using state equation in 10358 ms returned sat
[2023-03-22 15:18:37] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:18:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:18:44] [INFO ] [Nat]Added 8020 Read/Feed constraints in 7126 ms returned unknown
[2023-03-22 15:18:44] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:18:44] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 26 ms returned sat
[2023-03-22 15:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:18:58] [INFO ] [Real]Absence check using state equation in 14069 ms returned sat
[2023-03-22 15:18:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:18:59] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2023-03-22 15:18:59] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 25 ms returned sat
[2023-03-22 15:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:19:10] [INFO ] [Nat]Absence check using state equation in 11574 ms returned sat
[2023-03-22 15:19:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:19:17] [INFO ] [Nat]Added 8020 Read/Feed constraints in 7176 ms returned unknown
[2023-03-22 15:19:18] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:19:18] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 28 ms returned sat
[2023-03-22 15:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:19:30] [INFO ] [Real]Absence check using state equation in 11913 ms returned sat
[2023-03-22 15:19:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:19:30] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:19:30] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 23 ms returned sat
[2023-03-22 15:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:19:41] [INFO ] [Nat]Absence check using state equation in 11381 ms returned sat
[2023-03-22 15:19:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:19:48] [INFO ] [Nat]Added 8020 Read/Feed constraints in 7105 ms returned unknown
[2023-03-22 15:19:48] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:19:49] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 23 ms returned sat
[2023-03-22 15:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:20:01] [INFO ] [Real]Absence check using state equation in 12020 ms returned sat
[2023-03-22 15:20:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:20:08] [INFO ] [Real]Added 8020 Read/Feed constraints in 7076 ms returned unknown
[2023-03-22 15:20:08] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:20:08] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 25 ms returned sat
[2023-03-22 15:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:20:20] [INFO ] [Real]Absence check using state equation in 12065 ms returned sat
[2023-03-22 15:20:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:20:20] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:20:20] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 23 ms returned sat
[2023-03-22 15:20:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:20:32] [INFO ] [Nat]Absence check using state equation in 11680 ms returned sat
[2023-03-22 15:20:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:20:39] [INFO ] [Nat]Added 8020 Read/Feed constraints in 7114 ms returned unknown
[2023-03-22 15:20:39] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:20:39] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 24 ms returned sat
[2023-03-22 15:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:20:47] [INFO ] [Real]Absence check using state equation in 7818 ms returned sat
[2023-03-22 15:20:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:20:55] [INFO ] [Real]Added 8020 Read/Feed constraints in 7067 ms returned unknown
[2023-03-22 15:20:55] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:20:55] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 32 ms returned sat
[2023-03-22 15:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:21:07] [INFO ] [Real]Absence check using state equation in 12492 ms returned sat
[2023-03-22 15:21:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:21:15] [INFO ] [Real]Added 8020 Read/Feed constraints in 7118 ms returned unknown
[2023-03-22 15:21:15] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2023-03-22 15:21:15] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 24 ms returned sat
[2023-03-22 15:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:21:26] [INFO ] [Real]Absence check using state equation in 11177 ms returned sat
[2023-03-22 15:21:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:21:26] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:21:26] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 23 ms returned sat
[2023-03-22 15:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:21:39] [INFO ] [Nat]Absence check using state equation in 12411 ms returned sat
[2023-03-22 15:21:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:21:46] [INFO ] [Nat]Added 8020 Read/Feed constraints in 7079 ms returned unknown
[2023-03-22 15:21:46] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:21:46] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 28 ms returned sat
[2023-03-22 15:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:21:55] [INFO ] [Real]Absence check using state equation in 9266 ms returned sat
[2023-03-22 15:21:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:21:55] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2023-03-22 15:21:55] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 22 ms returned sat
[2023-03-22 15:21:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:22:06] [INFO ] [Nat]Absence check using state equation in 10853 ms returned sat
[2023-03-22 15:22:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:22:13] [INFO ] [Nat]Added 8020 Read/Feed constraints in 7151 ms returned unknown
Current structural bounds on expressions (after SMT) : [20, 20, 20, -1, 20, 20, 20, -1, -1] Max seen :[2, 2, 2, 4, 2, 4, 4, 1, 1]
Support contains 482 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3189 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3189 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3121 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 15:22:29] [INFO ] Invariant cache hit.
[2023-03-22 15:22:31] [INFO ] Implicit Places using invariants in 1438 ms returned []
Implicit Place search using SMT only with invariants took 1439 ms to find 0 implicit places.
[2023-03-22 15:22:31] [INFO ] Invariant cache hit.
[2023-03-22 15:22:39] [INFO ] Dead Transitions using invariants and state equation in 8250 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12812 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting property specific reduction for PhilosophersDyn-PT-20-UpperBounds-00
[2023-03-22 15:22:39] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1135 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :2
[2023-03-22 15:22:39] [INFO ] Invariant cache hit.
[2023-03-22 15:22:39] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:22:39] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 23 ms returned sat
[2023-03-22 15:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:22:44] [INFO ] [Real]Absence check using state equation in 4921 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 540 transition count 15450
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 520 transition count 15450
Applied a total of 40 rules in 6932 ms. Remains 520 /540 variables (removed 20) and now considering 15450/15470 (removed 20) transitions.
// Phase 1: matrix 15450 rows 520 cols
[2023-03-22 15:22:53] [INFO ] Computed 79 place invariants in 1365 ms
[2023-03-22 15:23:01] [INFO ] Dead Transitions using invariants and state equation in 9482 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16417 ms. Remains : 520/540 places, 15450/15470 transitions.
[2023-03-22 15:23:01] [INFO ] Invariant cache hit.
Finished random walk after 598535 steps, including 68463 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=19 )
Incomplete Best-First random walk after 1000001 steps, including 3623 resets, run finished after 2487 ms. (steps per millisecond=402 ) properties (out of 1) seen :2
[2023-03-22 15:23:33] [INFO ] Invariant cache hit.
[2023-03-22 15:23:33] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-22 15:23:33] [INFO ] [Real]Absence check using 23 positive and 56 generalized place invariants in 27 ms returned sat
[2023-03-22 15:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:23:44] [INFO ] [Real]Absence check using state equation in 10621 ms returned sat
[2023-03-22 15:23:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:23:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-22 15:23:44] [INFO ] [Nat]Absence check using 23 positive and 56 generalized place invariants in 27 ms returned sat
[2023-03-22 15:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:23:56] [INFO ] [Nat]Absence check using state equation in 11308 ms returned sat
[2023-03-22 15:23:56] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:24:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:24:03] [INFO ] [Nat]Added 8020 Read/Feed constraints in 6914 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 20 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 15450/15450 transitions.
Applied a total of 0 rules in 3263 ms. Remains 520 /520 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3263 ms. Remains : 520/520 places, 15450/15450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 15450/15450 transitions.
Applied a total of 0 rules in 3260 ms. Remains 520 /520 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
[2023-03-22 15:24:09] [INFO ] Invariant cache hit.
[2023-03-22 15:24:13] [INFO ] Implicit Places using invariants in 3318 ms returned [29, 34, 60, 86, 88, 111, 126, 143, 163, 237, 251, 281, 320, 333, 346, 362, 378, 407, 450, 451]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 3367 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/520 places, 15450/15450 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 500 transition count 15430
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 480 transition count 15430
Applied a total of 40 rules in 6884 ms. Remains 480 /500 variables (removed 20) and now considering 15430/15450 (removed 20) transitions.
// Phase 1: matrix 15430 rows 480 cols
[2023-03-22 15:24:21] [INFO ] Computed 59 place invariants in 888 ms
[2023-03-22 15:24:24] [INFO ] Implicit Places using invariants in 4191 ms returned []
Implicit Place search using SMT only with invariants took 4195 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 480/520 places, 15430/15450 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17706 ms. Remains : 480/520 places, 15430/15450 transitions.
[2023-03-22 15:24:24] [INFO ] Invariant cache hit.
Finished random walk after 415677 steps, including 71871 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=13 )
Incomplete Best-First random walk after 1000001 steps, including 4237 resets, run finished after 2279 ms. (steps per millisecond=438 ) properties (out of 1) seen :2
[2023-03-22 15:24:56] [INFO ] Invariant cache hit.
[2023-03-22 15:24:56] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:24:56] [INFO ] [Real]Absence check using 27 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-22 15:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:25:05] [INFO ] [Real]Absence check using state equation in 8535 ms returned sat
[2023-03-22 15:25:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:25:05] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:25:05] [INFO ] [Nat]Absence check using 27 positive and 32 generalized place invariants in 17 ms returned sat
[2023-03-22 15:25:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:25:15] [INFO ] [Nat]Absence check using state equation in 9675 ms returned sat
[2023-03-22 15:25:15] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:25:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:25:22] [INFO ] [Nat]Added 8020 Read/Feed constraints in 6896 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 20 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 15430/15430 transitions.
Applied a total of 0 rules in 3274 ms. Remains 480 /480 variables (removed 0) and now considering 15430/15430 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3274 ms. Remains : 480/480 places, 15430/15430 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 15430/15430 transitions.
Applied a total of 0 rules in 3275 ms. Remains 480 /480 variables (removed 0) and now considering 15430/15430 (removed 0) transitions.
[2023-03-22 15:25:29] [INFO ] Invariant cache hit.
[2023-03-22 15:25:32] [INFO ] Implicit Places using invariants in 3227 ms returned []
Implicit Place search using SMT only with invariants took 3227 ms to find 0 implicit places.
[2023-03-22 15:25:32] [INFO ] Invariant cache hit.
[2023-03-22 15:25:40] [INFO ] Dead Transitions using invariants and state equation in 7884 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14389 ms. Remains : 480/480 places, 15430/15430 transitions.
Ending property specific reduction for PhilosophersDyn-PT-20-UpperBounds-00 in 180865 ms.
Starting property specific reduction for PhilosophersDyn-PT-20-UpperBounds-01
// Phase 1: matrix 15470 rows 540 cols
[2023-03-22 15:25:41] [INFO ] Computed 79 place invariants in 1810 ms
Incomplete random walk after 10000 steps, including 1141 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :2
[2023-03-22 15:25:42] [INFO ] Invariant cache hit.
[2023-03-22 15:25:42] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:25:42] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 24 ms returned sat
[2023-03-22 15:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:25:47] [INFO ] [Real]Absence check using state equation in 4918 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3231 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 15:25:50] [INFO ] Invariant cache hit.
[2023-03-22 15:25:59] [INFO ] Dead Transitions using invariants and state equation in 8576 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11809 ms. Remains : 540/540 places, 15470/15470 transitions.
[2023-03-22 15:25:59] [INFO ] Invariant cache hit.
Finished random walk after 598981 steps, including 68595 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=19 )
Incomplete Best-First random walk after 1000001 steps, including 3587 resets, run finished after 2549 ms. (steps per millisecond=392 ) properties (out of 1) seen :2
[2023-03-22 15:26:31] [INFO ] Invariant cache hit.
[2023-03-22 15:26:32] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:26:32] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 25 ms returned sat
[2023-03-22 15:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:26:44] [INFO ] [Real]Absence check using state equation in 11970 ms returned sat
[2023-03-22 15:26:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:26:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:26:44] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 24 ms returned sat
[2023-03-22 15:26:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:26:55] [INFO ] [Nat]Absence check using state equation in 11477 ms returned sat
[2023-03-22 15:26:56] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:27:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:27:03] [INFO ] [Nat]Added 8020 Read/Feed constraints in 7087 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3231 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3231 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3214 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 15:27:09] [INFO ] Invariant cache hit.
[2023-03-22 15:27:12] [INFO ] Implicit Places using invariants in 2961 ms returned []
Implicit Place search using SMT only with invariants took 2965 ms to find 0 implicit places.
[2023-03-22 15:27:12] [INFO ] Invariant cache hit.
[2023-03-22 15:27:21] [INFO ] Dead Transitions using invariants and state equation in 8774 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14955 ms. Remains : 540/540 places, 15470/15470 transitions.
Ending property specific reduction for PhilosophersDyn-PT-20-UpperBounds-01 in 101295 ms.
Starting property specific reduction for PhilosophersDyn-PT-20-UpperBounds-02
[2023-03-22 15:27:21] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1152 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :2
[2023-03-22 15:27:22] [INFO ] Invariant cache hit.
[2023-03-22 15:27:22] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:27:22] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 23 ms returned sat
[2023-03-22 15:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:27:27] [INFO ] [Real]Absence check using state equation in 4924 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3229 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 15:27:30] [INFO ] Invariant cache hit.
[2023-03-22 15:27:38] [INFO ] Dead Transitions using invariants and state equation in 8434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11664 ms. Remains : 540/540 places, 15470/15470 transitions.
[2023-03-22 15:27:38] [INFO ] Invariant cache hit.
Finished random walk after 597481 steps, including 68385 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=19 )
Incomplete Best-First random walk after 1000001 steps, including 3585 resets, run finished after 2702 ms. (steps per millisecond=370 ) properties (out of 1) seen :2
[2023-03-22 15:28:11] [INFO ] Invariant cache hit.
[2023-03-22 15:28:11] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:28:11] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 25 ms returned sat
[2023-03-22 15:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:28:24] [INFO ] [Real]Absence check using state equation in 12961 ms returned sat
[2023-03-22 15:28:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:28:24] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:28:24] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 25 ms returned sat
[2023-03-22 15:28:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:28:37] [INFO ] [Nat]Absence check using state equation in 12276 ms returned sat
[2023-03-22 15:28:37] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:28:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:28:44] [INFO ] [Nat]Added 8020 Read/Feed constraints in 7168 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3235 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3236 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3234 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 15:28:51] [INFO ] Invariant cache hit.
[2023-03-22 15:28:54] [INFO ] Implicit Places using invariants in 3163 ms returned []
Implicit Place search using SMT only with invariants took 3174 ms to find 0 implicit places.
[2023-03-22 15:28:54] [INFO ] Invariant cache hit.
[2023-03-22 15:29:02] [INFO ] Dead Transitions using invariants and state equation in 8764 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15175 ms. Remains : 540/540 places, 15470/15470 transitions.
Ending property specific reduction for PhilosophersDyn-PT-20-UpperBounds-02 in 101500 ms.
Starting property specific reduction for PhilosophersDyn-PT-20-UpperBounds-03
[2023-03-22 15:29:02] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1145 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :4
[2023-03-22 15:29:03] [INFO ] Invariant cache hit.
[2023-03-22 15:29:03] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:29:03] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 25 ms returned sat
[2023-03-22 15:29:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:29:08] [INFO ] [Real]Absence check using state equation in 4919 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 400 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 540 transition count 15450
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 520 transition count 15450
Applied a total of 40 rules in 6320 ms. Remains 520 /540 variables (removed 20) and now considering 15450/15470 (removed 20) transitions.
// Phase 1: matrix 15450 rows 520 cols
[2023-03-22 15:29:16] [INFO ] Computed 79 place invariants in 1438 ms
[2023-03-22 15:29:24] [INFO ] Dead Transitions using invariants and state equation in 9928 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16248 ms. Remains : 520/540 places, 15450/15470 transitions.
[2023-03-22 15:29:24] [INFO ] Invariant cache hit.
Finished random walk after 530660 steps, including 60807 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=17 )
Finished Best-First random walk after 642367 steps, including 2283 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=128 )
[2023-03-22 15:29:59] [INFO ] Invariant cache hit.
[2023-03-22 15:30:00] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-22 15:30:00] [INFO ] [Real]Absence check using 23 positive and 56 generalized place invariants in 29 ms returned sat
[2023-03-22 15:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:30:08] [INFO ] [Real]Absence check using state equation in 7947 ms returned sat
[2023-03-22 15:30:08] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:30:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:30:15] [INFO ] [Real]Added 8020 Read/Feed constraints in 6982 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 400 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 15450/15450 transitions.
Applied a total of 0 rules in 3202 ms. Remains 520 /520 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3203 ms. Remains : 520/520 places, 15450/15450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 15450/15450 transitions.
Applied a total of 0 rules in 3230 ms. Remains 520 /520 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
[2023-03-22 15:30:28] [INFO ] Invariant cache hit.
[2023-03-22 15:30:30] [INFO ] Implicit Places using invariants in 1703 ms returned [29, 34, 60, 86, 88, 111, 126, 143, 163, 237, 251, 281, 320, 333, 346, 362, 378, 407, 450, 451]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1746 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/520 places, 15450/15450 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 500 transition count 15430
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 480 transition count 15430
Applied a total of 40 rules in 6562 ms. Remains 480 /500 variables (removed 20) and now considering 15430/15450 (removed 20) transitions.
// Phase 1: matrix 15430 rows 480 cols
[2023-03-22 15:30:37] [INFO ] Computed 59 place invariants in 886 ms
[2023-03-22 15:30:39] [INFO ] Implicit Places using invariants in 2559 ms returned []
Implicit Place search using SMT only with invariants took 2560 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 480/520 places, 15430/15450 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14099 ms. Remains : 480/520 places, 15430/15450 transitions.
[2023-03-22 15:30:39] [INFO ] Invariant cache hit.
Finished random walk after 366444 steps, including 63318 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=12 )
Finished Best-First random walk after 603776 steps, including 2295 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=120 )
[2023-03-22 15:31:14] [INFO ] Invariant cache hit.
[2023-03-22 15:31:14] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2023-03-22 15:31:14] [INFO ] [Real]Absence check using 27 positive and 32 generalized place invariants in 19 ms returned sat
[2023-03-22 15:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:31:22] [INFO ] [Real]Absence check using state equation in 8404 ms returned sat
[2023-03-22 15:31:23] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:31:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:31:30] [INFO ] [Real]Added 8020 Read/Feed constraints in 6952 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 400 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 15430/15430 transitions.
Applied a total of 0 rules in 3592 ms. Remains 480 /480 variables (removed 0) and now considering 15430/15430 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3592 ms. Remains : 480/480 places, 15430/15430 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 15430/15430 transitions.
Applied a total of 0 rules in 3278 ms. Remains 480 /480 variables (removed 0) and now considering 15430/15430 (removed 0) transitions.
[2023-03-22 15:31:43] [INFO ] Invariant cache hit.
[2023-03-22 15:31:44] [INFO ] Implicit Places using invariants in 1700 ms returned []
Implicit Place search using SMT only with invariants took 1701 ms to find 0 implicit places.
[2023-03-22 15:31:44] [INFO ] Invariant cache hit.
[2023-03-22 15:31:53] [INFO ] Dead Transitions using invariants and state equation in 8249 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13233 ms. Remains : 480/480 places, 15430/15430 transitions.
Ending property specific reduction for PhilosophersDyn-PT-20-UpperBounds-03 in 170244 ms.
Starting property specific reduction for PhilosophersDyn-PT-20-UpperBounds-04
// Phase 1: matrix 15470 rows 540 cols
[2023-03-22 15:31:55] [INFO ] Computed 79 place invariants in 1917 ms
Incomplete random walk after 10000 steps, including 1154 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :2
[2023-03-22 15:31:55] [INFO ] Invariant cache hit.
[2023-03-22 15:31:55] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:31:55] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 29 ms returned sat
[2023-03-22 15:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:32:00] [INFO ] [Real]Absence check using state equation in 4910 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3248 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 15:32:03] [INFO ] Invariant cache hit.
[2023-03-22 15:32:12] [INFO ] Dead Transitions using invariants and state equation in 8565 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11816 ms. Remains : 540/540 places, 15470/15470 transitions.
[2023-03-22 15:32:12] [INFO ] Invariant cache hit.
Finished random walk after 596932 steps, including 68296 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=19 )
Incomplete Best-First random walk after 1000001 steps, including 3582 resets, run finished after 2590 ms. (steps per millisecond=386 ) properties (out of 1) seen :2
[2023-03-22 15:32:45] [INFO ] Invariant cache hit.
[2023-03-22 15:32:45] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:32:45] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 25 ms returned sat
[2023-03-22 15:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:32:57] [INFO ] [Real]Absence check using state equation in 12384 ms returned sat
[2023-03-22 15:32:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:32:58] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:32:58] [INFO ] [Nat]Absence check using 27 positive and 52 generalized place invariants in 24 ms returned sat
[2023-03-22 15:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:33:09] [INFO ] [Nat]Absence check using state equation in 11529 ms returned sat
[2023-03-22 15:33:09] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:33:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:33:16] [INFO ] [Nat]Added 8020 Read/Feed constraints in 7162 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3257 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3257 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3243 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 15:33:23] [INFO ] Invariant cache hit.
[2023-03-22 15:33:26] [INFO ] Implicit Places using invariants in 3206 ms returned []
Implicit Place search using SMT only with invariants took 3206 ms to find 0 implicit places.
[2023-03-22 15:33:26] [INFO ] Invariant cache hit.
[2023-03-22 15:33:35] [INFO ] Dead Transitions using invariants and state equation in 8854 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15308 ms. Remains : 540/540 places, 15470/15470 transitions.
Ending property specific reduction for PhilosophersDyn-PT-20-UpperBounds-04 in 102281 ms.
Starting property specific reduction for PhilosophersDyn-PT-20-UpperBounds-05
[2023-03-22 15:33:35] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1140 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :4
[2023-03-22 15:33:36] [INFO ] Invariant cache hit.
[2023-03-22 15:33:36] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2023-03-22 15:33:36] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 29 ms returned sat
[2023-03-22 15:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:33:41] [INFO ] [Real]Absence check using state equation in 4915 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3246 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 15:33:44] [INFO ] Invariant cache hit.
[2023-03-22 15:33:52] [INFO ] Dead Transitions using invariants and state equation in 8542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11791 ms. Remains : 540/540 places, 15470/15470 transitions.
[2023-03-22 15:33:52] [INFO ] Invariant cache hit.
Finished random walk after 599125 steps, including 68668 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=19 )
Incomplete Best-First random walk after 1000001 steps, including 2716 resets, run finished after 2173 ms. (steps per millisecond=460 ) properties (out of 1) seen :4
[2023-03-22 15:34:25] [INFO ] Invariant cache hit.
[2023-03-22 15:34:25] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:34:25] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 25 ms returned sat
[2023-03-22 15:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:34:33] [INFO ] [Real]Absence check using state equation in 7943 ms returned sat
[2023-03-22 15:34:33] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:34:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:34:40] [INFO ] [Real]Added 8020 Read/Feed constraints in 7134 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3243 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3243 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3270 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 15:34:49] [INFO ] Invariant cache hit.
[2023-03-22 15:34:52] [INFO ] Implicit Places using invariants in 3213 ms returned []
Implicit Place search using SMT only with invariants took 3213 ms to find 0 implicit places.
[2023-03-22 15:34:52] [INFO ] Invariant cache hit.
[2023-03-22 15:35:01] [INFO ] Dead Transitions using invariants and state equation in 9033 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15520 ms. Remains : 540/540 places, 15470/15470 transitions.
Ending property specific reduction for PhilosophersDyn-PT-20-UpperBounds-05 in 86071 ms.
Starting property specific reduction for PhilosophersDyn-PT-20-UpperBounds-06
[2023-03-22 15:35:01] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1147 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :4
[2023-03-22 15:35:02] [INFO ] Invariant cache hit.
[2023-03-22 15:35:02] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 15:35:02] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 24 ms returned sat
[2023-03-22 15:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:35:07] [INFO ] [Real]Absence check using state equation in 4919 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 540 transition count 15450
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 520 transition count 15450
Applied a total of 40 rules in 6538 ms. Remains 520 /540 variables (removed 20) and now considering 15450/15470 (removed 20) transitions.
// Phase 1: matrix 15450 rows 520 cols
[2023-03-22 15:35:15] [INFO ] Computed 79 place invariants in 1372 ms
[2023-03-22 15:35:23] [INFO ] Dead Transitions using invariants and state equation in 9746 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16286 ms. Remains : 520/540 places, 15450/15470 transitions.
[2023-03-22 15:35:23] [INFO ] Invariant cache hit.
Finished random walk after 594528 steps, including 68076 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=19 )
Incomplete Best-First random walk after 1000001 steps, including 2785 resets, run finished after 2239 ms. (steps per millisecond=446 ) properties (out of 1) seen :4
[2023-03-22 15:35:55] [INFO ] Invariant cache hit.
[2023-03-22 15:35:55] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-22 15:35:55] [INFO ] [Real]Absence check using 23 positive and 56 generalized place invariants in 28 ms returned sat
[2023-03-22 15:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:36:07] [INFO ] [Real]Absence check using state equation in 11656 ms returned sat
[2023-03-22 15:36:07] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:36:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:36:14] [INFO ] [Real]Added 8020 Read/Feed constraints in 6980 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 20 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 15450/15450 transitions.
Applied a total of 0 rules in 3244 ms. Remains 520 /520 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3245 ms. Remains : 520/520 places, 15450/15450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 15450/15450 transitions.
Applied a total of 0 rules in 3243 ms. Remains 520 /520 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
[2023-03-22 15:36:24] [INFO ] Invariant cache hit.
[2023-03-22 15:36:27] [INFO ] Implicit Places using invariants in 3266 ms returned [29, 34, 60, 86, 88, 111, 126, 143, 163, 237, 251, 281, 320, 333, 346, 362, 378, 407, 450, 451]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 3309 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/520 places, 15450/15450 transitions.
Applied a total of 0 rules in 3319 ms. Remains 500 /500 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9873 ms. Remains : 500/520 places, 15450/15450 transitions.
// Phase 1: matrix 15450 rows 500 cols
[2023-03-22 15:36:32] [INFO ] Computed 59 place invariants in 1303 ms
Finished random walk after 605481 steps, including 69295 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=20 )
Incomplete Best-First random walk after 1000001 steps, including 2785 resets, run finished after 2350 ms. (steps per millisecond=425 ) properties (out of 1) seen :4
[2023-03-22 15:37:04] [INFO ] Invariant cache hit.
[2023-03-22 15:37:04] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-22 15:37:04] [INFO ] [Real]Absence check using 25 positive and 34 generalized place invariants in 26 ms returned sat
[2023-03-22 15:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:13] [INFO ] [Real]Absence check using state equation in 8344 ms returned sat
[2023-03-22 15:37:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:37:13] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-22 15:37:13] [INFO ] [Nat]Absence check using 25 positive and 34 generalized place invariants in 25 ms returned sat
[2023-03-22 15:37:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:21] [INFO ] [Nat]Absence check using state equation in 7889 ms returned sat
[2023-03-22 15:37:21] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:37:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:37:28] [INFO ] [Nat]Added 8020 Read/Feed constraints in 6959 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 20 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 15450/15450 transitions.
Applied a total of 0 rules in 3262 ms. Remains 500 /500 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3263 ms. Remains : 500/500 places, 15450/15450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 15450/15450 transitions.
Applied a total of 0 rules in 3243 ms. Remains 500 /500 variables (removed 0) and now considering 15450/15450 (removed 0) transitions.
[2023-03-22 15:37:34] [INFO ] Invariant cache hit.
[2023-03-22 15:37:37] [INFO ] Implicit Places using invariants in 3057 ms returned []
Implicit Place search using SMT only with invariants took 3058 ms to find 0 implicit places.
[2023-03-22 15:37:37] [INFO ] Invariant cache hit.
[2023-03-22 15:37:46] [INFO ] Dead Transitions using invariants and state equation in 8880 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15187 ms. Remains : 500/500 places, 15450/15450 transitions.
Ending property specific reduction for PhilosophersDyn-PT-20-UpperBounds-06 in 165317 ms.
Starting property specific reduction for PhilosophersDyn-PT-20-UpperBounds-12
// Phase 1: matrix 15470 rows 540 cols
[2023-03-22 15:37:48] [INFO ] Computed 79 place invariants in 1820 ms
Incomplete random walk after 10000 steps, including 1148 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :1
[2023-03-22 15:37:49] [INFO ] Invariant cache hit.
[2023-03-22 15:37:49] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:37:49] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 26 ms returned sat
[2023-03-22 15:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:37:54] [INFO ] [Real]Absence check using state equation in 4912 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 540 transition count 15451
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 521 transition count 15451
Applied a total of 38 rules in 6623 ms. Remains 521 /540 variables (removed 19) and now considering 15451/15470 (removed 19) transitions.
// Phase 1: matrix 15451 rows 521 cols
[2023-03-22 15:38:02] [INFO ] Computed 79 place invariants in 1412 ms
[2023-03-22 15:38:10] [INFO ] Dead Transitions using invariants and state equation in 9772 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16397 ms. Remains : 521/540 places, 15451/15470 transitions.
[2023-03-22 15:38:10] [INFO ] Invariant cache hit.
Finished random walk after 596008 steps, including 68268 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=19 )
Incomplete Best-First random walk after 1000001 steps, including 3504 resets, run finished after 2114 ms. (steps per millisecond=473 ) properties (out of 1) seen :1
[2023-03-22 15:38:42] [INFO ] Invariant cache hit.
[2023-03-22 15:38:42] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-22 15:38:42] [INFO ] [Real]Absence check using 16 positive and 63 generalized place invariants in 34 ms returned sat
[2023-03-22 15:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:38:55] [INFO ] [Real]Absence check using state equation in 12229 ms returned sat
[2023-03-22 15:38:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:38:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-22 15:38:55] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 34 ms returned sat
[2023-03-22 15:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:39:06] [INFO ] [Nat]Absence check using state equation in 11419 ms returned sat
[2023-03-22 15:39:07] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:39:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:39:14] [INFO ] [Nat]Added 8020 Read/Feed constraints in 7002 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 15451/15451 transitions.
Applied a total of 0 rules in 3408 ms. Remains 521 /521 variables (removed 0) and now considering 15451/15451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3409 ms. Remains : 521/521 places, 15451/15451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 15451/15451 transitions.
Applied a total of 0 rules in 3434 ms. Remains 521 /521 variables (removed 0) and now considering 15451/15451 (removed 0) transitions.
[2023-03-22 15:39:20] [INFO ] Invariant cache hit.
[2023-03-22 15:39:24] [INFO ] Implicit Places using invariants in 3299 ms returned [29, 60, 86, 88, 111, 126, 143, 163, 237, 251, 281, 320, 333, 346, 362, 379, 408, 451, 452]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 3337 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 502/521 places, 15451/15451 transitions.
Free-agglomeration rule applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 502 transition count 15432
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 483 transition count 15432
Applied a total of 38 rules in 6614 ms. Remains 483 /502 variables (removed 19) and now considering 15432/15451 (removed 19) transitions.
// Phase 1: matrix 15432 rows 483 cols
[2023-03-22 15:39:32] [INFO ] Computed 60 place invariants in 1444 ms
[2023-03-22 15:39:35] [INFO ] Implicit Places using invariants in 4555 ms returned []
Implicit Place search using SMT only with invariants took 4556 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 483/521 places, 15432/15451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17941 ms. Remains : 483/521 places, 15432/15451 transitions.
[2023-03-22 15:39:35] [INFO ] Invariant cache hit.
Finished random walk after 412565 steps, including 69415 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=13 )
Incomplete Best-First random walk after 1000001 steps, including 3715 resets, run finished after 2298 ms. (steps per millisecond=435 ) properties (out of 1) seen :1
[2023-03-22 15:40:07] [INFO ] Invariant cache hit.
[2023-03-22 15:40:07] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-22 15:40:07] [INFO ] [Real]Absence check using 22 positive and 38 generalized place invariants in 25 ms returned sat
[2023-03-22 15:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:40:25] [INFO ] [Real]Absence check using state equation in 17576 ms returned sat
[2023-03-22 15:40:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:40:25] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2023-03-22 15:40:25] [INFO ] [Nat]Absence check using 22 positive and 38 generalized place invariants in 21 ms returned sat
[2023-03-22 15:40:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:40:43] [INFO ] [Nat]Absence check using state equation in 18010 ms returned sat
[2023-03-22 15:40:44] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:40:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:40:50] [INFO ] [Nat]Added 8020 Read/Feed constraints in 6943 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 15432/15432 transitions.
Applied a total of 0 rules in 3225 ms. Remains 483 /483 variables (removed 0) and now considering 15432/15432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3226 ms. Remains : 483/483 places, 15432/15432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 15432/15432 transitions.
Applied a total of 0 rules in 3276 ms. Remains 483 /483 variables (removed 0) and now considering 15432/15432 (removed 0) transitions.
[2023-03-22 15:40:57] [INFO ] Invariant cache hit.
[2023-03-22 15:41:00] [INFO ] Implicit Places using invariants in 3256 ms returned []
Implicit Place search using SMT only with invariants took 3256 ms to find 0 implicit places.
[2023-03-22 15:41:00] [INFO ] Invariant cache hit.
[2023-03-22 15:41:08] [INFO ] Dead Transitions using invariants and state equation in 7965 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14500 ms. Remains : 483/483 places, 15432/15432 transitions.
Ending property specific reduction for PhilosophersDyn-PT-20-UpperBounds-12 in 201870 ms.
Starting property specific reduction for PhilosophersDyn-PT-20-UpperBounds-14
// Phase 1: matrix 15470 rows 540 cols
[2023-03-22 15:41:10] [INFO ] Computed 79 place invariants in 1825 ms
Incomplete random walk after 10000 steps, including 1142 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :1
[2023-03-22 15:41:11] [INFO ] Invariant cache hit.
[2023-03-22 15:41:11] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 15:41:11] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 29 ms returned sat
[2023-03-22 15:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:41:16] [INFO ] [Real]Absence check using state equation in 4915 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 540 transition count 15451
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 521 transition count 15451
Applied a total of 38 rules in 6513 ms. Remains 521 /540 variables (removed 19) and now considering 15451/15470 (removed 19) transitions.
// Phase 1: matrix 15451 rows 521 cols
[2023-03-22 15:41:23] [INFO ] Computed 79 place invariants in 1217 ms
[2023-03-22 15:41:32] [INFO ] Dead Transitions using invariants and state equation in 9722 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16239 ms. Remains : 521/540 places, 15451/15470 transitions.
[2023-03-22 15:41:32] [INFO ] Invariant cache hit.
Finished random walk after 606382 steps, including 69490 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=20 )
Incomplete Best-First random walk after 1000001 steps, including 3505 resets, run finished after 2072 ms. (steps per millisecond=482 ) properties (out of 1) seen :1
[2023-03-22 15:42:04] [INFO ] Invariant cache hit.
[2023-03-22 15:42:04] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-22 15:42:04] [INFO ] [Real]Absence check using 23 positive and 56 generalized place invariants in 32 ms returned sat
[2023-03-22 15:42:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:42:12] [INFO ] [Real]Absence check using state equation in 7953 ms returned sat
[2023-03-22 15:42:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:42:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2023-03-22 15:42:12] [INFO ] [Nat]Absence check using 23 positive and 56 generalized place invariants in 31 ms returned sat
[2023-03-22 15:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:42:20] [INFO ] [Nat]Absence check using state equation in 7775 ms returned sat
[2023-03-22 15:42:20] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:42:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:42:27] [INFO ] [Nat]Added 8020 Read/Feed constraints in 6967 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 15451/15451 transitions.
Applied a total of 0 rules in 3256 ms. Remains 521 /521 variables (removed 0) and now considering 15451/15451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3256 ms. Remains : 521/521 places, 15451/15451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 15451/15451 transitions.
Applied a total of 0 rules in 3236 ms. Remains 521 /521 variables (removed 0) and now considering 15451/15451 (removed 0) transitions.
[2023-03-22 15:42:34] [INFO ] Invariant cache hit.
[2023-03-22 15:42:37] [INFO ] Implicit Places using invariants in 3221 ms returned [29, 34, 60, 86, 88, 111, 126, 143, 163, 238, 252, 282, 321, 347, 363, 379, 408, 451, 452]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 3259 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 502/521 places, 15451/15451 transitions.
Free-agglomeration rule applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 502 transition count 15432
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 483 transition count 15432
Applied a total of 38 rules in 6544 ms. Remains 483 /502 variables (removed 19) and now considering 15432/15451 (removed 19) transitions.
// Phase 1: matrix 15432 rows 483 cols
[2023-03-22 15:42:45] [INFO ] Computed 60 place invariants in 1509 ms
[2023-03-22 15:42:48] [INFO ] Implicit Places using invariants in 4707 ms returned []
Implicit Place search using SMT only with invariants took 4707 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 483/521 places, 15432/15451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17746 ms. Remains : 483/521 places, 15432/15451 transitions.
[2023-03-22 15:42:48] [INFO ] Invariant cache hit.
Finished random walk after 425075 steps, including 71586 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=14 )
Incomplete Best-First random walk after 1000001 steps, including 3714 resets, run finished after 2119 ms. (steps per millisecond=471 ) properties (out of 1) seen :1
[2023-03-22 15:43:20] [INFO ] Invariant cache hit.
[2023-03-22 15:43:21] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-22 15:43:21] [INFO ] [Real]Absence check using 21 positive and 39 generalized place invariants in 25 ms returned sat
[2023-03-22 15:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 15:43:27] [INFO ] [Real]Absence check using state equation in 5995 ms returned sat
[2023-03-22 15:43:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 15:43:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-22 15:43:27] [INFO ] [Nat]Absence check using 21 positive and 39 generalized place invariants in 24 ms returned sat
[2023-03-22 15:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 15:43:33] [INFO ] [Nat]Absence check using state equation in 5806 ms returned sat
[2023-03-22 15:43:33] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 15:43:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 15:43:40] [INFO ] [Nat]Added 8020 Read/Feed constraints in 6945 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 15432/15432 transitions.
Applied a total of 0 rules in 3348 ms. Remains 483 /483 variables (removed 0) and now considering 15432/15432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3348 ms. Remains : 483/483 places, 15432/15432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 15432/15432 transitions.
Applied a total of 0 rules in 3303 ms. Remains 483 /483 variables (removed 0) and now considering 15432/15432 (removed 0) transitions.
[2023-03-22 15:43:47] [INFO ] Invariant cache hit.
[2023-03-22 15:43:50] [INFO ] Implicit Places using invariants in 3233 ms returned []
Implicit Place search using SMT only with invariants took 3234 ms to find 0 implicit places.
[2023-03-22 15:43:50] [INFO ] Invariant cache hit.
[2023-03-22 15:43:58] [INFO ] Dead Transitions using invariants and state equation in 8491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15031 ms. Remains : 483/483 places, 15432/15432 transitions.
Ending property specific reduction for PhilosophersDyn-PT-20-UpperBounds-14 in 170025 ms.
[2023-03-22 15:44:00] [INFO ] Flatten gal took : 1058 ms
[2023-03-22 15:44:00] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-22 15:44:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 540 places, 15470 transitions and 120800 arcs took 82 ms.
Total runtime 1671503 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/869/ub_0_ --maxsum=/tmp/869/ub_1_ --maxsum=/tmp/869/ub_2_ --maxsum=/tmp/869/ub_3_ --maxsum=/tmp/869/ub_4_ --maxsum=/tmp/869/ub_5_ --maxsum=/tmp/869/ub_6_ --maxsum=/tmp/869/ub_7_ --maxsum=/tmp/869/ub_8_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14857048 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16019600 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PhilosophersDyn-PT-20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950300333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-20.tgz
mv PhilosophersDyn-PT-20 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;