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.r202-smll-167840348700449.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 HirschbergSinclair-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 14K Feb 26 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 02:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 02:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 02:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 284K 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 HirschbergSinclair-PT-20-CTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-20-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678790790754

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=HirschbergSinclair-PT-20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 10:46:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 10:46:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:46:33] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-14 10:46:33] [INFO ] Transformed 530 places.
[2023-03-14 10:46:33] [INFO ] Transformed 485 transitions.
[2023-03-14 10:46:33] [INFO ] Parsed PT model containing 530 places and 485 transitions and 1479 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Support contains 180 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 485/485 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 519 transition count 485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 514 transition count 480
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 514 transition count 480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 512 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 512 transition count 478
Applied a total of 25 rules in 168 ms. Remains 512 /530 variables (removed 18) and now considering 478/485 (removed 7) transitions.
// Phase 1: matrix 478 rows 512 cols
[2023-03-14 10:46:33] [INFO ] Computed 34 place invariants in 34 ms
[2023-03-14 10:46:34] [INFO ] Implicit Places using invariants in 700 ms returned []
[2023-03-14 10:46:34] [INFO ] Invariant cache hit.
[2023-03-14 10:46:36] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
[2023-03-14 10:46:36] [INFO ] Invariant cache hit.
[2023-03-14 10:46:36] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 512/530 places, 478/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2886 ms. Remains : 512/530 places, 478/485 transitions.
Support contains 180 out of 512 places after structural reductions.
[2023-03-14 10:46:36] [INFO ] Flatten gal took : 160 ms
[2023-03-14 10:46:37] [INFO ] Flatten gal took : 84 ms
[2023-03-14 10:46:37] [INFO ] Input system was already deterministic with 478 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 118) seen :94
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Running SMT prover for 24 properties.
[2023-03-14 10:46:38] [INFO ] Invariant cache hit.
[2023-03-14 10:46:38] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-14 10:46:39] [INFO ] [Nat]Absence check using 30 positive place invariants in 33 ms returned sat
[2023-03-14 10:46:39] [INFO ] [Nat]Absence check using 30 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-14 10:46:39] [INFO ] After 465ms SMT Verify possible using state equation in natural domain returned unsat :19 sat :5
[2023-03-14 10:46:39] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 6 ms to minimize.
[2023-03-14 10:46:40] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 1 ms to minimize.
[2023-03-14 10:46:40] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 2 ms to minimize.
[2023-03-14 10:46:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 672 ms
[2023-03-14 10:46:40] [INFO ] After 1411ms SMT Verify possible using trap constraints in natural domain returned unsat :19 sat :5
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-14 10:46:40] [INFO ] After 2175ms SMT Verify possible using all constraints in natural domain returned unsat :19 sat :5
Fused 24 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 17 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 478/478 transitions.
Graph (complete) has 957 edges and 512 vertex of which 500 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 178 rules applied. Total rules applied 179 place count 500 transition count 300
Reduce places removed 173 places and 0 transitions.
Graph (complete) has 569 edges and 327 vertex of which 294 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 0 output transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 179 rules applied. Total rules applied 358 place count 294 transition count 295
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 396 place count 289 transition count 262
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 403 place count 282 transition count 255
Iterating global reduction 3 with 7 rules applied. Total rules applied 410 place count 282 transition count 255
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 413 place count 282 transition count 252
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 496 edges and 279 vertex of which 273 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 417 place count 273 transition count 252
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 423 place count 273 transition count 246
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 427 place count 269 transition count 242
Iterating global reduction 6 with 4 rules applied. Total rules applied 431 place count 269 transition count 242
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 450 place count 269 transition count 223
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 469 place count 250 transition count 223
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 486 place count 233 transition count 206
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 7 with 17 rules applied. Total rules applied 503 place count 229 transition count 193
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 516 place count 216 transition count 193
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 23 Pre rules applied. Total rules applied 516 place count 216 transition count 170
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 562 place count 193 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 566 place count 191 transition count 168
Applied a total of 566 rules in 123 ms. Remains 191 /512 variables (removed 321) and now considering 168/478 (removed 310) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 191/512 places, 168/478 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 168 rows 191 cols
[2023-03-14 10:46:41] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-14 10:46:41] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:46:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-14 10:46:41] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 33 ms returned sat
[2023-03-14 10:46:41] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:46:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 10:46:41] [INFO ] After 27ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:46:41] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-14 10:46:41] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 168/168 transitions.
Graph (complete) has 343 edges and 191 vertex of which 179 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 179 transition count 140
Reduce places removed 28 places and 0 transitions.
Graph (complete) has 204 edges and 151 vertex of which 137 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 1 with 80 rules applied. Total rules applied 108 place count 137 transition count 80
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 58 rules applied. Total rules applied 166 place count 86 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 168 place count 84 transition count 73
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 168 place count 84 transition count 56
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 35 rules applied. Total rules applied 203 place count 66 transition count 56
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 65 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 204 place count 65 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 64 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 208 place count 63 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 61 transition count 52
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 5 with 10 rules applied. Total rules applied 220 place count 59 transition count 44
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 228 place count 51 transition count 44
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 228 place count 51 transition count 38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 240 place count 45 transition count 38
Applied a total of 240 rules in 29 ms. Remains 45 /191 variables (removed 146) and now considering 38/168 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 45/191 places, 38/168 transitions.
Incomplete random walk after 10000 steps, including 256 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 704 steps, run visited all 1 properties in 12 ms. (steps per millisecond=58 )
Probabilistic random walk after 704 steps, saw 262 distinct states, run finished after 12 ms. (steps per millisecond=58 ) properties seen :1
Successfully simplified 19 atomic propositions for a total of 16 simplifications.
[2023-03-14 10:46:41] [INFO ] Flatten gal took : 43 ms
[2023-03-14 10:46:41] [INFO ] Flatten gal took : 36 ms
[2023-03-14 10:46:42] [INFO ] Input system was already deterministic with 478 transitions.
Support contains 128 out of 512 places (down from 134) after GAL structural reductions.
FORMULA HirschbergSinclair-PT-20-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 512 stabilizing places and 478 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 512 transition count 478
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA HirschbergSinclair-PT-20-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 503 transition count 478
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 26 place count 486 transition count 461
Iterating global reduction 1 with 17 rules applied. Total rules applied 43 place count 486 transition count 461
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 472 transition count 447
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 472 transition count 447
Applied a total of 71 rules in 65 ms. Remains 472 /512 variables (removed 40) and now considering 447/478 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 472/512 places, 447/478 transitions.
[2023-03-14 10:46:42] [INFO ] Flatten gal took : 28 ms
[2023-03-14 10:46:42] [INFO ] Flatten gal took : 29 ms
[2023-03-14 10:46:42] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 503 transition count 478
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 27 place count 485 transition count 460
Iterating global reduction 1 with 18 rules applied. Total rules applied 45 place count 485 transition count 460
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 470 transition count 445
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 470 transition count 445
Applied a total of 75 rules in 58 ms. Remains 470 /512 variables (removed 42) and now considering 445/478 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 470/512 places, 445/478 transitions.
[2023-03-14 10:46:42] [INFO ] Flatten gal took : 25 ms
[2023-03-14 10:46:42] [INFO ] Flatten gal took : 23 ms
[2023-03-14 10:46:42] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Graph (complete) has 957 edges and 512 vertex of which 503 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 19 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 191 place count 484 transition count 269
Reduce places removed 190 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 198 rules applied. Total rules applied 389 place count 294 transition count 261
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 397 place count 286 transition count 261
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 412 place count 271 transition count 246
Iterating global reduction 3 with 15 rules applied. Total rules applied 427 place count 271 transition count 246
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 429 place count 271 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 431 place count 269 transition count 244
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 433 place count 268 transition count 243
Applied a total of 433 rules in 92 ms. Remains 268 /512 variables (removed 244) and now considering 243/478 (removed 235) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 93 ms. Remains : 268/512 places, 243/478 transitions.
[2023-03-14 10:46:42] [INFO ] Flatten gal took : 10 ms
[2023-03-14 10:46:42] [INFO ] Flatten gal took : 12 ms
[2023-03-14 10:46:42] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 503 transition count 478
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 24 place count 488 transition count 463
Iterating global reduction 1 with 15 rules applied. Total rules applied 39 place count 488 transition count 463
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 476 transition count 451
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 476 transition count 451
Applied a total of 63 rules in 283 ms. Remains 476 /512 variables (removed 36) and now considering 451/478 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 476/512 places, 451/478 transitions.
[2023-03-14 10:46:42] [INFO ] Flatten gal took : 22 ms
[2023-03-14 10:46:42] [INFO ] Flatten gal took : 26 ms
[2023-03-14 10:46:42] [INFO ] Input system was already deterministic with 451 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 503 transition count 478
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 27 place count 485 transition count 460
Iterating global reduction 1 with 18 rules applied. Total rules applied 45 place count 485 transition count 460
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 471 transition count 446
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 471 transition count 446
Applied a total of 73 rules in 56 ms. Remains 471 /512 variables (removed 41) and now considering 446/478 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 471/512 places, 446/478 transitions.
[2023-03-14 10:46:43] [INFO ] Flatten gal took : 23 ms
[2023-03-14 10:46:43] [INFO ] Flatten gal took : 25 ms
[2023-03-14 10:46:43] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Graph (complete) has 957 edges and 512 vertex of which 503 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 20 places and 20 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 483 transition count 259
Reduce places removed 199 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 202 rules applied. Total rules applied 402 place count 284 transition count 256
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 405 place count 281 transition count 256
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 422 place count 264 transition count 239
Iterating global reduction 3 with 17 rules applied. Total rules applied 439 place count 264 transition count 239
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 442 place count 264 transition count 236
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 445 place count 261 transition count 236
Applied a total of 445 rules in 44 ms. Remains 261 /512 variables (removed 251) and now considering 236/478 (removed 242) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 261/512 places, 236/478 transitions.
[2023-03-14 10:46:43] [INFO ] Flatten gal took : 10 ms
[2023-03-14 10:46:43] [INFO ] Flatten gal took : 12 ms
[2023-03-14 10:46:43] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Graph (complete) has 957 edges and 512 vertex of which 503 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 20 places and 20 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 205 place count 483 transition count 254
Reduce places removed 204 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 206 rules applied. Total rules applied 411 place count 279 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 413 place count 277 transition count 252
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 431 place count 259 transition count 234
Iterating global reduction 3 with 18 rules applied. Total rules applied 449 place count 259 transition count 234
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 452 place count 259 transition count 231
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 455 place count 256 transition count 231
Applied a total of 455 rules in 35 ms. Remains 256 /512 variables (removed 256) and now considering 231/478 (removed 247) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 256/512 places, 231/478 transitions.
[2023-03-14 10:46:43] [INFO ] Flatten gal took : 9 ms
[2023-03-14 10:46:43] [INFO ] Flatten gal took : 11 ms
[2023-03-14 10:46:43] [INFO ] Input system was already deterministic with 231 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 503 transition count 478
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 26 place count 486 transition count 461
Iterating global reduction 1 with 17 rules applied. Total rules applied 43 place count 486 transition count 461
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 471 transition count 446
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 471 transition count 446
Applied a total of 73 rules in 265 ms. Remains 471 /512 variables (removed 41) and now considering 446/478 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 471/512 places, 446/478 transitions.
[2023-03-14 10:46:43] [INFO ] Flatten gal took : 19 ms
[2023-03-14 10:46:43] [INFO ] Flatten gal took : 19 ms
[2023-03-14 10:46:43] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 504 transition count 478
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 23 place count 489 transition count 463
Iterating global reduction 1 with 15 rules applied. Total rules applied 38 place count 489 transition count 463
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 477 transition count 451
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 477 transition count 451
Applied a total of 62 rules in 261 ms. Remains 477 /512 variables (removed 35) and now considering 451/478 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 477/512 places, 451/478 transitions.
[2023-03-14 10:46:43] [INFO ] Flatten gal took : 19 ms
[2023-03-14 10:46:43] [INFO ] Flatten gal took : 19 ms
[2023-03-14 10:46:44] [INFO ] Input system was already deterministic with 451 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Graph (complete) has 957 edges and 512 vertex of which 503 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 20 places and 20 transitions.
Drop transitions removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 212 place count 483 transition count 247
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 423 place count 272 transition count 247
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 441 place count 254 transition count 229
Iterating global reduction 2 with 18 rules applied. Total rules applied 459 place count 254 transition count 229
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 462 place count 254 transition count 226
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 465 place count 251 transition count 226
Applied a total of 465 rules in 31 ms. Remains 251 /512 variables (removed 261) and now considering 226/478 (removed 252) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 251/512 places, 226/478 transitions.
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 8 ms
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 9 ms
[2023-03-14 10:46:44] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 506 transition count 478
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 21 place count 491 transition count 463
Iterating global reduction 1 with 15 rules applied. Total rules applied 36 place count 491 transition count 463
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 480 transition count 452
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 480 transition count 452
Applied a total of 58 rules in 64 ms. Remains 480 /512 variables (removed 32) and now considering 452/478 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 480/512 places, 452/478 transitions.
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 17 ms
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 18 ms
[2023-03-14 10:46:44] [INFO ] Input system was already deterministic with 452 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 503 transition count 478
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 27 place count 485 transition count 460
Iterating global reduction 1 with 18 rules applied. Total rules applied 45 place count 485 transition count 460
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 470 transition count 445
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 470 transition count 445
Applied a total of 75 rules in 48 ms. Remains 470 /512 variables (removed 42) and now considering 445/478 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 470/512 places, 445/478 transitions.
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 17 ms
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 18 ms
[2023-03-14 10:46:44] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 503 transition count 478
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 25 place count 487 transition count 462
Iterating global reduction 1 with 16 rules applied. Total rules applied 41 place count 487 transition count 462
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 475 transition count 450
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 475 transition count 450
Applied a total of 65 rules in 55 ms. Remains 475 /512 variables (removed 37) and now considering 450/478 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 475/512 places, 450/478 transitions.
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 18 ms
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 19 ms
[2023-03-14 10:46:44] [INFO ] Input system was already deterministic with 450 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 478/478 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 504 transition count 478
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 23 place count 489 transition count 463
Iterating global reduction 1 with 15 rules applied. Total rules applied 38 place count 489 transition count 463
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 51 place count 476 transition count 450
Iterating global reduction 1 with 13 rules applied. Total rules applied 64 place count 476 transition count 450
Applied a total of 64 rules in 47 ms. Remains 476 /512 variables (removed 36) and now considering 450/478 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 476/512 places, 450/478 transitions.
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 15 ms
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 16 ms
[2023-03-14 10:46:44] [INFO ] Input system was already deterministic with 450 transitions.
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 17 ms
[2023-03-14 10:46:44] [INFO ] Flatten gal took : 32 ms
[2023-03-14 10:46:44] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-14 10:46:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 512 places, 478 transitions and 1433 arcs took 4 ms.
Total runtime 11500 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: 512 NrTr: 478 NrArc: 1433)

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

