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

About the Execution of Marcie+red for HealthRecord-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10310.392 1595796.00 1618840.00 4582.50 TTTTTTTTTTTTTTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r202-smll-167840348500297.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 HealthRecord-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348500297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 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 68K 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 HealthRecord-PT-09-CTLCardinality-00
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-01
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-02
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-03
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-04
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-05
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-06
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-07
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-08
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-09
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-10
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-11
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-12
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-13
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-14
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678691225325

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=HealthRecord-PT-09
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:07:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 07:07:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:07:08] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-13 07:07:08] [INFO ] Transformed 157 places.
[2023-03-13 07:07:08] [INFO ] Transformed 327 transitions.
[2023-03-13 07:07:08] [INFO ] Found NUPN structural information;
[2023-03-13 07:07:08] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-09-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 119 transition count 229
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 119 transition count 229
Applied a total of 76 rules in 33 ms. Remains 119 /157 variables (removed 38) and now considering 229/301 (removed 72) transitions.
[2023-03-13 07:07:09] [INFO ] Flow matrix only has 221 transitions (discarded 8 similar events)
// Phase 1: matrix 221 rows 119 cols
[2023-03-13 07:07:09] [INFO ] Computed 14 place invariants in 20 ms
[2023-03-13 07:07:09] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-13 07:07:09] [INFO ] Flow matrix only has 221 transitions (discarded 8 similar events)
[2023-03-13 07:07:09] [INFO ] Invariant cache hit.
[2023-03-13 07:07:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 07:07:09] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-03-13 07:07:09] [INFO ] Flow matrix only has 221 transitions (discarded 8 similar events)
[2023-03-13 07:07:09] [INFO ] Invariant cache hit.
[2023-03-13 07:07:10] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/157 places, 229/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1022 ms. Remains : 119/157 places, 229/301 transitions.
Support contains 76 out of 119 places after structural reductions.
[2023-03-13 07:07:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 07:07:10] [INFO ] Flatten gal took : 88 ms
[2023-03-13 07:07:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HealthRecord-PT-09-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 07:07:10] [INFO ] Flatten gal took : 49 ms
[2023-03-13 07:07:10] [INFO ] Input system was already deterministic with 229 transitions.
Support contains 66 out of 119 places (down from 76) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 591 resets, run finished after 1063 ms. (steps per millisecond=9 ) properties (out of 50) seen :28
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 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 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 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 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 8 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 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 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 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :1
Running SMT prover for 18 properties.
[2023-03-13 07:07:11] [INFO ] Flow matrix only has 221 transitions (discarded 8 similar events)
[2023-03-13 07:07:11] [INFO ] Invariant cache hit.
[2023-03-13 07:07:12] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-13 07:07:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-13 07:07:12] [INFO ] [Nat]Absence check using 6 positive and 8 generalized place invariants in 15 ms returned sat
[2023-03-13 07:07:12] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :17
[2023-03-13 07:07:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 07:07:13] [INFO ] After 265ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :17
[2023-03-13 07:07:13] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 9 ms to minimize.
[2023-03-13 07:07:13] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2023-03-13 07:07:13] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2023-03-13 07:07:13] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2023-03-13 07:07:13] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2023-03-13 07:07:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 544 ms
[2023-03-13 07:07:13] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2023-03-13 07:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-13 07:07:13] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-13 07:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-13 07:07:13] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2023-03-13 07:07:14] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2023-03-13 07:07:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2023-03-13 07:07:14] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2023-03-13 07:07:14] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2023-03-13 07:07:14] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2023-03-13 07:07:14] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2023-03-13 07:07:14] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2023-03-13 07:07:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 465 ms
[2023-03-13 07:07:14] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2023-03-13 07:07:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-13 07:07:14] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2023-03-13 07:07:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-13 07:07:14] [INFO ] After 2186ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :17
Attempting to minimize the solution found.
Minimization took 224 ms.
[2023-03-13 07:07:15] [INFO ] After 3035ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :17
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 25 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 229/229 transitions.
Graph (trivial) has 113 edges and 119 vertex of which 8 / 119 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 492 edges and 115 vertex of which 110 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 110 transition count 208
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 106 transition count 204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 106 transition count 201
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 101 transition count 201
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 52 place count 71 transition count 141
Iterating global reduction 2 with 30 rules applied. Total rules applied 82 place count 71 transition count 141
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 68 transition count 135
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 68 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 68 transition count 132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 66 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 66 transition count 129
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 102 place count 63 transition count 144
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 63 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 62 transition count 143
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 62 transition count 143
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 62 transition count 143
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 107 place count 62 transition count 142
Applied a total of 107 rules in 83 ms. Remains 62 /119 variables (removed 57) and now considering 142/229 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 62/119 places, 142/229 transitions.
Incomplete random walk after 10000 steps, including 1837 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 430 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 428 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 415 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 432 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 430 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 438 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 418 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 379 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-13 07:07:16] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
// Phase 1: matrix 138 rows 62 cols
[2023-03-13 07:07:16] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-13 07:07:16] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 07:07:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 07:07:16] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-13 07:07:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-13 07:07:16] [INFO ] After 66ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-13 07:07:17] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2023-03-13 07:07:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-13 07:07:17] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2023-03-13 07:07:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-13 07:07:17] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-13 07:07:17] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 14 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 142/142 transitions.
Graph (trivial) has 42 edges and 62 vertex of which 2 / 62 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 267 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 60 transition count 139
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 59 transition count 138
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 12 place count 52 transition count 123
Iterating global reduction 2 with 7 rules applied. Total rules applied 19 place count 52 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 25 place count 52 transition count 117
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 42 place count 52 transition count 117
Applied a total of 42 rules in 35 ms. Remains 52 /62 variables (removed 10) and now considering 117/142 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 52/62 places, 117/142 transitions.
Incomplete random walk after 10000 steps, including 1668 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 413 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 381 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 419 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 429 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 421 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 398 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 424 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 425 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 366 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Finished probabilistic random walk after 19290 steps, run visited all 11 properties in 152 ms. (steps per millisecond=126 )
Probabilistic random walk after 19290 steps, saw 4309 distinct states, run finished after 152 ms. (steps per millisecond=126 ) properties seen :11
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-13 07:07:18] [INFO ] Flatten gal took : 24 ms
[2023-03-13 07:07:18] [INFO ] Flatten gal took : 25 ms
[2023-03-13 07:07:18] [INFO ] Input system was already deterministic with 229 transitions.
Computed a total of 11 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 83 transition count 160
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 83 transition count 160
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 79 transition count 152
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 79 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 78 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 78 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 77 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 77 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 77 transition count 146
Applied a total of 85 rules in 12 ms. Remains 77 /119 variables (removed 42) and now considering 146/229 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 77/119 places, 146/229 transitions.
[2023-03-13 07:07:18] [INFO ] Flatten gal took : 11 ms
[2023-03-13 07:07:18] [INFO ] Flatten gal took : 11 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Graph (trivial) has 167 edges and 119 vertex of which 12 / 119 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 53 place count 60 transition count 123
Iterating global reduction 0 with 52 rules applied. Total rules applied 105 place count 60 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 108 place count 60 transition count 120
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 52 transition count 104
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 52 transition count 104
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 131 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 49 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 49 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 46 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 46 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 152 place count 46 transition count 73
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 157 place count 46 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 161 place count 44 transition count 66
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 41 transition count 63
Applied a total of 164 rules in 34 ms. Remains 41 /119 variables (removed 78) and now considering 63/229 (removed 166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 41/119 places, 63/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 78 transition count 149
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 78 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 75 transition count 143
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 75 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 75 transition count 141
Applied a total of 90 rules in 6 ms. Remains 75 /119 variables (removed 44) and now considering 141/229 (removed 88) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 75/119 places, 141/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 10 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 10 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 65 transition count 125
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 65 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 111 place count 65 transition count 122
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 59 transition count 110
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 59 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 59 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 57 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 57 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 55 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 55 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 143 place count 55 transition count 88
Applied a total of 143 rules in 10 ms. Remains 55 /119 variables (removed 64) and now considering 88/229 (removed 141) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 55/119 places, 88/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 62 transition count 120
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 62 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 117 place count 62 transition count 117
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 124 place count 55 transition count 103
Iterating global reduction 1 with 7 rules applied. Total rules applied 131 place count 55 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 137 place count 55 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 52 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 52 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 49 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 49 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 158 place count 49 transition count 73
Applied a total of 158 rules in 9 ms. Remains 49 /119 variables (removed 70) and now considering 73/229 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 49/119 places, 73/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 68 transition count 132
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 68 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 109 place count 61 transition count 118
Iterating global reduction 0 with 7 rules applied. Total rules applied 116 place count 61 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 120 place count 61 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 58 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 58 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 55 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 55 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 141 place count 55 transition count 90
Applied a total of 141 rules in 15 ms. Remains 55 /119 variables (removed 64) and now considering 90/229 (removed 139) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 55/119 places, 90/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Graph (trivial) has 159 edges and 119 vertex of which 10 / 119 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 63 transition count 128
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 63 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 103 place count 63 transition count 126
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 110 place count 56 transition count 112
Iterating global reduction 1 with 7 rules applied. Total rules applied 117 place count 56 transition count 112
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 124 place count 56 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 54 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 54 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 52 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 52 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 138 place count 52 transition count 89
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 52 transition count 85
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 3 with 2 rules applied. Total rules applied 144 place count 51 transition count 84
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 48 transition count 81
Applied a total of 147 rules in 23 ms. Remains 48 /119 variables (removed 71) and now considering 81/229 (removed 148) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 48/119 places, 81/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 67 transition count 130
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 67 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 106 place count 67 transition count 128
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 61 transition count 116
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 61 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 121 place count 61 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 59 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 59 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 57 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 57 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 135 place count 57 transition count 97
Applied a total of 135 rules in 5 ms. Remains 57 /119 variables (removed 62) and now considering 97/229 (removed 132) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 57/119 places, 97/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 62 transition count 120
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 62 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 117 place count 62 transition count 117
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 124 place count 55 transition count 103
Iterating global reduction 1 with 7 rules applied. Total rules applied 131 place count 55 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 137 place count 55 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 52 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 52 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 49 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 49 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 158 place count 49 transition count 73
Applied a total of 158 rules in 4 ms. Remains 49 /119 variables (removed 70) and now considering 73/229 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 49/119 places, 73/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 64 transition count 124
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 64 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 64 transition count 121
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 120 place count 57 transition count 107
Iterating global reduction 1 with 7 rules applied. Total rules applied 127 place count 57 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 57 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 55 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 55 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 53 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 53 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 147 place count 53 transition count 85
Applied a total of 147 rules in 5 ms. Remains 53 /119 variables (removed 66) and now considering 85/229 (removed 144) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 53/119 places, 85/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Graph (trivial) has 164 edges and 119 vertex of which 12 / 119 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 63 transition count 128
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 63 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 104 place count 63 transition count 125
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 55 transition count 109
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 55 transition count 109
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 127 place count 55 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 130 place count 52 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 52 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 49 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 49 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 148 place count 49 transition count 78
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 153 place count 49 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 163 place count 44 transition count 68
Applied a total of 163 rules in 16 ms. Remains 44 /119 variables (removed 75) and now considering 68/229 (removed 161) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 44/119 places, 68/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 67 transition count 130
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 67 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 67 transition count 127
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 114 place count 60 transition count 113
Iterating global reduction 1 with 7 rules applied. Total rules applied 121 place count 60 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 125 place count 60 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 57 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 57 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 54 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 54 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 145 place count 54 transition count 86
Applied a total of 145 rules in 4 ms. Remains 54 /119 variables (removed 65) and now considering 86/229 (removed 143) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 54/119 places, 86/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 229/229 transitions.
Graph (trivial) has 162 edges and 119 vertex of which 12 / 119 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 64 transition count 130
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 64 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 102 place count 64 transition count 127
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 56 transition count 111
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 56 transition count 111
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 125 place count 56 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 54 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 54 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 52 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 52 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 139 place count 52 transition count 88
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 144 place count 52 transition count 83
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 154 place count 47 transition count 78
Applied a total of 154 rules in 16 ms. Remains 47 /119 variables (removed 72) and now considering 78/229 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 47/119 places, 78/229 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:07:19] [INFO ] Input system was already deterministic with 78 transitions.
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 12 ms
[2023-03-13 07:07:19] [INFO ] Flatten gal took : 12 ms
[2023-03-13 07:07:19] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-13 07:07:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 119 places, 229 transitions and 653 arcs took 2 ms.
Total runtime 10966 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: 119 NrTr: 229 NrArc: 653)

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

