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

About the Execution of Marcie+red for Murphy-PT-D2N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 426285.00 0.00 0.00 TF????FTFFFF?T?F normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247200345.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 Murphy-PT-D2N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 12K Mar 31 16:48 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 Murphy-PT-D2N100-CTLCardinality-00
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-01
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-02
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-03
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-04
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-05
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-06
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-07
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-08
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-09
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-10
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-11
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-12
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-13
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-14
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680892869625

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=Murphy-PT-D2N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:41:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:41:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:41:11] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-07 18:41:11] [INFO ] Transformed 18 places.
[2023-04-07 18:41:11] [INFO ] Transformed 21 transitions.
[2023-04-07 18:41:11] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-PT-D2N100-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 8 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:41:11] [INFO ] Computed 4 invariants in 9 ms
[2023-04-07 18:41:11] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
[2023-04-07 18:41:11] [INFO ] Invariant cache hit.
[2023-04-07 18:41:11] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 18:41:11] [INFO ] Invariant cache hit.
[2023-04-07 18:41:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:11] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-07 18:41:11] [INFO ] Invariant cache hit.
[2023-04-07 18:41:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 18:41:11] [INFO ] Flatten gal took : 15 ms
[2023-04-07 18:41:11] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:41:11] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 76) seen :48
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-04-07 18:41:12] [INFO ] Invariant cache hit.
[2023-04-07 18:41:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:41:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 13 ms returned sat
[2023-04-07 18:41:12] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-04-07 18:41:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:41:12] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:13] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-04-07 18:41:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:13] [INFO ] After 48ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-04-07 18:41:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 4 ms to minimize.
[2023-04-07 18:41:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 18:41:13] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2023-04-07 18:41:13] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2023-04-07 18:41:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2023-04-07 18:41:13] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 2 ms to minimize.
[2023-04-07 18:41:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:41:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-04-07 18:41:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-07 18:41:13] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-04-07 18:41:13] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 0 properties in 176 ms.
Support contains 15 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:13] [INFO ] Invariant cache hit.
[2023-04-07 18:41:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 250195 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250195 steps, saw 163407 distinct states, run finished after 3003 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 28 properties.
[2023-04-07 18:41:16] [INFO ] Invariant cache hit.
[2023-04-07 18:41:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:41:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 6 ms returned sat
[2023-04-07 18:41:16] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-04-07 18:41:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:41:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:16] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-04-07 18:41:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:17] [INFO ] After 72ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-04-07 18:41:17] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2023-04-07 18:41:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-07 18:41:17] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-07 18:41:17] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-07 18:41:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2023-04-07 18:41:17] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 18:41:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-04-07 18:41:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-04-07 18:41:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-07 18:41:17] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-07 18:41:17] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 0 properties in 318 ms.
Support contains 15 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:17] [INFO ] Invariant cache hit.
[2023-04-07 18:41:17] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 18:41:17] [INFO ] Invariant cache hit.
[2023-04-07 18:41:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 18:41:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:41:17] [INFO ] Invariant cache hit.
[2023-04-07 18:41:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 28 properties.
[2023-04-07 18:41:17] [INFO ] Invariant cache hit.
[2023-04-07 18:41:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:41:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:17] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-04-07 18:41:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:41:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:17] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-04-07 18:41:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:17] [INFO ] After 43ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-04-07 18:41:17] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-07 18:41:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-04-07 18:41:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2023-04-07 18:41:18] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2023-04-07 18:41:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-07 18:41:18] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-07 18:41:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:41:18] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-04-07 18:41:18] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 11 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 7 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 7 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:18] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:19] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 18:41:19] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:19] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:19] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 18:41:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
Total runtime 7654 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: 18 NrTr: 21 NrArc: 81)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.762sec


RS generation: 0m22.157sec


-> reachability set: #nodes 53223 (5.3e+04) #states 1,207,044,185,616 (12)



starting MCC model checker
--------------------------

checking: EF [EG [[20<=p10 & EX [~ [17<=p10]]]]]
normalized: E [true U EG [[EX [~ [17<=p10]] & 20<=p10]]]

abstracting: (20<=p10)
states: 0
abstracting: (17<=p10)
states: 0
..
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.794sec

checking: EG [~ [E [p15<=77 U ~ [p2<=34]]]]
normalized: EG [~ [E [p15<=77 U ~ [p2<=34]]]]

abstracting: (p2<=34)
states: 549,386,606,160 (11)
abstracting: (p15<=77)
states: 1,207,044,185,616 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.368sec

checking: EX [AG [AX [[p10<=34 & EX [~ [44<=p2]]]]]]
normalized: EX [~ [E [true U EX [~ [[p10<=34 & EX [~ [44<=p2]]]]]]]]

abstracting: (44<=p2)
states: 555,382,795,968 (11)
.abstracting: (p10<=34)
states: 1,207,044,185,616 (12)
..-> the formula is FALSE

FORMULA Murphy-PT-D2N100-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.476sec

checking: AG [[EX [[~ [100<=p8] | ~ [p14<=74]]] | AX [35<=p6]]]
normalized: ~ [E [true U ~ [[EX [[~ [100<=p8] | ~ [p14<=74]]] | ~ [EX [~ [35<=p6]]]]]]]

abstracting: (35<=p6)
states: 657,657,579,456 (11)
.abstracting: (p14<=74)
states: 1,207,044,185,616 (12)
abstracting: (100<=p8)
states: 166,856,796,288 (11)
.-> the formula is FALSE

FORMULA Murphy-PT-D2N100-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.894sec