net check time: 0m 0.001sec

init dd package: 0m 3.501sec


RS generation: 0m56.513sec


-> reachability set: #nodes 284479 (2.8e+05) #states 1,766,131,231,486,541,828,867,991 (24)



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

checking: AX [AG [EF [AG [p264<=p134]]]]
normalized: ~ [EX [E [true U ~ [E [true U ~ [E [true U ~ [p264<=p134]]]]]]]]

abstracting: (p264<=p134)
states: 1,762,918,113,731,776,673,455,063 (24)
.-> the formula is TRUE

FORMULA HirschbergSinclair-PT-20-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 0.682sec

checking: EF [EG [[p208<=0 | AG [1<=p510]]]]
normalized: E [true U EG [[p208<=0 | ~ [E [true U ~ [1<=p510]]]]]]

abstracting: (1<=p510)
states: 37,915,717,156,208,640 (16)
abstracting: (p208<=0)
states: 1,763,119,404,741,795,823,388,327 (24)

before gc: list nodes free: 1376445

after gc: idd nodes used:740281, unused:63259719; list nodes free:269489180
....................
before gc: list nodes free: 1268659

after gc: idd nodes used:742728, unused:63257272; list nodes free:284088597
..
before gc: list nodes free: 2452883

after gc: idd nodes used:1256570, unused:62743430; list nodes free:281855421
MC time: 4m19.101sec