net check time: 0m 0.000sec

init dd package: 0m 3.546sec


RS generation: 0m24.455sec


-> reachability set: #nodes 350334 (3.5e+05) #states 154,109,132 (8)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 154,109,132 (8)
.-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.387sec

checking: EF [EG [AG [[p114<=0 & 0<=p114]]]]
normalized: E [true U EG [~ [E [true U ~ [[p114<=0 & 0<=p114]]]]]]

abstracting: (0<=p114)
states: 154,109,132 (8)
abstracting: (p114<=0)
states: 146,813,708 (8)
.
EG iterations: 1

before gc: list nodes free: 1544058

after gc: idd nodes used:648532, unused:63351468; list nodes free:292874078
-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 4.794sec

checking: EG [EX [[p113<=0 & 0<=p113]]]
normalized: EG [EX [[p113<=0 & 0<=p113]]]

abstracting: (0<=p113)
states: 154,109,132 (8)
abstracting: (p113<=0)
states: 154,000,268 (8)
........
EG iterations: 7
-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.037sec

checking: EG [[[p21<=0 & 0<=p21] | [p79<=1 & 1<=p79]]]
normalized: EG [[[p79<=1 & 1<=p79] | [p21<=0 & 0<=p21]]]

abstracting: (0<=p21)
states: 154,109,132 (8)
abstracting: (p21<=0)
states: 145,521,932 (8)
abstracting: (1<=p79)
states: 15,296 (4)
abstracting: (p79<=1)
states: 154,109,132 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.618sec

