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.r490-tall-167912708700442.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 Szymanski-PT-a12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708700442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K 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 Szymanski-PT-a12-CTLFireability-00
FORMULA_NAME Szymanski-PT-a12-CTLFireability-01
FORMULA_NAME Szymanski-PT-a12-CTLFireability-02
FORMULA_NAME Szymanski-PT-a12-CTLFireability-03
FORMULA_NAME Szymanski-PT-a12-CTLFireability-04
FORMULA_NAME Szymanski-PT-a12-CTLFireability-05
FORMULA_NAME Szymanski-PT-a12-CTLFireability-06
FORMULA_NAME Szymanski-PT-a12-CTLFireability-07
FORMULA_NAME Szymanski-PT-a12-CTLFireability-08
FORMULA_NAME Szymanski-PT-a12-CTLFireability-09
FORMULA_NAME Szymanski-PT-a12-CTLFireability-10
FORMULA_NAME Szymanski-PT-a12-CTLFireability-11
FORMULA_NAME Szymanski-PT-a12-CTLFireability-12
FORMULA_NAME Szymanski-PT-a12-CTLFireability-13
FORMULA_NAME Szymanski-PT-a12-CTLFireability-14
FORMULA_NAME Szymanski-PT-a12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679255388539

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=Szymanski-PT-a12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:49:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 19:49:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:49:50] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-19 19:49:50] [INFO ] Transformed 61 places.
[2023-03-19 19:49:50] [INFO ] Transformed 224 transitions.
[2023-03-19 19:49:50] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a12-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Applied a total of 2 rules in 12 ms. Remains 47 /49 variables (removed 2) and now considering 216/216 (removed 0) transitions.
[2023-03-19 19:49:50] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 47 cols
[2023-03-19 19:49:50] [INFO ] Computed 1 place invariants in 11 ms
[2023-03-19 19:49:50] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-19 19:49:50] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:49:50] [INFO ] Invariant cache hit.
[2023-03-19 19:49:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:49:50] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-19 19:49:50] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:49:50] [INFO ] Invariant cache hit.
[2023-03-19 19:49:50] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 47/49 places, 216/216 transitions.
Support contains 37 out of 47 places after structural reductions.
[2023-03-19 19:49:50] [INFO ] Flatten gal took : 42 ms
[2023-03-19 19:49:50] [INFO ] Flatten gal took : 17 ms
[2023-03-19 19:49:50] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 36 out of 47 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10005 steps, including 11 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 46) seen :24
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) 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 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2023-03-19 19:49:51] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:49:51] [INFO ] Invariant cache hit.
[2023-03-19 19:49:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:49:51] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :5 sat :3 real:10
[2023-03-19 19:49:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:49:51] [INFO ] After 17ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :5 sat :0 real:13
[2023-03-19 19:49:51] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:13
[2023-03-19 19:49:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:49:51] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :10
[2023-03-19 19:49:51] [INFO ] After 43ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :8 sat :10
[2023-03-19 19:49:51] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :10
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-19 19:49:51] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :10
Fused 18 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 13 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 216/216 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 199
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 199
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 25 place count 43 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 41 transition count 175
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 41 transition count 175
Applied a total of 29 rules in 24 ms. Remains 41 /47 variables (removed 6) and now considering 175/216 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 41/47 places, 175/216 transitions.
Incomplete random walk after 10004 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-19 19:49:52] [INFO ] Flow matrix only has 68 transitions (discarded 107 similar events)
// Phase 1: matrix 68 rows 41 cols
[2023-03-19 19:49:52] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 19:49:52] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:49:52] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-19 19:49:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:49:52] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 19:49:52] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 19:49:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:49:52] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 19:49:52] [INFO ] After 26ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 19:49:52] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 19:49:52] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 33 ms.
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 175/175 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 40 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 40 transition count 170
Applied a total of 3 rules in 22 ms. Remains 40 /41 variables (removed 1) and now considering 170/175 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 40/41 places, 170/175 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Finished probabilistic random walk after 10110 steps, run visited all 9 properties in 68 ms. (steps per millisecond=148 )
Probabilistic random walk after 10110 steps, saw 7159 distinct states, run finished after 68 ms. (steps per millisecond=148 ) properties seen :9
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-a12-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:49:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 16 ms
[2023-03-19 19:49:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-a12-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:49:52] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 24 out of 47 places (down from 29) after GAL structural reductions.
Computed a total of 9 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 3 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:49:52] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 40 transition count 172
Applied a total of 30 rules in 16 ms. Remains 40 /47 variables (removed 7) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 40/47 places, 172/216 transitions.
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:52] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 3 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:52] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:49:52] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 42 transition count 180
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 41 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 41 transition count 176
Applied a total of 28 rules in 13 ms. Remains 41 /47 variables (removed 6) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 41/47 places, 176/216 transitions.
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:52] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 40 transition count 172
Applied a total of 30 rules in 12 ms. Remains 40 /47 variables (removed 7) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 40/47 places, 172/216 transitions.
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:52] [INFO ] Input system was already deterministic with 172 transitions.
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
FORMULA Szymanski-PT-a12-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:52] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:52] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:49:53] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:49:53] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:49:53] [INFO ] Input system was already deterministic with 200 transitions.
[2023-03-19 19:49:53] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:53] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:53] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-19 19:49:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 216 transitions and 860 arcs took 2 ms.
Total runtime 4174 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: 47 NrTr: 216 NrArc: 860)

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