checking: [AX [AF [~ [p286<=0]]] & EF [[1<=p162 | [1<=p336 & p5<=0]]]]
normalized: [E [true U [1<=p162 | [1<=p336 & p5<=0]]] & ~ [EX [EG [p286<=0]]]]

abstracting: (p286<=0)
states: 1,746,074,291,969,420,237,807,415 (24)
.........................
before gc: list nodes free: 751781

after gc: idd nodes used:1133778, unused:62866222; list nodes free:284554913
....
before gc: list nodes free: 1902422

after gc: idd nodes used:1251273, unused:62748727; list nodes free:284039805
MC time: 3m59.171sec

checking: [[[~ [A [~ [p366<=p485] U EF [1<=p347]]] | EX [~ [1<=p389]]] & AG [~ [1<=p389]]] & EX [0<=0]]
normalized: [EX [0<=0] & [~ [E [true U 1<=p389]] & [EX [~ [1<=p389]] | ~ [[~ [EG [~ [E [true U 1<=p347]]]] & ~ [E [~ [E [true U 1<=p347]] U [p366<=p485 & ~ [E [true U 1<=p347]]]]]]]]]]

abstracting: (1<=p347)
states: 9,859,384,551,005,598,582,272 (21)
abstracting: (p366<=p485)
states: 1,756,693,743,222,912,443,101,591 (24)
abstracting: (1<=p347)
states: 9,859,384,551,005,598,582,272 (21)
abstracting: (1<=p347)
states: 9,859,384,551,005,598,582,272 (21)
.
EG iterations: 1
abstracting: (1<=p389)
states: 19,729,430,488,141,965,098,432 (22)
.abstracting: (1<=p389)
states: 19,729,430,488,141,965,098,432 (22)
abstracting: (0<=0)
states: 1,766,131,231,486,541,828,867,991 (24)
.-> the formula is FALSE