checking: EF [AX [[EX [[[p8<=1 & 1<=p8] | [p58<=1 & 1<=p58]]] & [p14<=1 & 1<=p14]]]]
normalized: E [true U ~ [EX [~ [[[p14<=1 & 1<=p14] & EX [[[p58<=1 & 1<=p58] | [p8<=1 & 1<=p8]]]]]]]]

abstracting: (1<=p8)
states: 6,615,936 (6)
abstracting: (p8<=1)
states: 154,109,132 (8)
abstracting: (1<=p58)
states: 22,843,840 (7)
abstracting: (p58<=1)
states: 154,109,132 (8)
.abstracting: (1<=p14)
states: 17,912,640 (7)
abstracting: (p14<=1)
states: 154,109,132 (8)
.
before gc: list nodes free: 1295929

after gc: idd nodes used:733315, unused:63266685; list nodes free:294580877
-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m31.725sec

checking: AF [AG [A [[[p63<=0 & 0<=p63] | [p6<=1 & 1<=p6]] U [p107<=0 & 0<=p107]]]]
normalized: ~ [EG [E [true U ~ [[~ [EG [~ [[p107<=0 & 0<=p107]]]] & ~ [E [~ [[p107<=0 & 0<=p107]] U [~ [[[p6<=1 & 1<=p6] | [p63<=0 & 0<=p63]]] & ~ [[p107<=0 & 0<=p107]]]]]]]]]]

abstracting: (0<=p107)
states: 154,109,132 (8)
abstracting: (p107<=0)
states: 154,000,268 (8)
abstracting: (0<=p63)
states: 154,109,132 (8)
abstracting: (p63<=0)
states: 128,039,820 (8)
abstracting: (1<=p6)
states: 6,615,936 (6)
abstracting: (p6<=1)
states: 154,109,132 (8)
abstracting: (0<=p107)
states: 154,109,132 (8)
abstracting: (p107<=0)
states: 154,000,268 (8)
abstracting: (0<=p107)
states: 154,109,132 (8)
abstracting: (p107<=0)
states: 154,000,268 (8)
.....
EG iterations: 5
....
EG iterations: 4
-> the formula is FALSE

