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.r170-tall-167838857800850.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 GPPP-PT-C0100N0000000100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857800850
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 10:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678642340119

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000000100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 17:32:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:32:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:32:21] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-12 17:32:21] [INFO ] Transformed 33 places.
[2023-03-12 17:32:21] [INFO ] Transformed 22 transitions.
[2023-03-12 17:32:21] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C0100N0000000100-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:32:21] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-12 17:32:22] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
[2023-03-12 17:32:22] [INFO ] Invariant cache hit.
[2023-03-12 17:32:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 17:32:22] [INFO ] Invariant cache hit.
[2023-03-12 17:32:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-12 17:32:22] [INFO ] Invariant cache hit.
[2023-03-12 17:32:22] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 30 out of 33 places after structural reductions.
[2023-03-12 17:32:22] [INFO ] Flatten gal took : 21 ms
[2023-03-12 17:32:22] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:32:22] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10012 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 17:32:22] [INFO ] Invariant cache hit.
[2023-03-12 17:32:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:32:22] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:32:22] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-12 17:32:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 17:32:23] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 134 ms returned sat
[2023-03-12 17:32:23] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:32:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPPP-PT-C0100N0000000100-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:32:23] [INFO ] Invariant cache hit.
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:32:23] [INFO ] Invariant cache hit.
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:32:23] [INFO ] Invariant cache hit.
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:32:23] [INFO ] Invariant cache hit.
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 12 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 17:32:23] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 26/33 places, 17/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:32:23] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:32:23] [INFO ] Invariant cache hit.
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:32:23] [INFO ] Invariant cache hit.
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:32:23] [INFO ] Invariant cache hit.
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 5 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 17:32:23] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 26/33 places, 17/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 17 transitions.
Finished random walk after 907 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=453 )
FORMULA GPPP-PT-C0100N0000000100-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:32:23] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:32:23] [INFO ] Invariant cache hit.
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:32:23] [INFO ] Invariant cache hit.
[2023-03-12 17:32:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:32:23] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:32:23] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 17:32:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 0 ms.
Total runtime 2401 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 33 NrTr: 22 NrArc: 83)

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

net check time: 0m 0.000sec

init dd package: 0m 2.763sec


RS generation: 0m35.438sec


-> reachability set: #nodes 562750 (5.6e+05) #states 2,454,033,179,726,092 (15)



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

checking: EF [AG [1<=p12]]
normalized: E [true U ~ [E [true U ~ [1<=p12]]]]

abstracting: (1<=p12)
states: 1,205,389,109,805,522 (15)
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000100-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.983sec

checking: AG [EX [[p22<=0 | p19<=0]]]
normalized: ~ [E [true U ~ [EX [[p22<=0 | p19<=0]]]]]

abstracting: (p19<=0)
states: 1
abstracting: (p22<=0)
states: 1,248,065,134,989,013 (15)
.MC time: 5m22.217sec

checking: EX [[p1<=0 | p14<=0]]
normalized: EX [[p1<=0 | p14<=0]]

abstracting: (p14<=0)
states: 1,893,174,246,472,752 (15)
abstracting: (p1<=0)
states: 7,198,568,101,365 (12)
.-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000100-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.756sec

checking: EX [A [[1<=p9 & 1<=p10] U EF [AG [p12<=0]]]]
normalized: EX [[~ [EG [~ [E [true U ~ [E [true U ~ [p12<=0]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [p12<=0]]]]] U [~ [[1<=p9 & 1<=p10]] & ~ [E [true U ~ [E [true U ~ [p12<=0]]]]]]]]]]

abstracting: (p12<=0)
states: 1,248,644,069,920,570 (15)
MC time: 5m21.000sec

checking: A [EF [p24<=0] U EX [~ [AG [~ [[1<=p1 & 1<=p14]]]]]]
normalized: [~ [EG [~ [EX [E [true U [1<=p1 & 1<=p14]]]]]] & ~ [E [~ [EX [E [true U [1<=p1 & 1<=p14]]]] U [~ [E [true U p24<=0]] & ~ [EX [E [true U [1<=p1 & 1<=p14]]]]]]]]

abstracting: (1<=p14)
states: 560,858,933,253,340 (14)
abstracting: (1<=p1)
states: 2,446,834,611,624,727 (15)