FORMULA HirschbergSinclair-PT-20-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m28.634sec

checking: [EF [AG [p304<=p374]] & EF [EG [[EG [~ [p151<=0]] | [~ [1<=p216] | ~ [p404<=p468]]]]]]
normalized: [E [true U EG [[[~ [p404<=p468] | ~ [1<=p216]] | EG [~ [p151<=0]]]]] & E [true U ~ [E [true U ~ [p304<=p374]]]]]

abstracting: (p304<=p374)
states: 1,746,369,745,358,955,362,923,831 (24)
abstracting: (p151<=0)
states: 1,538,069,135,514,407,122,934,518 (24)

before gc: list nodes free: 15268571

after gc: idd nodes used:1022104, unused:62977896; list nodes free:284971428
..............MC time: 3m47.023sec

checking: AF [[[AX [1<=p18] & A [p508<=p280 U p74<=p464]] & [AF [~ [1<=p479]] & EG [[~ [p326<=0] | ~ [p175<=0]]]]]]
normalized: ~ [EG [~ [[[EG [[~ [p175<=0] | ~ [p326<=0]]] & ~ [EG [1<=p479]]] & [[~ [EG [~ [p74<=p464]]] & ~ [E [~ [p74<=p464] U [~ [p508<=p280] & ~ [p74<=p464]]]]] & ~ [EX [~ [1<=p18]]]]]]]]