FORMULA HealthRecord-PT-09-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.280sec

checking: EF [AG [[AX [[p107<=0 & 0<=p107]] & ~ [A [[[p2<=0 & 0<=p2] | [p117<=1 & 1<=p117]] U [p92<=1 & 1<=p92]]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [[~ [EG [~ [[p92<=1 & 1<=p92]]]] & ~ [E [~ [[p92<=1 & 1<=p92]] U [~ [[[p117<=1 & 1<=p117] | [p2<=0 & 0<=p2]]] & ~ [[p92<=1 & 1<=p92]]]]]]] & ~ [EX [~ [[p107<=0 & 0<=p107]]]]]]]]]

abstracting: (0<=p107)
states: 154,109,132 (8)
abstracting: (p107<=0)
states: 154,000,268 (8)
.abstracting: (1<=p92)
states: 124,416 (5)
abstracting: (p92<=1)
states: 154,109,132 (8)
abstracting: (0<=p2)
states: 154,109,132 (8)
abstracting: (p2<=0)
states: 154,109,121 (8)
abstracting: (1<=p117)
states: 9,362,304 (6)
abstracting: (p117<=1)
states: 154,109,132 (8)
abstracting: (1<=p92)
states: 124,416 (5)
abstracting: (p92<=1)
states: 154,109,132 (8)
abstracting: (1<=p92)
states: 124,416 (5)
abstracting: (p92<=1)
states: 154,109,132 (8)
.
EG iterations: 1

before gc: list nodes free: 7239137

after gc: idd nodes used:1240283, unused:62759717; list nodes free:292368831
-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m43.926sec

checking: ~ [A [[A [[p92<=1 & 1<=p92] U [p60<=0 & 0<=p60]] | [[p111<=0 & 0<=p111] | [p31<=1 & 1<=p31]]] U AG [[p92<=1 & 1<=p92]]]]
normalized: ~ [[~ [EG [E [true U ~ [[p92<=1 & 1<=p92]]]]] & ~ [E [E [true U ~ [[p92<=1 & 1<=p92]]] U [~ [[[[p31<=1 & 1<=p31] | [p111<=0 & 0<=p111]] | [~ [EG [~ [[p60<=0 & 0<=p60]]]] & ~ [E [~ [[p60<=0 & 0<=p60]] U [~ [[p92<=1 & 1<=p92]] & ~ [[p60<=0 & 0<=p60]]]]]]]] & E [true U ~ [[p92<=1 & 1<=p92]]]]]]]]

abstracting: (1<=p92)
states: 124,416 (5)
abstracting: (p92<=1)
states: 154,109,132 (8)
abstracting: (0<=p60)
states: 154,109,132 (8)
abstracting: (p60<=0)
states: 127,632,844 (8)
abstracting: (1<=p92)
states: 124,416 (5)
abstracting: (p92<=1)
states: 154,109,132 (8)
abstracting: (0<=p60)
states: 154,109,132 (8)
abstracting: (p60<=0)
states: 127,632,844 (8)
abstracting: (0<=p60)
states: 154,109,132 (8)
abstracting: (p60<=0)
states: 127,632,844 (8)
.......
EG iterations: 7
abstracting: (0<=p111)
states: 154,109,132 (8)
abstracting: (p111<=0)
states: 154,109,131 (8)
abstracting: (1<=p31)
states: 11,092,224 (7)
abstracting: (p31<=1)
states: 154,109,132 (8)
abstracting: (1<=p92)
states: 124,416 (5)
abstracting: (p92<=1)
states: 154,109,132 (8)
abstracting: (1<=p92)
states: 124,416 (5)
abstracting: (p92<=1)
states: 154,109,132 (8)

EG iterations: 0
-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 0.772sec

checking: [EG [[p104<=0 & 0<=p104]] & E [[p20<=0 & 0<=p20] U ~ [[AG [[p11<=0 & 0<=p11]] & [EX [[p13<=1 & 1<=p13]] & AX [EG [[p70<=1 & 1<=p70]]]]]]]]
normalized: [E [[p20<=0 & 0<=p20] U ~ [[[~ [EX [~ [EG [[p70<=1 & 1<=p70]]]]] & EX [[p13<=1 & 1<=p13]]] & ~ [E [true U ~ [[p11<=0 & 0<=p11]]]]]]] & EG [[p104<=0 & 0<=p104]]]

abstracting: (0<=p104)
states: 154,109,132 (8)
abstracting: (p104<=0)
states: 152,099,468 (8)

before gc: list nodes free: 8511412

after gc: idd nodes used:1520908, unused:62479092; list nodes free:291157063
...
EG iterations: 3
abstracting: (0<=p11)
states: 154,109,132 (8)
abstracting: (p11<=0)
states: 142,506,572 (8)
abstracting: (1<=p13)
states: 12,081,408 (7)
abstracting: (p13<=1)
states: 154,109,132 (8)
.abstracting: (1<=p70)
states: 5,538,624 (6)
abstracting: (p70<=1)
states: 154,109,132 (8)
........
EG iterations: 8
.abstracting: (0<=p20)
states: 154,109,132 (8)
abstracting: (p20<=0)
states: 140,393,228 (8)
-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m26.743sec

