About the Execution of Marcie+red for QuasiCertifProtocol-PT-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10283.823 | 590741.00 | 616630.00 | 1613.90 | F???FTT?T???T?FT | 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.r298-tall-167873952300889.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 marciexred
Input is QuasiCertifProtocol-PT-22, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952300889
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 33K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 225K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 49K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 667K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 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 503K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679689599022
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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 20:26:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 20:26:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 20:26:40] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-24 20:26:40] [INFO ] Transformed 1966 places.
[2023-03-24 20:26:40] [INFO ] Transformed 356 transitions.
[2023-03-24 20:26:40] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Support contains 1899 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Applied a total of 0 rules in 20 ms. Remains 1966 /1966 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1966 cols
[2023-03-24 20:26:40] [INFO ] Computed 1611 place invariants in 106 ms
[2023-03-24 20:26:41] [INFO ] Implicit Places using invariants in 906 ms returned []
[2023-03-24 20:26:41] [INFO ] Invariant cache hit.
[2023-03-24 20:26:42] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned [1181, 1182, 1189, 1190, 1191, 1192, 1193, 1194, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1207, 1209, 1210, 1212]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 2037 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1945/1966 places, 356/356 transitions.
Applied a total of 0 rules in 9 ms. Remains 1945 /1945 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2066 ms. Remains : 1945/1966 places, 356/356 transitions.
Support contains 1899 out of 1945 places after structural reductions.
[2023-03-24 20:26:43] [INFO ] Flatten gal took : 142 ms
[2023-03-24 20:26:43] [INFO ] Flatten gal took : 74 ms
[2023-03-24 20:26:43] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 1898 out of 1945 places (down from 1899) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 79) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 74) 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 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 74) 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 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 74) 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 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) 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 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 74) seen :0
Interrupted probabilistic random walk after 432257 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 432257 steps, saw 61888 distinct states, run finished after 3002 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 74 properties.
// Phase 1: matrix 356 rows 1945 cols
[2023-03-24 20:26:47] [INFO ] Computed 1590 place invariants in 42 ms
[2023-03-24 20:26:49] [INFO ] After 2554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:74
[2023-03-24 20:26:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-24 20:26:52] [INFO ] [Nat]Absence check using 3 positive and 1587 generalized place invariants in 257 ms returned sat
[2023-03-24 20:27:14] [INFO ] After 20237ms SMT Verify possible using state equation in natural domain returned unsat :20 sat :52
[2023-03-24 20:27:14] [INFO ] After 20243ms SMT Verify possible using trap constraints in natural domain returned unsat :20 sat :52
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 20:27:14] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :52
Fused 74 Parikh solutions to 13 different solutions.
Parikh walk visited 26 properties in 110 ms.
Support contains 34 out of 1945 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1945/1945 places, 356/356 transitions.
Graph (complete) has 15540 edges and 1945 vertex of which 1514 are kept as prefixes of interest. Removing 431 places using SCC suffix rule.10 ms
Discarding 431 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Drop transitions removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 232 rules applied. Total rules applied 233 place count 1468 transition count 155
Reduce places removed 26 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 31 rules applied. Total rules applied 264 place count 1442 transition count 150
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 269 place count 1437 transition count 150
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 269 place count 1437 transition count 94
Deduced a syphon composed of 56 places in 10 ms
Ensure Unique test removed 63 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 175 rules applied. Total rules applied 444 place count 1318 transition count 94
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 299 places
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 327 rules applied. Total rules applied 771 place count 1005 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 772 place count 1005 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 773 place count 1004 transition count 79
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 774 place count 1004 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 775 place count 1003 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 776 place count 1003 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 777 place count 1002 transition count 77
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 778 place count 1001 transition count 77
Applied a total of 778 rules in 571 ms. Remains 1001 /1945 variables (removed 944) and now considering 77/356 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 571 ms. Remains : 1001/1945 places, 77/356 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 122 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 125 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 125 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 121 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 122 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 114 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 348655 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{16=1}
Probabilistic random walk after 348655 steps, saw 45664 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :1
Running SMT prover for 27 properties.
// Phase 1: matrix 77 rows 1001 cols
[2023-03-24 20:27:19] [INFO ] Computed 925 place invariants in 3 ms
[2023-03-24 20:27:19] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-24 20:27:19] [INFO ] [Real]Absence check using 6 positive and 919 generalized place invariants in 150 ms returned sat
[2023-03-24 20:27:20] [INFO ] After 1156ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:24
[2023-03-24 20:27:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-24 20:27:20] [INFO ] [Nat]Absence check using 6 positive and 919 generalized place invariants in 150 ms returned sat
[2023-03-24 20:27:21] [INFO ] After 1190ms SMT Verify possible using all constraints in natural domain returned unsat :27 sat :0
Fused 27 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 47 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 20:27:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-24 20:27:21] [INFO ] Flatten gal took : 56 ms
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 20:27:21] [INFO ] Flatten gal took : 57 ms
[2023-03-24 20:27:21] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 751 out of 1945 places (down from 827) after GAL structural reductions.
Computed a total of 1945 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1945 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 1945/1945 places, 356/356 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1918 transition count 356
Applied a total of 27 rules in 59 ms. Remains 1918 /1945 variables (removed 27) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 1918/1945 places, 356/356 transitions.
[2023-03-24 20:27:21] [INFO ] Flatten gal took : 46 ms
[2023-03-24 20:27:21] [INFO ] Flatten gal took : 46 ms
[2023-03-24 20:27:21] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1945/1945 places, 356/356 transitions.
Graph (complete) has 15540 edges and 1945 vertex of which 1895 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.15 ms
Discarding 50 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1895 transition count 356
Applied a total of 2 rules in 114 ms. Remains 1895 /1945 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 117 ms. Remains : 1895/1945 places, 356/356 transitions.
[2023-03-24 20:27:22] [INFO ] Flatten gal took : 42 ms
[2023-03-24 20:27:22] [INFO ] Flatten gal took : 43 ms
[2023-03-24 20:27:22] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1945/1945 places, 356/356 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 1896 transition count 356
Applied a total of 49 rules in 59 ms. Remains 1896 /1945 variables (removed 49) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 1896/1945 places, 356/356 transitions.
[2023-03-24 20:27:22] [INFO ] Flatten gal took : 38 ms
[2023-03-24 20:27:22] [INFO ] Flatten gal took : 40 ms
[2023-03-24 20:27:22] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1945/1945 places, 356/356 transitions.
Graph (complete) has 15540 edges and 1945 vertex of which 1342 are kept as prefixes of interest. Removing 603 places using SCC suffix rule.6 ms
Discarding 603 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1297 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1297 transition count 264
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1297 transition count 264
Applied a total of 92 rules in 269 ms. Remains 1297 /1945 variables (removed 648) and now considering 264/356 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 270 ms. Remains : 1297/1945 places, 264/356 transitions.
[2023-03-24 20:27:22] [INFO ] Flatten gal took : 27 ms
[2023-03-24 20:27:22] [INFO ] Flatten gal took : 28 ms
[2023-03-24 20:27:22] [INFO ] Input system was already deterministic with 264 transitions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2021697 steps, run timeout after 3001 ms. (steps per millisecond=673 ) properties seen :{}
Probabilistic random walk after 2021697 steps, saw 274559 distinct states, run finished after 3001 ms. (steps per millisecond=673 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 1297 cols
[2023-03-24 20:27:25] [INFO ] Computed 1035 place invariants in 19 ms
[2023-03-24 20:27:25] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 20:27:26] [INFO ] [Nat]Absence check using 0 positive and 1035 generalized place invariants in 172 ms returned sat
[2023-03-24 20:27:26] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 20:27:26] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-24 20:27:26] [INFO ] After 735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
Starting structural reductions in LTL mode, iteration 0 : 1945/1945 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1895 transition count 356
Applied a total of 50 rules in 68 ms. Remains 1895 /1945 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 1895/1945 places, 356/356 transitions.
[2023-03-24 20:27:26] [INFO ] Flatten gal took : 37 ms
[2023-03-24 20:27:26] [INFO ] Flatten gal took : 42 ms
[2023-03-24 20:27:26] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1945/1945 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1895 transition count 356
Applied a total of 50 rules in 71 ms. Remains 1895 /1945 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 1895/1945 places, 356/356 transitions.
[2023-03-24 20:27:27] [INFO ] Flatten gal took : 40 ms
[2023-03-24 20:27:27] [INFO ] Flatten gal took : 38 ms
[2023-03-24 20:27:27] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1945/1945 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1895 transition count 356
Applied a total of 50 rules in 66 ms. Remains 1895 /1945 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 1895/1945 places, 356/356 transitions.
[2023-03-24 20:27:27] [INFO ] Flatten gal took : 36 ms
[2023-03-24 20:27:27] [INFO ] Flatten gal took : 37 ms
[2023-03-24 20:27:27] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1945/1945 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1895 transition count 356
Applied a total of 50 rules in 57 ms. Remains 1895 /1945 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 1895/1945 places, 356/356 transitions.
[2023-03-24 20:27:27] [INFO ] Flatten gal took : 35 ms
[2023-03-24 20:27:27] [INFO ] Flatten gal took : 43 ms
[2023-03-24 20:27:27] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1945/1945 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1895 transition count 356
Applied a total of 50 rules in 57 ms. Remains 1895 /1945 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 1895/1945 places, 356/356 transitions.
[2023-03-24 20:27:27] [INFO ] Flatten gal took : 34 ms
[2023-03-24 20:27:27] [INFO ] Flatten gal took : 35 ms
[2023-03-24 20:27:27] [INFO ] Input system was already deterministic with 356 transitions.
[2023-03-24 20:27:27] [INFO ] Flatten gal took : 37 ms
[2023-03-24 20:27:27] [INFO ] Flatten gal took : 37 ms
[2023-03-24 20:27:27] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-24 20:27:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1945 places, 356 transitions and 4302 arcs took 6 ms.
Total runtime 47475 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 1945 NrTr: 356 NrArc: 4302)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.188sec
net check time: 0m 0.000sec
init dd package: 0m 2.682sec
before gc: list nodes free: 1314226
after gc: idd nodes used:52957394, unused:11042606; list nodes free:51355711
RS generation: 8m28.746sec
-> last computed set: #nodes 52955473 (5.3e+07) #states 4,194,305 (6)
CANNOT_COMPUTE
BK_STOP 1679690189763
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.001sec
idd.cc:820: DD Exception: No free nodes
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="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is QuasiCertifProtocol-PT-22, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873952300889"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;