checking: [AG [EF [~ [p11<=61]]] | [AF [p5<=47] | AG [EX [AG [~ [16<=p8]]]]]]
normalized: [[~ [E [true U ~ [EX [~ [E [true U 16<=p8]]]]]] | ~ [EG [~ [p5<=47]]]] | ~ [E [true U ~ [E [true U ~ [p11<=61]]]]]]

abstracting: (p11<=61)
states: 1,207,044,185,616 (12)
abstracting: (p5<=47)
states: 692,794,038,096 (11)
.
EG iterations: 1
abstracting: (16<=p8)
states: 922,782,212,352 (11)
.-> the formula is FALSE

FORMULA Murphy-PT-D2N100-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.281sec

checking: EF [EG [[p13<=p5 & [p4<=90 & [45<=p16 | p11<=31]]]]]
normalized: E [true U EG [[p13<=p5 & [p4<=90 & [45<=p16 | p11<=31]]]]]

abstracting: (p11<=31)
states: 1,207,044,185,616 (12)
abstracting: (45<=p16)
states: 0
abstracting: (p4<=90)
states: 1,000,363,344,048 (12)
abstracting: (p13<=p5)
states: 1,187,575,696,728 (12)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.899sec

checking: EF [[~ [p0<=60] & EX [[82<=p3 | [p9<=18 | [EX [~ [p17<=p15]] & ~ [p4<=p13]]]]]]]
normalized: E [true U [EX [[82<=p3 | [p9<=18 | [~ [p4<=p13] & EX [~ [p17<=p15]]]]]] & ~ [p0<=60]]]

abstracting: (p0<=60)
states: 809,879,543,280 (11)
abstracting: (p17<=p15)
states: 771,167,118,588 (11)
.abstracting: (p4<=p13)
states: 38,768,451,336 (10)
abstracting: (p9<=18)
states: 1,207,044,185,616 (12)
abstracting: (82<=p3)
states: 253,670,589,216 (11)
.-> the formula is TRUE

FORMULA Murphy-PT-D2N100-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.882sec

checking: [E [AG [[E [56<=p7 U AF [p17<=88]] | A [[p2<=73 & 91<=p12] U ~ [p6<=p8]]]] U AX [~ [p11<=p6]]] & AG [~ [40<=p10]]]
normalized: [~ [E [true U 40<=p10]] & E [~ [E [true U ~ [[[~ [EG [p6<=p8]] & ~ [E [p6<=p8 U [p6<=p8 & ~ [[p2<=73 & 91<=p12]]]]]] | E [56<=p7 U ~ [EG [~ [p17<=88]]]]]]]] U ~ [EX [p11<=p6]]]]

abstracting: (p11<=p6)
states: 1,197,313,691,148 (12)
.abstracting: (p17<=88)
states: 1,207,044,185,616 (12)
.
EG iterations: 1
abstracting: (56<=p7)
states: 439,312,507,200 (11)
abstracting: (91<=p12)
states: 0
abstracting: (p2<=73)
states: 904,707,364,752 (11)
abstracting: (p6<=p8)
states: 608,450,537,592 (11)
abstracting: (p6<=p8)
states: 608,450,537,592 (11)
abstracting: (p6<=p8)
states: 608,450,537,592 (11)
.
EG iterations: 1
abstracting: (40<=p10)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.097sec

checking: E [[AX [EX [EX [p9<=45]]] | AG [AX [AX [77<=p10]]]] U ~ [[EF [EX [46<=p2]] & A [[p13<=14 | p10<=p5] U [p17<=40 | p17<=p9]]]]]
normalized: E [[~ [E [true U EX [EX [~ [77<=p10]]]]] | ~ [EX [~ [EX [EX [p9<=45]]]]]] U ~ [[[~ [EG [~ [[p17<=40 | p17<=p9]]]] & ~ [E [~ [[p17<=40 | p17<=p9]] U [~ [[p13<=14 | p10<=p5]] & ~ [[p17<=40 | p17<=p9]]]]]] & E [true U EX [46<=p2]]]]]

abstracting: (46<=p2)
states: 534,503,743,488 (11)
.abstracting: (p17<=p9)
states: 402,348,061,872 (11)
abstracting: (p17<=40)
states: 1,207,044,185,616 (12)
abstracting: (p10<=p5)
states: 1,197,309,941,172 (12)
abstracting: (p13<=14)
states: 1,207,044,185,616 (12)
abstracting: (p17<=p9)
states: 402,348,061,872 (11)
abstracting: (p17<=40)
states: 1,207,044,185,616 (12)
abstracting: (p17<=p9)
states: 402,348,061,872 (11)
abstracting: (p17<=40)
states: 1,207,044,185,616 (12)
.
EG iterations: 1
abstracting: (p9<=45)
states: 1,207,044,185,616 (12)
...abstracting: (77<=p10)
states: 0
..-> the formula is FALSE

FORMULA Murphy-PT-D2N100-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1680893295910

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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.000sec


iterations count:14959 (712), effective:3586 (170)

initing FirstDep: 0m 0.000sec


iterations count:1108 (52), effective:264 (12)

iterations count:1436 (68), effective:343 (16)

iterations count:3625 (172), effective:960 (45)

iterations count:21 (1), effective:0 (0)

iterations count:512 (24), effective:119 (5)

iterations count:21 (1), effective:0 (0)

iterations count:3431 (163), effective:746 (35)

iterations count:1763 (83), effective:391 (18)

iterations count:21 (1), effective:0 (0)

iterations count:21 (1), effective:0 (0)

iterations count:1496 (71), effective:357 (17)

iterations count:21 (1), effective:0 (0)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 613 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="Murphy-PT-D2N100"
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 Murphy-PT-D2N100, 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 r522-tall-167987247200345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D2N100.tgz
mv Murphy-PT-D2N100 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;