checking: EF [[AG [[EG [[p21<=0 & 0<=p21]] & [AX [[p82<=1 & 1<=p82]] & EG [[[p116<=0 & 0<=p116] | [p4<=1 & 1<=p4]]]]]] & [[p49<=0 & 0<=p49] | [[p32<=0 & 0<=p32] & [p111<=1 & 1<=p111]]]]]
normalized: E [true U [[[[p111<=1 & 1<=p111] & [p32<=0 & 0<=p32]] | [p49<=0 & 0<=p49]] & ~ [E [true U ~ [[[EG [[[p4<=1 & 1<=p4] | [p116<=0 & 0<=p116]]] & ~ [EX [~ [[p82<=1 & 1<=p82]]]]] & EG [[p21<=0 & 0<=p21]]]]]]]]

abstracting: (0<=p21)
states: 154,109,132 (8)
abstracting: (p21<=0)
states: 145,521,932 (8)
.
EG iterations: 1
abstracting: (1<=p82)
states: 6,401,088 (6)
abstracting: (p82<=1)
states: 154,109,132 (8)

before gc: list nodes free: 1337713

after gc: idd nodes used:2050992, unused:61949008; list nodes free:296843085
.abstracting: (0<=p116)
states: 154,109,132 (8)
abstracting: (p116<=0)
states: 145,770,764 (8)
abstracting: (1<=p4)
states: 11,284,608 (7)
abstracting: (p4<=1)
states: 154,109,132 (8)
.
EG iterations: 1
abstracting: (0<=p49)
states: 154,109,132 (8)
abstracting: (p49<=0)
states: 115,581,852 (8)
abstracting: (0<=p32)
states: 154,109,132 (8)
abstracting: (p32<=0)
states: 143,016,908 (8)
abstracting: (1<=p111)
states: 1
abstracting: (p111<=1)
states: 154,109,132 (8)
-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m29.095sec

checking: EX [[A [[p56<=1 & 1<=p56] U E [EX [[[p46<=0 & 0<=p46] | [p18<=1 & 1<=p18]]] U AF [[p74<=0 & 0<=p74]]]] | EX [[[[p65<=0 & 0<=p65] & [p69<=0 & 0<=p69]] | AG [[[p102<=0 & 0<=p102] | [p41<=1 & 1<=p41]]]]]]]
normalized: EX [[EX [[~ [E [true U ~ [[[p41<=1 & 1<=p41] | [p102<=0 & 0<=p102]]]]] | [[p69<=0 & 0<=p69] & [p65<=0 & 0<=p65]]]] | [~ [EG [~ [E [EX [[[p18<=1 & 1<=p18] | [p46<=0 & 0<=p46]]] U ~ [EG [~ [[p74<=0 & 0<=p74]]]]]]]] & ~ [E [~ [E [EX [[[p18<=1 & 1<=p18] | [p46<=0 & 0<=p46]]] U ~ [EG [~ [[p74<=0 & 0<=p74]]]]]] U [~ [[p56<=1 & 1<=p56]] & ~ [E [EX [[[p18<=1 & 1<=p18] | [p46<=0 & 0<=p46]]] U ~ [EG [~ [[p74<=0 & 0<=p74]]]]]]]]]]]]

abstracting: (0<=p74)
states: 154,109,132 (8)
abstracting: (p74<=0)
states: 154,109,131 (8)
.
EG iterations: 1
abstracting: (0<=p46)
states: 154,109,132 (8)
abstracting: (p46<=0)
states: 115,581,852 (8)
abstracting: (1<=p18)
states: 13,289,088 (7)
abstracting: (p18<=1)
states: 154,109,132 (8)
.abstracting: (1<=p56)
states: 38,527,280 (7)
abstracting: (p56<=1)
states: 154,109,132 (8)
abstracting: (0<=p74)
states: 154,109,132 (8)
abstracting: (p74<=0)
states: 154,109,131 (8)
.
EG iterations: 1
abstracting: (0<=p46)
states: 154,109,132 (8)
abstracting: (p46<=0)
states: 115,581,852 (8)
abstracting: (1<=p18)
states: 13,289,088 (7)
abstracting: (p18<=1)
states: 154,109,132 (8)
.abstracting: (0<=p74)
states: 154,109,132 (8)
abstracting: (p74<=0)
states: 154,109,131 (8)
.
EG iterations: 1
abstracting: (0<=p46)
states: 154,109,132 (8)
abstracting: (p46<=0)
states: 115,581,852 (8)
abstracting: (1<=p18)
states: 13,289,088 (7)
abstracting: (p18<=1)
states: 154,109,132 (8)
..
EG iterations: 1
abstracting: (0<=p65)
states: 154,109,132 (8)
abstracting: (p65<=0)
states: 122,028,812 (8)
abstracting: (0<=p69)
states: 154,109,132 (8)
abstracting: (p69<=0)
states: 130,912,652 (8)
abstracting: (0<=p102)
states: 154,109,132 (8)
abstracting: (p102<=0)
states: 149,353,676 (8)
abstracting: (1<=p41)
states: 11,845,440 (7)
abstracting: (p41<=1)
states: 154,109,132 (8)

before gc: list nodes free: 9110180