abstracting: (1<=p18)
states: 3,953,545,060,791,171,707,847 (21)

before gc: list nodes free: 12008022

after gc: idd nodes used:795611, unused:63204389; list nodes free:286045086
.abstracting: (p74<=p464)
states: 1,039,202,685,798,337,665,326,023 (24)
abstracting: (p508<=p280)
states: 1,766,131,056,634,149,764,745,111 (24)
abstracting: (p74<=p464)
states: 1,039,202,685,798,337,665,326,023 (24)
abstracting: (p74<=p464)
states: 1,039,202,685,798,337,665,326,023 (24)
....MC time: 3m28.001sec

checking: AX [[EG [[p49<=p96 | [p421<=0 | 1<=p371]]] | AF [~ [E [[p0<=0 & p444<=p69] U ~ [1<=p129]]]]]]
normalized: ~ [EX [~ [[~ [EG [E [[p0<=0 & p444<=p69] U ~ [1<=p129]]]] | EG [[p49<=p96 | [p421<=0 | 1<=p371]]]]]]]

abstracting: (1<=p371)
states: 19,729,430,488,141,965,098,432 (22)
abstracting: (p421<=0)
states: 1,759,936,726,966,649,801,398,679 (24)
abstracting: (p49<=p96)
states: 1,533,690,677,216,731,929,679,993 (24)

before gc: list nodes free: 16039053

after gc: idd nodes used:1380741, unused:62619259; list nodes free:283592143
.
EG iterations: 1
abstracting: (1<=p129)
states: 433,926,981,908,216,285,700,823 (23)
abstracting: (p444<=p69)
states: 1,756,180,459,701,785,423,916,183 (24)
abstracting: (p0<=0)
states: 1,766,063,508,389,037,861,323,309 (24)
.
EG iterations: 1
MC time: 3m10.001sec