net check time: 0m 0.000sec

init dd package: 0m 2.789sec


RS generation: 0m23.378sec


-> reachability set: #nodes 11862 (1.2e+04) #states 12,685,347,615,351,684 (16)



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

checking: AF [AG [AF [[p3<=0 | p16<=0]]]]
normalized: ~ [EG [E [true U EG [~ [[p3<=0 | p16<=0]]]]]]

abstracting: (p16<=0)
states: 7,561,027,097,281,255 (15)
abstracting: (p3<=0)
states: 11,680,827,005,671,291 (16)
.......................
EG iterations: 23
.
EG iterations: 1
-> the formula is FALSE

FORMULA Szymanski-PT-a12-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.711sec

checking: AF [[EX [EF [[AX [[1<=p41 & 1<=p1]] | [[1<=p2 & 1<=p17] & [1<=p2 & 1<=p24]]]]] | AX [1<=0]]]
normalized: ~ [EG [~ [[EX [E [true U [[[1<=p2 & 1<=p24] & [1<=p2 & 1<=p17]] | ~ [EX [~ [[1<=p41 & 1<=p1]]]]]]] | ~ [EX [~ [1<=0]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p1)
states: 3,307,753,309,545,919 (15)
abstracting: (1<=p41)
states: 4,941,746,966,487,669 (15)
.abstracting: (1<=p17)
states: 5,124,320,518,070,429 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
abstracting: (1<=p24)
states: 5,124,320,518,070,429 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
..
EG iterations: 1
-> the formula is TRUE

FORMULA Szymanski-PT-a12-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.374sec

checking: E [[1<=p2 & 1<=p8] U EF [~ [A [~ [[1<=p1 & 1<=p22]] U ~ [[1<=p2 & 1<=p45]]]]]]
normalized: E [[1<=p2 & 1<=p8] U E [true U ~ [[~ [EG [[1<=p2 & 1<=p45]]] & ~ [E [[1<=p2 & 1<=p45] U [[1<=p1 & 1<=p22] & [1<=p2 & 1<=p45]]]]]]]]

abstracting: (1<=p45)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
abstracting: (1<=p22)
states: 5,124,320,518,070,429 (15)
abstracting: (1<=p1)
states: 3,307,753,309,545,919 (15)
abstracting: (1<=p45)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
abstracting: (1<=p45)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
.
EG iterations: 1
abstracting: (1<=p8)
states: 2,002,167,276,516,069 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
-> the formula is TRUE

FORMULA Szymanski-PT-a12-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.395sec

checking: EG [[E [AG [~ [[1<=p1 & 1<=p42]]] U AX [EX [[1<=p1 & 1<=p10]]]] | EF [EG [[1<=p1 & 1<=p35]]]]]
normalized: EG [[E [true U EG [[1<=p1 & 1<=p35]]] | E [~ [E [true U [1<=p1 & 1<=p42]]] U ~ [EX [~ [EX [[1<=p1 & 1<=p10]]]]]]]]

abstracting: (1<=p10)
states: 2,907,669,616,117,643 (15)
abstracting: (1<=p1)
states: 3,307,753,309,545,919 (15)
..abstracting: (1<=p42)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p1)
states: 3,307,753,309,545,919 (15)
abstracting: (1<=p35)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p1)
states: 3,307,753,309,545,919 (15)
........................
EG iterations: 24

EG iterations: 0
-> the formula is TRUE

FORMULA Szymanski-PT-a12-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.046sec

checking: E [[AF [[1<=p3 & 1<=p45]] & AF [[~ [E [[1<=p1 & 1<=p21] U [1<=p0 & 1<=p15]]] | AX [[1<=p1 & 1<=p9]]]]] U AF [[1<=p0 & 1<=p43]]]
normalized: E [[~ [EG [~ [[~ [E [[1<=p1 & 1<=p21] U [1<=p0 & 1<=p15]]] | ~ [EX [~ [[1<=p1 & 1<=p9]]]]]]]] & ~ [EG [~ [[1<=p3 & 1<=p45]]]]] U ~ [EG [~ [[1<=p0 & 1<=p43]]]]]

abstracting: (1<=p43)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p0)
states: 1,004,520,664,307,694 (15)
..
EG iterations: 2
abstracting: (1<=p45)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p3)
states: 1,004,520,609,680,393 (15)
..
EG iterations: 2
abstracting: (1<=p9)
states: 2,907,669,466,803,023 (15)
abstracting: (1<=p1)
states: 3,307,753,309,545,919 (15)
.abstracting: (1<=p15)
states: 5,124,320,518,070,429 (15)
abstracting: (1<=p0)
states: 1,004,520,664,307,694 (15)
abstracting: (1<=p21)
states: 5,124,320,518,070,429 (15)
abstracting: (1<=p1)
states: 3,307,753,309,545,919 (15)
.......................
EG iterations: 23
-> the formula is FALSE

FORMULA Szymanski-PT-a12-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.054sec

checking: EF [[[AX [~ [E [[1<=p2 & 1<=p10] U E [[1<=p3 & 1<=p24] U [1<=p2 & 1<=p43]]]]] & EX [E [[1<=p2 & 1<=p38] U [1<=p3 & 1<=p24]]]] & [1<=p3 & 1<=p42]]]
normalized: E [true U [[1<=p3 & 1<=p42] & [EX [E [[1<=p2 & 1<=p38] U [1<=p3 & 1<=p24]]] & ~ [EX [E [[1<=p2 & 1<=p10] U E [[1<=p3 & 1<=p24] U [1<=p2 & 1<=p43]]]]]]]]

abstracting: (1<=p43)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
abstracting: (1<=p24)
states: 5,124,320,518,070,429 (15)
abstracting: (1<=p3)
states: 1,004,520,609,680,393 (15)
abstracting: (1<=p10)
states: 2,907,669,616,117,643 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
.abstracting: (1<=p24)
states: 5,124,320,518,070,429 (15)
abstracting: (1<=p3)
states: 1,004,520,609,680,393 (15)
abstracting: (1<=p38)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
.abstracting: (1<=p42)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p3)
states: 1,004,520,609,680,393 (15)
-> the formula is TRUE