after gc: idd nodes used:2640267, unused:61359733; list nodes free:294557467
..-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m32.771sec

checking: [EF [[[A [AG [[[p48<=0 & 0<=p48] | [p87<=1 & 1<=p87]]] U [p38<=0 & 0<=p38]] & EX [[~ [E [[[p100<=0 & 0<=p100] | [p6<=1 & 1<=p6]] U [[p32<=0 & 0<=p32] | [p14<=1 & 1<=p14]]]] | AG [~ [[p17<=0 & 0<=p17]]]]]] & [[p33<=0 & 0<=p33] & [[[p48<=0 & 0<=p48] | [p113<=1 & 1<=p113]] | [[p35<=0 & 0<=p35] | [[p77<=1 & 1<=p77] | [p13<=1 & 1<=p13]]]]]]] | E [[[[p11<=0 & 0<=p11] | [p105<=1 & 1<=p105]] & [EG [[p80<=0 & 0<=p80]] | [[[p109<=0 & 0<=p109] & ~ [[[p36<=0 & 0<=p36] | [p96<=1 & 1<=p96]]]] | [p7<=1 & 1<=p7]]]] U ~ [[[p27<=0 & 0<=p27] | [p82<=1 & 1<=p82]]]]]
normalized: [E [[[[[p7<=1 & 1<=p7] | [~ [[[p96<=1 & 1<=p96] | [p36<=0 & 0<=p36]]] & [p109<=0 & 0<=p109]]] | EG [[p80<=0 & 0<=p80]]] & [[p105<=1 & 1<=p105] | [p11<=0 & 0<=p11]]] U ~ [[[p82<=1 & 1<=p82] | [p27<=0 & 0<=p27]]]] | E [true U [[[[[[p13<=1 & 1<=p13] | [p77<=1 & 1<=p77]] | [p35<=0 & 0<=p35]] | [[p113<=1 & 1<=p113] | [p48<=0 & 0<=p48]]] & [p33<=0 & 0<=p33]] & [EX [[~ [E [true U [p17<=0 & 0<=p17]]] | ~ [E [[[p6<=1 & 1<=p6] | [p100<=0 & 0<=p100]] U [[p14<=1 & 1<=p14] | [p32<=0 & 0<=p32]]]]]] & [~ [EG [~ [[p38<=0 & 0<=p38]]]] & ~ [E [~ [[p38<=0 & 0<=p38]] U [E [true U ~ [[[p87<=1 & 1<=p87] | [p48<=0 & 0<=p48]]]] & ~ [[p38<=0 & 0<=p38]]]]]]]]]]

abstracting: (0<=p38)
states: 154,109,132 (8)
abstracting: (p38<=0)
states: 142,715,660 (8)
abstracting: (0<=p48)
states: 154,109,132 (8)
abstracting: (p48<=0)
states: 154,109,121 (8)
abstracting: (1<=p87)
states: 202,176 (5)
abstracting: (p87<=1)
states: 154,109,132 (8)
abstracting: (0<=p38)
states: 154,109,132 (8)
abstracting: (p38<=0)
states: 142,715,660 (8)
abstracting: (0<=p38)
states: 154,109,132 (8)
abstracting: (p38<=0)
states: 142,715,660 (8)
........
EG iterations: 8
abstracting: (0<=p32)
states: 154,109,132 (8)
abstracting: (p32<=0)
states: 143,016,908 (8)
abstracting: (1<=p14)
states: 17,912,640 (7)
abstracting: (p14<=1)
states: 154,109,132 (8)
abstracting: (0<=p100)
states: 154,109,132 (8)
abstracting: (p100<=0)
states: 153,984,716 (8)
abstracting: (1<=p6)
states: 6,615,936 (6)
abstracting: (p6<=1)
states: 154,109,132 (8)
abstracting: (0<=p17)
states: 154,109,132 (8)
abstracting: (p17<=0)
states: 154,109,121 (8)
.abstracting: (0<=p33)
states: 154,109,132 (8)
abstracting: (p33<=0)
states: 142,715,660 (8)
abstracting: (0<=p48)
states: 154,109,132 (8)
abstracting: (p48<=0)
states: 154,109,121 (8)
abstracting: (1<=p113)
states: 108,864 (5)
abstracting: (p113<=1)
states: 154,109,132 (8)
abstracting: (0<=p35)
states: 154,109,132 (8)
abstracting: (p35<=0)
states: 147,384,524 (8)
abstracting: (1<=p77)
states: 43,119,872 (7)
abstracting: (p77<=1)
states: 154,109,132 (8)
abstracting: (1<=p13)
states: 12,081,408 (7)
abstracting: (p13<=1)
states: 154,109,132 (8)
abstracting: (0<=p27)
states: 154,109,132 (8)
abstracting: (p27<=0)
states: 132,099,020 (8)
abstracting: (1<=p82)
states: 6,401,088 (6)
abstracting: (p82<=1)
states: 154,109,132 (8)
abstracting: (0<=p11)
states: 154,109,132 (8)
abstracting: (p11<=0)
states: 142,506,572 (8)
abstracting: (1<=p105)

before gc: list nodes free: 6658733