checking: E [1<=p274 U E [EF [[1<=p266 & AG [p286<=p187]]] U A [p42<=p186 U A [p53<=p417 U [p476<=1 & 1<=p298]]]]]
normalized: E [1<=p274 U E [E [true U [1<=p266 & ~ [E [true U ~ [p286<=p187]]]]] U [~ [EG [~ [[~ [EG [~ [[p476<=1 & 1<=p298]]]] & ~ [E [~ [[p476<=1 & 1<=p298]] U [~ [p53<=p417] & ~ [[p476<=1 & 1<=p298]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p476<=1 & 1<=p298]]]] & ~ [E [~ [[p476<=1 & 1<=p298]] U [~ [p53<=p417] & ~ [[p476<=1 & 1<=p298]]]]]]] U [~ [p42<=p186] & ~ [[~ [EG [~ [[p476<=1 & 1<=p298]]]] & ~ [E [~ [[p476<=1 & 1<=p298]] U [~ [p53<=p417] & ~ [[p476<=1 & 1<=p298]]]]]]]]]]]]]

abstracting: (1<=p298)
states: 20,056,939,517,121,591,060,576 (22)
abstracting: (p476<=1)
states: 1,766,131,231,486,541,828,867,991 (24)
abstracting: (p53<=p417)
states: 1,528,746,155,072,528,508,048,606 (24)
abstracting: (1<=p298)
states: 20,056,939,517,121,591,060,576 (22)
abstracting: (p476<=1)
states: 1,766,131,231,486,541,828,867,991 (24)
abstracting: (1<=p298)
states: 20,056,939,517,121,591,060,576 (22)
abstracting: (p476<=1)
states: 1,766,131,231,486,541,828,867,991 (24)
....
before gc: list nodes free: 14676056

after gc: idd nodes used:2150258, unused:61849742; list nodes free:280334986
MC time: 2m54.157sec

checking: AG [[[[[[~ [p423<=p449] | ~ [1<=p420]] & ~ [p341<=p45]] & ~ [p128<=p338]] | AF [1<=p172]] | [EX [p485<=p465] | AG [~ [1<=p215]]]]]
normalized: ~ [E [true U ~ [[[~ [E [true U 1<=p215]] | EX [p485<=p465]] | [~ [EG [~ [1<=p172]]] | [~ [p128<=p338] & [~ [p341<=p45] & [~ [1<=p420] | ~ [p423<=p449]]]]]]]]]

abstracting: (p423<=p449)
states: 1,759,924,770,422,193,571,203,479 (24)
abstracting: (1<=p420)
states: 13,022,846,180,582,875,870,720 (22)
abstracting: (p341<=p45)
states: 1,758,612,882,592,876,188,206,423 (24)
abstracting: (p128<=p338)
states: 1,357,473,405,166,879,806,925,545 (24)
abstracting: (1<=p172)
states: 3,437,093,391,872,318,742,696 (21)
....................
before gc: list nodes free: 5014599

after gc: idd nodes used:2414957, unused:61585043; list nodes free:279116526
MC time: 2m40.045sec

checking: A [[[~ [A [[1<=p301 | p343<=p285] U p12<=p319]] | AX [1<=p163]] | [E [p135<=p481 U AF [[p436<=0 | 1<=p63]]] | [1<=p373 | 1<=p112]]] U ~ [p259<=0]]
normalized: [~ [EG [p259<=0]] & ~ [E [p259<=0 U [p259<=0 & ~ [[[[1<=p373 | 1<=p112] | E [p135<=p481 U ~ [EG [~ [[p436<=0 | 1<=p63]]]]]] | [~ [EX [~ [1<=p163]]] | ~ [[~ [EG [~ [p12<=p319]]] & ~ [E [~ [p12<=p319] U [~ [[1<=p301 | p343<=p285]] & ~ [p12<=p319]]]]]]]]]]]]]

abstracting: (p12<=p319)
states: 1,763,743,072,838,733,233,123,923 (24)
abstracting: (p343<=p285)
states: 1,756,430,571,430,792,984,596,759 (24)
abstracting: (1<=p301)
states: 10,198,141,121,154,819,959,424 (22)
abstracting: (p12<=p319)
states: 1,763,743,072,838,733,233,123,923 (24)
abstracting: (p12<=p319)
states: 1,763,743,072,838,733,233,123,923 (24)
............................
before gc: list nodes free: 14770388

after gc: idd nodes used:2778622, unused:61221378; list nodes free:277653414
MC time: 2m27.218sec