before gc: list nodes free: 585143

after gc: idd nodes used:4434760, unused:59565240; list nodes free:607677050
MC time: 4m51.826sec

checking: [EG [[1<=p1 & 1<=p26]] | EX [EG [[p17<=0 | [p1<=0 | p26<=0]]]]]
normalized: [EX [EG [[p17<=0 | [p1<=0 | p26<=0]]]] | EG [[1<=p1 & 1<=p26]]]

abstracting: (1<=p26)
states: 2,422,236,450,328,756 (15)
abstracting: (1<=p1)
states: 2,446,834,611,624,727 (15)
...............................................................................................................................................................................MC time: 4m19.131sec

checking: AF [EX [~ [E [EF [1<=p24] U [[[1<=p1 & 1<=p26] | 1<=p12] & p16<=0]]]]]
normalized: ~ [EG [~ [EX [~ [E [E [true U 1<=p24] U [p16<=0 & [1<=p12 | [1<=p1 & 1<=p26]]]]]]]]]

abstracting: (1<=p26)
states: 2,422,236,450,328,756 (15)
abstracting: (1<=p1)
states: 2,446,834,611,624,727 (15)
abstracting: (1<=p12)
states: 1,205,389,109,805,522 (15)
abstracting: (p16<=0)
states: 1,895,009,059,080,559 (15)
abstracting: (1<=p24)
states: 1
........................................................................................................................................
before gc: list nodes free: 714782

after gc: idd nodes used:7043625, unused:56956375; list nodes free:622646721
.MC time: 4m 8.680sec

checking: EG [[AG [AX [AF [p21<=0]]] | AX [E [AG [[1<=p15 & 300<=p27]] U [AG [2<=p7] | [1<=p15 & 300<=p27]]]]]]
normalized: EG [[~ [EX [~ [E [~ [E [true U ~ [[1<=p15 & 300<=p27]]]] U [[1<=p15 & 300<=p27] | ~ [E [true U ~ [2<=p7]]]]]]]] | ~ [E [true U EX [EG [~ [p21<=0]]]]]]]

abstracting: (p21<=0)
states: 1,248,065,134,989,013 (15)
.........................................................................................................................................MC time: 3m29.081sec

checking: AF [[EG [EX [[p3<=0 | p23<=0]]] | ~ [A [AX [A [[1<=p11 & [1<=p12 & 700<=p31]] U [1<=p15 & 300<=p27]]] U 1<=p21]]]]
normalized: ~ [EG [~ [[~ [[~ [EG [~ [1<=p21]]] & ~ [E [~ [1<=p21] U [EX [~ [[~ [EG [~ [[1<=p15 & 300<=p27]]]] & ~ [E [~ [[1<=p15 & 300<=p27]] U [~ [[1<=p11 & [1<=p12 & 700<=p31]]] & ~ [[1<=p15 & 300<=p27]]]]]]]] & ~ [1<=p21]]]]]] | EG [EX [[p3<=0 | p23<=0]]]]]]]

abstracting: (p23<=0)
states: 1,246,736,113,045,453 (15)
abstracting: (p3<=0)
states: 46,653,648,221,236 (13)
.............................................................................................................................................MC time: 3m 8.067sec

checking: [EX [[p8<=0 | p29<=199]] & EF [[EG [1<=p21] | EF [[[p9<=0 | p10<=0] | [p12<=0 | [p8<=0 | p30<=0]]]]]]]
normalized: [E [true U [E [true U [[p12<=0 | [p8<=0 | p30<=0]] | [p9<=0 | p10<=0]]] | EG [1<=p21]]] & EX [[p8<=0 | p29<=199]]]

abstracting: (p29<=199)
states: 2,449,887,351,368,907 (15)
abstracting: (p8<=0)
states: 16,159,952,425,705 (13)
.abstracting: (1<=p21)
states: 1,205,968,044,737,079 (15)
.....................................................................................................................................................MC time: 2m49.206sec

checking: AX [[EF [[EG [[2<=p4 & [1<=p15 & 1<=p28]]] & E [[2<=p4 & [1<=p15 & 1<=p28]] U [2<=p4 & [1<=p15 & 1<=p28]]]]] & [p15<=0 | p27<=299]]]
normalized: ~ [EX [~ [[[p15<=0 | p27<=299] & E [true U [E [[2<=p4 & [1<=p15 & 1<=p28]] U [2<=p4 & [1<=p15 & 1<=p28]]] & EG [[2<=p4 & [1<=p15 & 1<=p28]]]]]]]]]