after gc: idd nodes used:2769863, unused:61230137; list nodes free:294019883
states: 4,755,456 (6)
abstracting: (p105<=1)
states: 154,109,132 (8)
abstracting: (0<=p80)
states: 154,109,132 (8)
abstracting: (p80<=0)
states: 154,109,125 (8)
...
EG iterations: 3
abstracting: (0<=p109)
states: 154,109,132 (8)
abstracting: (p109<=0)
states: 145,489,676 (8)
abstracting: (0<=p36)
states: 154,109,132 (8)
abstracting: (p36<=0)
states: 142,715,660 (8)
abstracting: (1<=p96)
states: 124,416 (5)
abstracting: (p96<=1)
states: 154,109,132 (8)
abstracting: (1<=p7)
states: 6,615,936 (6)
abstracting: (p7<=1)
states: 154,109,132 (8)

before gc: list nodes free: 18045250

after gc: idd nodes used:3209465, unused:60790535; list nodes free:292114683
-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m52.935sec

checking: AG [[EX [[E [A [[1<=p28 & p28<=1] U [p44<=1 & 1<=p44]] U A [[[p58<=0 & 0<=p58] | [p53<=1 & 1<=p53]] U [[p88<=0 & 0<=p88] | [p67<=1 & 1<=p67]]]] & [[p82<=0 & 0<=p82] | [p79<=1 & 1<=p79]]]] | [~ [E [[[p12<=0 & 0<=p12] | [p27<=1 & 1<=p27]] U ~ [[[p37<=0 & 0<=p37] | [p9<=1 & 1<=p9]]]]] | [E [[p83<=1 & 1<=p83] U EF [[[p112<=0 & 0<=p112] | [p16<=1 & 1<=p16]]]] & [[EG [[p86<=0 & 0<=p86]] | A [[[p105<=0 & 0<=p105] | [p37<=1 & 1<=p37]] U [[p24<=0 & 0<=p24] | [p40<=1 & 1<=p40]]]] | [[[p48<=0 & 0<=p48] & [p31<=1 & 1<=p31]] | [[[p89<=1 & 1<=p89] & [p7<=1 & 1<=p7]] | [[p23<=0 & 0<=p23] & [[p28<=0 & 0<=p28] & [p5<=1 & 1<=p5]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p5<=1 & 1<=p5] & [p28<=0 & 0<=p28]] & [p23<=0 & 0<=p23]] | [[p7<=1 & 1<=p7] & [p89<=1 & 1<=p89]]] | [[p31<=1 & 1<=p31] & [p48<=0 & 0<=p48]]] | [[~ [EG [~ [[[p40<=1 & 1<=p40] | [p24<=0 & 0<=p24]]]]] & ~ [E [~ [[[p40<=1 & 1<=p40] | [p24<=0 & 0<=p24]]] U [~ [[[p37<=1 & 1<=p37] | [p105<=0 & 0<=p105]]] & ~ [[[p40<=1 & 1<=p40] | [p24<=0 & 0<=p24]]]]]]] | EG [[p86<=0 & 0<=p86]]]] & E [[p83<=1 & 1<=p83] U E [true U [[p16<=1 & 1<=p16] | [p112<=0 & 0<=p112]]]]] | ~ [E [[[p27<=1 & 1<=p27] | [p12<=0 & 0<=p12]] U ~ [[[p9<=1 & 1<=p9] | [p37<=0 & 0<=p37]]]]]] | EX [[[[p79<=1 & 1<=p79] | [p82<=0 & 0<=p82]] & E [[~ [EG [~ [[p44<=1 & 1<=p44]]]] & ~ [E [~ [[p44<=1 & 1<=p44]] U [~ [[1<=p28 & p28<=1]] & ~ [[p44<=1 & 1<=p44]]]]]] U [~ [EG [~ [[[p67<=1 & 1<=p67] | [p88<=0 & 0<=p88]]]]] & ~ [E [~ [[[p67<=1 & 1<=p67] | [p88<=0 & 0<=p88]]] U [~ [[[p53<=1 & 1<=p53] | [p58<=0 & 0<=p58]]] & ~ [[[p67<=1 & 1<=p67] | [p88<=0 & 0<=p88]]]]]]]]]]]]]]