FORMULA Szymanski-PT-a12-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.258sec

checking: [~ [E [EG [E [~ [[1<=p18 & 1<=p3]] U ~ [[1<=p2 & 1<=p20]]]] U EF [AX [EX [[1<=p2 & 1<=p37]]]]]] | A [EX [AX [[[1<=p2 & 1<=p35] | [[1<=p3 & 1<=p42] & [1<=p0 & 1<=p25]]]]] U EX [AX [1<=0]]]]
normalized: [[~ [EG [~ [EX [~ [EX [~ [1<=0]]]]]]] & ~ [E [~ [EX [~ [EX [~ [1<=0]]]]] U [~ [EX [~ [EX [~ [[[[1<=p0 & 1<=p25] & [1<=p3 & 1<=p42]] | [1<=p2 & 1<=p35]]]]]]] & ~ [EX [~ [EX [~ [1<=0]]]]]]]]] | ~ [E [EG [E [~ [[1<=p18 & 1<=p3]] U ~ [[1<=p2 & 1<=p20]]]] U E [true U ~ [EX [~ [EX [[1<=p2 & 1<=p37]]]]]]]]]

abstracting: (1<=p37)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
..abstracting: (1<=p20)
states: 5,124,320,518,070,429 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
abstracting: (1<=p3)
states: 1,004,520,609,680,393 (15)
abstracting: (1<=p18)
states: 5,124,320,518,070,429 (15)

EG iterations: 0
abstracting: (1<=0)
states: 0
..abstracting: (1<=p35)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p2)
states: 3,307,753,450,666,443 (15)
abstracting: (1<=p42)
states: 4,941,746,966,487,669 (15)
abstracting: (1<=p3)
states: 1,004,520,609,680,393 (15)
abstracting: (1<=p25)
states: 5,124,320,518,070,429 (15)
abstracting: (1<=p0)
states: 1,004,520,664,307,694 (15)
..abstracting: (1<=0)
states: 0
..abstracting: (1<=0)
states: 0
....
EG iterations: 2
-> the formula is FALSE

FORMULA Szymanski-PT-a12-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.984sec

totally nodes used: 12407232 (1.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 835652592 181527750 1017180342
used/not used/entry size/cache size: 62058604 5050260 16 1024MB
basic ops cache: hits/miss/sum: 48120359 9847791 57968150
used/not used/entry size/cache size: 11005967 5771249 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 338857 77747 416604
used/not used/entry size/cache size: 77448 8311160 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 56113898
1 9903902
2 973592
3 85204
4 11495
5 4016
6 3605
7 3258
8 2023
9 1271
>= 10 6600

Total processing time: 1m34.585sec


BK_STOP 1679255498754

--------------------
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

10198 11794 24461 22028 19875 22115 14739
iterations count:753385 (3487), effective:20513 (94)

initing FirstDep: 0m 0.000sec


iterations count:6957 (32), effective:133 (0)

iterations count:7029 (32), effective:157 (0)

iterations count:28552 (132), effective:315 (1)

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

iterations count:39346 (182), effective:474 (2)

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

iterations count:47354 (219), effective:607 (2)

iterations count:1723 (7), effective:10 (0)

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

iterations count:686 (3), effective:6 (0)

iterations count:871 (4), effective:20 (0)

iterations count:760 (3), effective:18 (0)
15893
iterations count:131366 (608), effective:1889 (8)

iterations count:34293 (158), effective:459 (2)

iterations count:610 (2), effective:16 (0)

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

iterations count:6168 (28), effective:76 (0)

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="Szymanski-PT-a12"
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 Szymanski-PT-a12, 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 r490-tall-167912708700442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-a12.tgz
mv Szymanski-PT-a12 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 ;