abstracting: (1<=p28)
states: 2,448,091,803,151,858 (15)
abstracting: (1<=p15)
states: 2,418,238,405,113,783 (15)
abstracting: (2<=p4)
states: 2,431,182,631,939,023 (15)
..........................................................................................................................MC time: 2m33.576sec

checking: EX [[AF [[[[A [[2<=p4 & [1<=p15 & 1<=p28]] U 1<=p17] | 2<=p7] & A [2<=p7 U [2<=p4 & [1<=p15 & 1<=p28]]]] & [[p5<=0 | p6<=0] & [[[p0<=0 | p2<=0] | [p12<=0 | p32<=0]] & [p4<=1 | [p15<=0 | p28<=0]]]]]] | [1<=p11 & [1<=p12 & 700<=p31]]]]
normalized: EX [[~ [EG [~ [[[[~ [EG [~ [[2<=p4 & [1<=p15 & 1<=p28]]]]] & ~ [E [~ [[2<=p4 & [1<=p15 & 1<=p28]]] U [~ [2<=p7] & ~ [[2<=p4 & [1<=p15 & 1<=p28]]]]]]] & [2<=p7 | [~ [EG [~ [1<=p17]]] & ~ [E [~ [1<=p17] U [~ [[2<=p4 & [1<=p15 & 1<=p28]]] & ~ [1<=p17]]]]]]] & [[[p4<=1 | [p15<=0 | p28<=0]] & [[p12<=0 | p32<=0] | [p0<=0 | p2<=0]]] & [p5<=0 | p6<=0]]]]]] | [1<=p11 & [1<=p12 & 700<=p31]]]]

abstracting: (700<=p31)
states: 3,653,037,803,572 (12)
abstracting: (1<=p12)
states: 1,205,389,109,805,522 (15)
abstracting: (1<=p11)
states: 748,037,032,248,336 (14)
abstracting: (p6<=0)
states: 23,574,182,830,747 (13)
abstracting: (p5<=0)
states: 12,751,780,145,499 (13)
abstracting: (p2<=0)
states: 0
abstracting: (p0<=0)
states: 1
abstracting: (p32<=0)
states: 3,653,037,803,572 (12)
abstracting: (p12<=0)
states: 1,248,644,069,920,570 (15)
abstracting: (p28<=0)
states: 5,941,376,574,234 (12)
abstracting: (p15<=0)
states: 35,794,774,612,309 (13)
abstracting: (p4<=1)
states: 22,850,547,787,069 (13)
abstracting: (1<=p17)
states: 1,205,389,109,805,522 (15)
abstracting: (1<=p28)
states: 2,448,091,803,151,858 (15)
abstracting: (1<=p15)
states: 2,418,238,405,113,783 (15)
abstracting: (2<=p4)
states: 2,431,182,631,939,023 (15)
abstracting: (1<=p17)
states: 1,205,389,109,805,522 (15)

before gc: list nodes free: 1636988

after gc: idd nodes used:10334940, unused:53665060; list nodes free:654886591
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 252036 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15877760 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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:11981 (544), effective:2887 (131)

initing FirstDep: 0m 0.000sec


iterations count:125 (5), effective:15 (0)

sat_reach.icc:155: Timeout: after 321 sec


iterations count:5076 (230), effective:1011 (45)

sat_reach.icc:155: Timeout: after 320 sec


sat_reach.icc:155: Timeout: after 288 sec


net_ddint.h:600: Timeout: after 258 sec


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

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

ctl_mc.icc:221: Timeout: after 232 sec


net_ddint.h:600: Timeout: after 208 sec


net_ddint.h:600: Timeout: after 187 sec


net_ddint.h:600: Timeout: after 168 sec


ctl_mc.icc:221: Timeout: after 151 sec


sat_reach.icc:155: Timeout: after 136 sec

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="GPPP-PT-C0100N0000000100"
export BK_EXAMINATION="CTLFireability"
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 GPPP-PT-C0100N0000000100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857800850"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;