abstracting: (0<=p88)
states: 154,109,132 (8)
abstracting: (p88<=0)
states: 153,984,716 (8)
abstracting: (1<=p67)
states: 41,423,360 (7)
abstracting: (p67<=1)
states: 154,109,132 (8)
abstracting: (0<=p58)
states: 154,109,132 (8)
abstracting: (p58<=0)
states: 131,265,292 (8)
abstracting: (1<=p53)
states: 11
abstracting: (p53<=1)
states: 154,109,132 (8)
abstracting: (0<=p88)
states: 154,109,132 (8)
abstracting: (p88<=0)
states: 153,984,716 (8)
abstracting: (1<=p67)
states: 41,423,360 (7)
abstracting: (p67<=1)
states: 154,109,132 (8)
abstracting: (0<=p88)
states: 154,109,132 (8)
abstracting: (p88<=0)
states: 153,984,716 (8)
abstracting: (1<=p67)
states: 41,423,360 (7)
abstracting: (p67<=1)
states: 154,109,132 (8)
.....
EG iterations: 5
abstracting: (1<=p44)
states: 38,527,280 (7)
abstracting: (p44<=1)
states: 154,109,132 (8)
abstracting: (p28<=1)
states: 154,109,132 (8)
abstracting: (1<=p28)
states: 6,227,328 (6)
abstracting: (1<=p44)
states: 38,527,280 (7)
abstracting: (p44<=1)
states: 154,109,132 (8)
abstracting: (1<=p44)
states: 38,527,280 (7)
abstracting: (p44<=1)
states: 154,109,132 (8)
........
EG iterations: 8
abstracting: (0<=p82)
states: 154,109,132 (8)
abstracting: (p82<=0)
states: 147,708,044 (8)
abstracting: (1<=p79)
states: 15,296 (4)
abstracting: (p79<=1)
states: 154,109,132 (8)
.abstracting: (0<=p37)
states: 154,109,132 (8)
abstracting: (p37<=0)
states: 142,715,660 (8)
abstracting: (1<=p9)
states: 11,602,560 (7)
abstracting: (p9<=1)
states: 154,109,132 (8)
abstracting: (0<=p12)
states: 154,109,132 (8)
abstracting: (p12<=0)
states: 142,506,572 (8)
abstracting: (1<=p27)
states: 22,010,112 (7)
abstracting: (p27<=1)
states: 154,109,132 (8)
abstracting: (0<=p112)
states: 154,109,132 (8)
abstracting: (p112<=0)
states: 154,109,131 (8)
abstracting: (1<=p16)
states: 6,036,800 (6)
abstracting: (p16<=1)
states: 154,109,132 (8)
abstracting: (1<=p83)
states: 6,411,840 (6)
abstracting: (p83<=1)
states: 154,109,132 (8)
abstracting: (0<=p86)
states: 154,109,132 (8)
abstracting: (p86<=0)
states: 153,984,716 (8)
.
EG iterations: 1
abstracting: (0<=p24)
states: 154,109,132 (8)
abstracting: (p24<=0)
states: 140,393,228 (8)
abstracting: (1<=p40)
states: 6,912,192 (6)
abstracting: (p40<=1)
states: 154,109,132 (8)
abstracting: (0<=p105)
states: 154,109,132 (8)
abstracting: (p105<=0)
states: 149,353,676 (8)
abstracting: (1<=p37)
states: 11,393,472 (7)
abstracting: (p37<=1)
states: 154,109,132 (8)
abstracting: (0<=p24)
states: 154,109,132 (8)
abstracting: (p24<=0)
states: 140,393,228 (8)
abstracting: (1<=p40)
states: 6,912,192 (6)
abstracting: (p40<=1)
states: 154,109,132 (8)
abstracting: (0<=p24)
states: 154,109,132 (8)
abstracting: (p24<=0)
states: 140,393,228 (8)
abstracting: (1<=p40)
states: 6,912,192 (6)
abstracting: (p40<=1)
states: 154,109,132 (8)
........
EG iterations: 8
abstracting: (0<=p48)
states: 154,109,132 (8)
abstracting: (p48<=0)
states: 154,109,121 (8)
abstracting: (1<=p31)
states: 11,092,224 (7)
abstracting: (p31<=1)
states: 154,109,132 (8)
abstracting: (1<=p89)
states: 124,416 (5)
abstracting: (p89<=1)
states: 154,109,132 (8)
abstracting: (1<=p7)
states: 6,615,936 (6)
abstracting: (p7<=1)
states: 154,109,132 (8)
abstracting: (0<=p23)
states: 154,109,132 (8)
abstracting: (p23<=0)
states: 145,547,852 (8)
abstracting: (0<=p28)
states: 154,109,132 (8)
abstracting: (p28<=0)
states: 147,881,804 (8)
abstracting: (1<=p5)
states: 11,602,560 (7)
abstracting: (p5<=1)
states: 154,109,132 (8)
-> the formula is TRUE

FORMULA HealthRecord-PT-09-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m41.748sec

totally nodes used: 552609395 (5.5e+08)
number of garbage collections: 8
fire ops cache: hits/miss/sum: 342142846 1383352017 1725494863
used/not used/entry size/cache size: 62788794 4320070 16 1024MB
basic ops cache: hits/miss/sum: 114525098 506138695 620663793
used/not used/entry size/cache size: 16439074 338142 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: 2025700 6880570 8906270
used/not used/entry size/cache size: 1275367 7113241 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 30384553
1 22976172
2 9865325
3 3007893
4 711944
5 137164
6 22269
7 3098
8 393
9 51
>= 10 2

Total processing time: 26m20.497sec


BK_STOP 1678692821121

--------------------
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.003sec

7310
iterations count:137557 (600), effective:6450 (28)

initing FirstDep: 0m 0.000sec


iterations count:1781 (7), effective:116 (0)

iterations count:4200 (18), effective:265 (1)

iterations count:15108 (65), effective:664 (2)

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

iterations count:3656 (15), effective:249 (1)

iterations count:19321 (84), effective:925 (4)

iterations count:5769 (25), effective:409 (1)

iterations count:6166 (26), effective:395 (1)

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

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

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

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

iterations count:2781 (12), effective:176 (0)

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

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

iterations count:15108 (65), effective:664 (2)

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

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

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

iterations count:5523 (24), effective:379 (1)

iterations count:19579 (85), effective:946 (4)

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

iterations count:894 (3), effective:48 (0)

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

iterations count:15400 (67), effective:751 (3)

iterations count:3920 (17), effective:185 (0)

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

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

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

iterations count:2728 (11), effective:168 (0)

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

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

iterations count:2603 (11), effective:157 (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="HealthRecord-PT-09"
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 HealthRecord-PT-09, 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-167840348500297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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