About the Execution of Smart+red for DES-PT-20a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5160.119 | 1800000.00 | 2043511.00 | 4055.20 | [undef] | Time out reached |
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.r121-tall-167814499400267.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 smartxred
Input is DES-PT-20a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-167814499400267
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1678393358097
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=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-20a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 20:22:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 20:22:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:22:40] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-09 20:22:40] [INFO ] Transformed 195 places.
[2023-03-09 20:22:40] [INFO ] Transformed 152 transitions.
[2023-03-09 20:22:40] [INFO ] Found NUPN structural information;
[2023-03-09 20:22:40] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 112 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 195/195 places, 152/152 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 195 transition count 138
Applied a total of 14 rules in 12 ms. Remains 195 /195 variables (removed 0) and now considering 138/152 (removed 14) transitions.
// Phase 1: matrix 138 rows 195 cols
[2023-03-09 20:22:40] [INFO ] Computed 59 place invariants in 24 ms
[2023-03-09 20:22:40] [INFO ] Implicit Places using invariants in 354 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 380 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 194/195 places, 138/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 399 ms. Remains : 194/195 places, 138/152 transitions.
Discarding 9 transitions out of 138. Remains 129
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 128) seen :64
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 63) seen :0
Running SMT prover for 63 properties.
// Phase 1: matrix 138 rows 194 cols
[2023-03-09 20:22:41] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-09 20:22:41] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-09 20:22:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 20:22:42] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:63
[2023-03-09 20:22:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 20:22:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-09 20:22:45] [INFO ] After 2520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :63
[2023-03-09 20:22:46] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 4 ms to minimize.
[2023-03-09 20:22:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-09 20:22:47] [INFO ] After 4932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :63
Attempting to minimize the solution found.
Minimization took 2219 ms.
[2023-03-09 20:22:49] [INFO ] After 7927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :63
Parikh walk visited 55 properties in 30909 ms.
Support contains 12 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 138/138 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 193 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 193 transition count 135
Applied a total of 9 rules in 56 ms. Remains 193 /194 variables (removed 1) and now considering 135/138 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 193/194 places, 135/138 transitions.
Incomplete random walk after 1000000 steps, including 13397 resets, run finished after 13576 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2309 resets, run finished after 3706 ms. (steps per millisecond=269 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2262 resets, run finished after 3799 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2275 resets, run finished after 3688 ms. (steps per millisecond=271 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2284 resets, run finished after 3483 ms. (steps per millisecond=287 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1751 resets, run finished after 3268 ms. (steps per millisecond=305 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7284 resets, run finished after 3813 ms. (steps per millisecond=262 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7294 resets, run finished after 3799 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 987496 steps, including 7194 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen 0
Interrupted probabilistic random walk after 34584592 steps, run timeout after 132001 ms. (steps per millisecond=262 ) properties seen :{}
Probabilistic random walk after 34584592 steps, saw 4094993 distinct states, run finished after 132004 ms. (steps per millisecond=261 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-09 20:26:17] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-09 20:26:17] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-09 20:26:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 20:26:17] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 20:26:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:26:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 61 ms returned sat
[2023-03-09 20:26:17] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 20:26:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:26:17] [INFO ] After 119ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-09 20:26:17] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-09 20:26:18] [INFO ] After 778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 6 properties in 5614 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-09 20:26:23] [INFO ] Invariant cache hit.
[2023-03-09 20:26:23] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-09 20:26:23] [INFO ] Invariant cache hit.
[2023-03-09 20:26:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:26:23] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-09 20:26:23] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 20:26:23] [INFO ] Invariant cache hit.
[2023-03-09 20:26:24] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 447 ms. Remains : 193/193 places, 135/135 transitions.
Incomplete random walk after 100000 steps, including 1331 resets, run finished after 836 ms. (steps per millisecond=119 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-09 20:26:24] [INFO ] Invariant cache hit.
[2023-03-09 20:26:24] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:26:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-09 20:26:25] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 20:26:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:26:25] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-09 20:26:25] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2023-03-09 20:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 20:26:25] [INFO ] After 74ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:26:25] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:26:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:26:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 63 ms returned sat
[2023-03-09 20:26:25] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 20:26:25] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 20:26:25] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-03-09 20:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-09 20:26:25] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 20:26:25] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 1000000 steps, including 13473 resets, run finished after 7645 ms. (steps per millisecond=130 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7280 resets, run finished after 2498 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7284 resets, run finished after 2422 ms. (steps per millisecond=412 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 15439033 steps, run timeout after 36001 ms. (steps per millisecond=428 ) properties seen :{}
Probabilistic random walk after 15439033 steps, saw 1891752 distinct states, run finished after 36003 ms. (steps per millisecond=428 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 20:27:13] [INFO ] Invariant cache hit.
[2023-03-09 20:27:14] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 20:27:14] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:27:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 40 ms returned sat
[2023-03-09 20:27:14] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 20:27:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:27:14] [INFO ] After 41ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 20:27:14] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-09 20:27:14] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1517 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-09 20:27:15] [INFO ] Invariant cache hit.
[2023-03-09 20:27:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-09 20:27:16] [INFO ] Invariant cache hit.
[2023-03-09 20:27:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:27:16] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-09 20:27:16] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 20:27:16] [INFO ] Invariant cache hit.
[2023-03-09 20:27:16] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 193/193 places, 135/135 transitions.
Incomplete random walk after 100000 steps, including 1359 resets, run finished after 850 ms. (steps per millisecond=117 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-09 20:27:17] [INFO ] Invariant cache hit.
[2023-03-09 20:27:17] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:27:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 20:27:17] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 20:27:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:27:17] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-09 20:27:17] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2023-03-09 20:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-09 20:27:17] [INFO ] After 67ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:27:17] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:27:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 64 ms returned sat
[2023-03-09 20:27:17] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 20:27:17] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 20:27:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-09 20:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-09 20:27:17] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 20:27:17] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 10000 steps, including 133 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1800318 steps, run timeout after 3001 ms. (steps per millisecond=599 ) properties seen :{}
Probabilistic random walk after 1800318 steps, saw 251270 distinct states, run finished after 3001 ms. (steps per millisecond=599 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:27:20] [INFO ] Invariant cache hit.
[2023-03-09 20:27:20] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 20:27:20] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:27:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 51 ms returned sat
[2023-03-09 20:27:21] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:27:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:27:21] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:27:21] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2023-03-09 20:27:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-09 20:27:21] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:27:21] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 10 ms. Remains 192 /193 variables (removed 1) and now considering 134/135 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 192/193 places, 134/135 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1764592 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :{}
Probabilistic random walk after 1764592 steps, saw 246398 distinct states, run finished after 3001 ms. (steps per millisecond=588 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-09 20:27:24] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 20:27:24] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 20:27:24] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:27:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 77 ms returned sat
[2023-03-09 20:27:24] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:27:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:27:24] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:27:24] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:27:24] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-09 20:27:24] [INFO ] Invariant cache hit.
[2023-03-09 20:27:24] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-09 20:27:24] [INFO ] Invariant cache hit.
[2023-03-09 20:27:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:27:24] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-09 20:27:24] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 20:27:24] [INFO ] Invariant cache hit.
[2023-03-09 20:27:24] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 427 ms. Remains : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-09 20:27:24] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 20:27:24] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:27:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 20:27:24] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:27:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 79 ms returned sat
[2023-03-09 20:27:25] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:27:25] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 20:27:25] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 130 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1702576 steps, run timeout after 3001 ms. (steps per millisecond=567 ) properties seen :{}
Probabilistic random walk after 1702576 steps, saw 238545 distinct states, run finished after 3001 ms. (steps per millisecond=567 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-09 20:27:28] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 20:27:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-09 20:27:28] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:27:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:27:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 64 ms returned sat
[2023-03-09 20:27:28] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:27:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 20:27:28] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:27:28] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:27:28] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 12 ms. Remains 192 /193 variables (removed 1) and now considering 134/135 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 192/193 places, 134/135 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1853530 steps, run timeout after 3001 ms. (steps per millisecond=617 ) properties seen :{}
Probabilistic random walk after 1853530 steps, saw 258551 distinct states, run finished after 3001 ms. (steps per millisecond=617 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-09 20:27:31] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 20:27:31] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:27:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 20:27:31] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:27:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-09 20:27:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 75 ms returned sat
[2023-03-09 20:27:31] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:27:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:27:31] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:27:31] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 20:27:31] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-09 20:27:31] [INFO ] Invariant cache hit.
[2023-03-09 20:27:32] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-09 20:27:32] [INFO ] Invariant cache hit.
[2023-03-09 20:27:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:27:32] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-09 20:27:32] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 20:27:32] [INFO ] Invariant cache hit.
[2023-03-09 20:27:32] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-09 20:27:32] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 20:27:32] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:27:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 20:27:32] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:27:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:27:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 75 ms returned sat
[2023-03-09 20:27:32] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:27:32] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 20:27:32] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 12 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-09 20:27:32] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-09 20:27:32] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:27:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 20:27:32] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:27:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:27:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 58 ms returned sat
[2023-03-09 20:27:32] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 20:27:32] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-09 20:27:32] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Unable to solve all queries for examination QuasiLiveness. Remains :2 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 2 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 293110 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 20a
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
PNML FILE: model.pnml
Petri model created: 195 places, 152 transitions, 742 arcs.
(potential((tk(P102)>=1) & (tk(P100)>=1)))
(potential((tk(P168)>=1) & (tk(P164)>=1) & (tk(P160)>=1) & (tk(P156)>=1) & (tk(P154)>=1) & (tk(P158)>=1) & (tk(P162)>=1) & (tk(P166)>=1)))
(potential((tk(P172)>=1) & (tk(P170)>=1)))
(potential((tk(P181)>=1) & (tk(P179)>=1)))
(potential((tk(P185)>=1) & (tk(P183)>=1)))
(potential((tk(P195)>=1) & (tk(P193)>=1)))
(potential((tk(P1)>=1)))
(potential((tk(P106)>=1) & (tk(P104)>=1)))
(potential((tk(P87)>=1)))
(potential((tk(P85)>=1)))
(potential((tk(P83)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P3)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P4)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P5)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P6)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P7)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P8)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P9)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P10)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P11)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P12)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P13)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P14)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P15)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P16)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P17)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P18)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P19)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P20)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P21)>=1)))
(potential((tk(P114)>=1) & (tk(P116)>=1) & (tk(P2)>=1)))
(potential((tk(P23)>=1) & (tk(P191)>=1)))
(potential((tk(P24)>=1) & (tk(P191)>=1)))
(potential((tk(P25)>=1) & (tk(P191)>=1)))
(potential((tk(P26)>=1) & (tk(P191)>=1)))
(potential((tk(P27)>=1) & (tk(P191)>=1)))
(potential((tk(P28)>=1) & (tk(P191)>=1)))
(potential((tk(P29)>=1) & (tk(P191)>=1)))
(potential((tk(P30)>=1) & (tk(P191)>=1)))
(potential((tk(P31)>=1) & (tk(P191)>=1)))
(potential((tk(P32)>=1) & (tk(P191)>=1)))
(potential((tk(P33)>=1) & (tk(P191)>=1)))
(potential((tk(P34)>=1) & (tk(P191)>=1)))
(potential((tk(P35)>=1) & (tk(P191)>=1)))
(potential((tk(P36)>=1) & (tk(P191)>=1)))
(potential((tk(P37)>=1) & (tk(P191)>=1)))
(potential((tk(P38)>=1) & (tk(P191)>=1)))
(potential((tk(P39)>=1) & (tk(P191)>=1)))
(potential((tk(P40)>=1) & (tk(P191)>=1)))
(potential((tk(P41)>=1) & (tk(P191)>=1)))
(potential((tk(P22)>=1) & (tk(P191)>=1)))
(potential((tk(P63)>=1) & (tk(P86)>=1)))
(potential((tk(P64)>=1) & (tk(P86)>=1)))
(potential((tk(P65)>=1) & (tk(P86)>=1)))
(potential((tk(P66)>=1) & (tk(P86)>=1)))
(potential((tk(P67)>=1) & (tk(P86)>=1)))
(potential((tk(P68)>=1) & (tk(P86)>=1)))
(potential((tk(P69)>=1) & (tk(P86)>=1)))
(potential((tk(P70)>=1) & (tk(P86)>=1)))
(potential((tk(P71)>=1) & (tk(P86)>=1)))
(potential((tk(P72)>=1) & (tk(P86)>=1)))
(potential((tk(P73)>=1) & (tk(P86)>=1)))
(potential((tk(P74)>=1) & (tk(P86)>=1)))
(potential((tk(P75)>=1) & (tk(P86)>=1)))
(potential((tk(P76)>=1) & (tk(P86)>=1)))
(potential((tk(P77)>=1) & (tk(P86)>=1)))
(potential((tk(P78)>=1) & (tk(P86)>=1)))
(potential((tk(P79)>=1) & (tk(P86)>=1)))
(potential((tk(P80)>=1) & (tk(P86)>=1)))
(potential((tk(P81)>=1) & (tk(P86)>=1)))
(potential((tk(P62)>=1) & (tk(P86)>=1)))
(potential((tk(P42)>=1) & (tk(P111)>=1)))
(potential((tk(P61)>=1) & (tk(P111)>=1)))
(potential((tk(P60)>=1) & (tk(P111)>=1)))
(potential((tk(P59)>=1) & (tk(P111)>=1)))
(potential((tk(P58)>=1) & (tk(P111)>=1)))
(potential((tk(P57)>=1) & (tk(P111)>=1)))
(potential((tk(P56)>=1) & (tk(P111)>=1)))
(potential((tk(P55)>=1) & (tk(P111)>=1)))
(potential((tk(P54)>=1) & (tk(P111)>=1)))
(potential((tk(P53)>=1) & (tk(P111)>=1)))
(potential((tk(P52)>=1) & (tk(P111)>=1)))
(potential((tk(P51)>=1) & (tk(P111)>=1)))
(potential((tk(P50)>=1) & (tk(P111)>=1)))
(potential((tk(P49)>=1) & (tk(P111)>=1)))
(potential((tk(P48)>=1) & (tk(P111)>=1)))
(potential((tk(P47)>=1) & (tk(P111)>=1)))
(potential((tk(P46)>=1) & (tk(P111)>=1)))
(potential((tk(P45)>=1) & (tk(P111)>=1)))
(potential((tk(P44)>=1) & (tk(P111)>=1)))
(potential((tk(P43)>=1) & (tk(P111)>=1)))
(potential((tk(P87)>=1) & (tk(P109)>=1)))
(potential((tk(P87)>=1) & (tk(P109)>=1)))
(potential((tk(P87)>=1) & (tk(P109)>=1)))
(potential((tk(P87)>=1) & (tk(P109)>=1)))
(potential((tk(P87)>=1) & (tk(P109)>=1)))
(potential((tk(P83)>=1) & (tk(P96)>=1)))
(potential((tk(P83)>=1) & (tk(P96)>=1)))
(potential((tk(P85)>=1) & (tk(P105)>=1)))
(potential((tk(P85)>=1) & (tk(P105)>=1)))
(potential((tk(P90)>=1) & (tk(P175)>=1)))
(potential((tk(P90)>=1) & (tk(P175)>=1)))
(potential((tk(P90)>=1) & (tk(P175)>=1)))
(potential((tk(P95)>=1) & (tk(P169)>=1)))
(potential((tk(P92)>=1) & (tk(P186)>=1)))
(potential((tk(P92)>=1) & (tk(P186)>=1)))
(potential((tk(P92)>=1) & (tk(P186)>=1)))
(potential((tk(P115)>=1) & (tk(P187)>=1)))
(potential((tk(P113)>=1) & (tk(P176)>=1)))
(potential((tk(P190)>=1) & (tk(P194)>=1)))
(potential((tk(P177)>=1) & (tk(P192)>=1)))
(potential((tk(P177)>=1) & (tk(P118)>=1) & (tk(P120)>=1)))
(potential((tk(P173)>=1) & (tk(P178)>=1)))
(potential((tk(P177)>=1) & (tk(P118)>=1) & (tk(P120)>=1)))
(potential((tk(P173)>=1) & (tk(P182)>=1)))
(potential((tk(P134)>=1) & (tk(P130)>=1) & (tk(P126)>=1) & (tk(P122)>=1) & (tk(P124)>=1) & (tk(P128)>=1) & (tk(P132)>=1) & (tk(P136)>=1) & (tk(P117)>=1)))
(potential((tk(P119)>=1) & (tk(P189)>=1)))
(potential((tk(P190)>=1) & (tk(P180)>=1)))
(potential((tk(P190)>=1) & (tk(P184)>=1)))
(potential((tk(P119)>=1) & (tk(P188)>=1)))
(potential((tk(P190)>=1) & (tk(P180)>=1)))
(potential((tk(P190)>=1) & (tk(P184)>=1)))
(potential((tk(P151)>=1) & (tk(P167)>=1)))
(potential((tk(P147)>=1) & (tk(P163)>=1)))
(potential((tk(P143)>=1) & (tk(P159)>=1)))
(potential((tk(P139)>=1) & (tk(P155)>=1)))
(potential((tk(P137)>=1) & (tk(P153)>=1)))
(potential((tk(P141)>=1) & (tk(P157)>=1)))
(potential((tk(P145)>=1) & (tk(P161)>=1)))
(potential((tk(P149)>=1) & (tk(P165)>=1)))
(potential((tk(P133)>=1) & (tk(P150)>=1)))
(potential((tk(P129)>=1) & (tk(P146)>=1)))
(potential((tk(P125)>=1) & (tk(P142)>=1)))
(potential((tk(P121)>=1) & (tk(P138)>=1)))
(potential((tk(P123)>=1) & (tk(P140)>=1)))
(potential((tk(P127)>=1) & (tk(P144)>=1)))
(potential((tk(P131)>=1) & (tk(P148)>=1)))
(potential((tk(P135)>=1) & (tk(P152)>=1)))
(potential((tk(P171)>=1) & (tk(P174)>=1)))
(potential((tk(P106)>=1) & (tk(P104)>=1) & (tk(P94)>=1)))
(potential((tk(P94)>=1) & (tk(P101)>=1)))
(potential((tk(P98)>=1) & (tk(P112)>=1)))
(potential((tk(P98)>=1) & (tk(P99)>=1)))
(potential((tk(P110)>=1) & (tk(P108)>=1) & (tk(P103)>=1)))
(potential((tk(P110)>=1) & (tk(P108)>=1) & (tk(P103)>=1)))
(potential((tk(P110)>=1) & (tk(P108)>=1) & (tk(P103)>=1)))
(potential((tk(P110)>=1) & (tk(P108)>=1) & (tk(P103)>=1)))
(potential((tk(P110)>=1) & (tk(P108)>=1) & (tk(P103)>=1)))
(potential((tk(P97)>=1) & (tk(P107)>=1)))
(potential((tk(P106)>=1) & (tk(P104)>=1)))
(potential((tk(P98)>=1)))
(potential((tk(P91)>=1) & (tk(P88)>=1) & (tk(P82)>=1) & (tk(P84)>=1) & (tk(P89)>=1) & (tk(P93)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 11011100 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16124712 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 QuasiLiveness -timeout 180 -rebuildPNML
Caught signal 15, terminating.
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="DES-PT-20a"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is DES-PT-20a, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-167814499400267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;