checking: EG [[EX [p341<=p408] & [EF [[[EX [1<=p297] & ~ [1<=p154]] | EG [1<=p61]]] | [AF [~ [1<=p63]] & [[~ [p486<=1] | [~ [p314<=p9] | ~ [p385<=1]]] & [EX [p488<=0] | [EG [1<=p277] | [p342<=p113 & p41<=0]]]]]]]]
normalized: EG [[[[[[[[p342<=p113 & p41<=0] | EG [1<=p277]] | EX [p488<=0]] & [[~ [p385<=1] | ~ [p314<=p9]] | ~ [p486<=1]]] & ~ [EG [1<=p63]]] | E [true U [EG [1<=p61] | [~ [1<=p154] & EX [1<=p297]]]]] & EX [p341<=p408]]]

abstracting: (p341<=p408)
states: 1,756,566,260,995,805,256,501,527 (24)
.abstracting: (1<=p297)
states: 9,530,313,013,750,843,682,880 (21)
.abstracting: (1<=p154)
states: 668,888,075,506,202,686,219,038 (23)
abstracting: (1<=p61)
states: 462,733,939,736,773,377,582,851 (23)
MC time: 2m14.014sec

checking: [EX [[EG [AX [AX [1<=p390]]] | [~ [p503<=0] & [p121<=p193 & p484<=1]]]] | [AX [E [AG [p505<=0] U 1<=p353]] | [A [p165<=p27 U [1<=p128 | EF [1<=p337]]] & AX [A [p374<=p402 U E [p105<=0 U 1<=p163]]]]]]
normalized: [[[~ [EX [~ [[~ [EG [~ [E [p105<=0 U 1<=p163]]]] & ~ [E [~ [E [p105<=0 U 1<=p163]] U [~ [p374<=p402] & ~ [E [p105<=0 U 1<=p163]]]]]]]]] & [~ [EG [~ [[1<=p128 | E [true U 1<=p337]]]]] & ~ [E [~ [[1<=p128 | E [true U 1<=p337]]] U [~ [p165<=p27] & ~ [[1<=p128 | E [true U 1<=p337]]]]]]]] | ~ [EX [~ [E [~ [E [true U ~ [p505<=0]]] U 1<=p353]]]]] | EX [[[[p121<=p193 & p484<=1] & ~ [p503<=0]] | EG [~ [EX [EX [~ [1<=p390]]]]]]]]

abstracting: (1<=p390)
states: 10,042,571,549,118,256,227,008 (22)

before gc: list nodes free: 17385348

after gc: idd nodes used:2596150, unused:61403850; list nodes free:278374149
....
EG iterations: 2
abstracting: (p503<=0)
states: 1,766,124,533,548,860,548,794,263 (24)
abstracting: (p484<=1)
states: 1,766,131,231,486,541,828,867,991 (24)
abstracting: (p121<=p193)
states: 1,354,853,549,514,742,438,908,544 (24)
.abstracting: (1<=p353)
states: 19,864,397,057,817,020,308,864 (22)
abstracting: (p505<=0)
states: 1,766,129,587,830,068,008,667,031 (24)
MC time: 2m 3.005sec

checking: [[~ [E [E [AF [p138<=0] U 1<=p68] U A [AG [p325<=p461] U EF [1<=p240]]]] & AG [~ [p272<=p298]]] | EG [[[[AF [p490<=p415] | A [p213<=p429 U 1<=p137]] | p458<=p474] & p78<=p356]]]
normalized: [EG [[p78<=p356 & [p458<=p474 | [[~ [EG [~ [1<=p137]]] & ~ [E [~ [1<=p137] U [~ [p213<=p429] & ~ [1<=p137]]]]] | ~ [EG [~ [p490<=p415]]]]]]] | [~ [E [true U p272<=p298]] & ~ [E [E [~ [EG [~ [p138<=0]]] U 1<=p68] U [~ [EG [~ [E [true U 1<=p240]]]] & ~ [E [~ [E [true U 1<=p240]] U [E [true U ~ [p325<=p461]] & ~ [E [true U 1<=p240]]]]]]]]]]

abstracting: (1<=p240)
states: 10,666,906,448,309,272,385,856 (22)
abstracting: (p325<=p461)
states: 1,756,646,596,148,689,652,510,487 (24)
abstracting: (1<=p240)
states: 10,666,906,448,309,272,385,856 (22)
abstracting: (1<=p240)
states: 10,666,906,448,309,272,385,856 (22)
MC time: 1m53.023sec

checking: E [[EX [[E [[p197<=p242 | 1<=p53] U ~ [p240<=p40]] | p71<=p120]] | ~ [[A [[AX [p227<=p20] & AX [p199<=0]] U [[1<=p293 | p221<=p359] & [1<=p225 | 1<=p5]]] | E [EG [1<=p78] U E [p147<=p240 U 1<=p127]]]]] U [1<=p437 & EF [[1<=p95 & [p183<=p191 & [p182<=p78 | p433<=1]]]]]]
normalized: E [[~ [[E [EG [1<=p78] U E [p147<=p240 U 1<=p127]] | [~ [EG [~ [[[1<=p225 | 1<=p5] & [1<=p293 | p221<=p359]]]]] & ~ [E [~ [[[1<=p225 | 1<=p5] & [1<=p293 | p221<=p359]]] U [~ [[~ [EX [~ [p199<=0]]] & ~ [EX [~ [p227<=p20]]]]] & ~ [[[1<=p225 | 1<=p5] & [1<=p293 | p221<=p359]]]]]]]]] | EX [[p71<=p120 | E [[p197<=p242 | 1<=p53] U ~ [p240<=p40]]]]] U [1<=p437 & E [true U [1<=p95 & [p183<=p191 & [p182<=p78 | p433<=1]]]]]]

abstracting: (p433<=1)
states: 1,766,131,231,486,541,828,867,991 (24)
abstracting: (p182<=p78)
states: 1,765,011,844,143,379,628,308,239 (24)
abstracting: (p183<=p191)
states: 1,762,894,829,292,833,477,166,975 (24)
abstracting: (1<=p95)
states: 431,021,233,688,049,618,300,664 (23)
abstracting: (1<=p437)
states: 6,876,436,274,607,511,740,800 (21)
abstracting: (p240<=p40)
states: 1,755,464,325,038,232,556,482,135 (24)
abstracting: (1<=p53)
states: 238,223,120,101,152,919,720,889 (23)
abstracting: (p197<=p242)
states: 1,762,768,150,592,474,452,820,871 (24)
abstracting: (p71<=p120)
states: 1,621,932,848,434,418,657,487,584 (24)

before gc: list nodes free: 17867123

after gc: idd nodes used:3525849, unused:60474151; list nodes free:274480329
MC time: 1m44.043sec

checking: EF [EG [[p208<=0 | AG [1<=p510]]]]
normalized: E [true U EG [[p208<=0 | ~ [E [true U ~ [1<=p510]]]]]]

abstracting: (1<=p510)
states: 37,915,717,156,208,640 (16)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6114556 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095928 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 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.002sec


iterations count:34006 (71), effective:1014 (2)

initing FirstDep: 0m 0.002sec


iterations count:3974 (8), effective:167 (0)

iterations count:3900 (8), effective:163 (0)

iterations count:991 (2), effective:4 (0)

net_ddint.h:600: Timeout: after 258 sec


net_ddint.h:600: Timeout: after 238 sec


iterations count:9707 (20), effective:445 (0)

iterations count:9707 (20), effective:445 (0)

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

iterations count:9707 (20), effective:445 (0)

iterations count:8831 (18), effective:412 (0)

iterations count:6610 (13), effective:323 (0)

iterations count:7194 (15), effective:329 (0)

net_ddint.h:600: Timeout: after 226 sec


iterations count:20579 (43), effective:859 (1)

net_ddint.h:600: Timeout: after 207 sec


iterations count:743 (1), effective:12 (0)

net_ddint.h:600: Timeout: after 189 sec


iterations count:718 (1), effective:15 (0)

net_ddint.h:600: Timeout: after 173 sec


net_ddint.h:600: Timeout: after 159 sec


net_ddint.h:600: Timeout: after 146 sec


net_ddint.h:600: Timeout: after 133 sec


sat_reach.icc:155: Timeout: after 122 sec


iterations count:4181 (8), effective:183 (0)

iterations count:8466 (17), effective:379 (0)

iterations count:4181 (8), effective:183 (0)

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

iterations count:4181 (8), effective:183 (0)

net_ddint.h:600: Timeout: after 112 sec


iterations count:2281 (4), effective:41 (0)

iterations count:4259 (8), effective:188 (0)

net_ddint.h:600: Timeout: after 103 sec


iterations count:991 (2), effective:4 (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="HirschbergSinclair-PT-20"
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 HirschbergSinclair-PT-20, 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 r202-smll-167840348700449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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