About the Execution of Marcie+red for HealthRecord-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10005.056 | 204740.00 | 222804.00 | 1100.00 | FFFFFFTFTTTFTTTF | 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-167840348400265.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-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348400265
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.9K Feb 26 17:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 18:00 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 51K 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-05-CTLCardinality-00
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-01
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-02
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-03
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-04
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-05
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-06
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-07
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-08
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-09
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-10
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-11
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-12
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-13
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-14
FORMULA_NAME HealthRecord-PT-05-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678682905412
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-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 04:48:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 04:48:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 04:48:28] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-13 04:48:28] [INFO ] Transformed 125 places.
[2023-03-13 04:48:28] [INFO ] Transformed 246 transitions.
[2023-03-13 04:48:28] [INFO ] Found NUPN structural information;
[2023-03-13 04:48:28] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Support contains 71 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 237/237 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 101 transition count 193
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 101 transition count 193
Applied a total of 48 rules in 46 ms. Remains 101 /125 variables (removed 24) and now considering 193/237 (removed 44) transitions.
[2023-03-13 04:48:29] [INFO ] Flow matrix only has 189 transitions (discarded 4 similar events)
// Phase 1: matrix 189 rows 101 cols
[2023-03-13 04:48:29] [INFO ] Computed 10 place invariants in 32 ms
[2023-03-13 04:48:29] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-13 04:48:29] [INFO ] Flow matrix only has 189 transitions (discarded 4 similar events)
[2023-03-13 04:48:29] [INFO ] Invariant cache hit.
[2023-03-13 04:48:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:48:29] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-13 04:48:29] [INFO ] Flow matrix only has 189 transitions (discarded 4 similar events)
[2023-03-13 04:48:29] [INFO ] Invariant cache hit.
[2023-03-13 04:48:30] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/125 places, 193/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1035 ms. Remains : 101/125 places, 193/237 transitions.
Support contains 71 out of 101 places after structural reductions.
[2023-03-13 04:48:30] [INFO ] Flatten gal took : 83 ms
[2023-03-13 04:48:30] [INFO ] Flatten gal took : 35 ms
[2023-03-13 04:48:30] [INFO ] Input system was already deterministic with 193 transitions.
Incomplete random walk after 10000 steps, including 917 resets, run finished after 1186 ms. (steps per millisecond=8 ) properties (out of 59) seen :26
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :4
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :3
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-13 04:48:32] [INFO ] Flow matrix only has 189 transitions (discarded 4 similar events)
[2023-03-13 04:48:32] [INFO ] Invariant cache hit.
[2023-03-13 04:48:32] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-13 04:48:32] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 11 ms returned sat
[2023-03-13 04:48:32] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-13 04:48:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-13 04:48:32] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 21 ms returned sat
[2023-03-13 04:48:33] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :24
[2023-03-13 04:48:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:48:34] [INFO ] After 463ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :24
[2023-03-13 04:48:34] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 11 ms to minimize.
[2023-03-13 04:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-13 04:48:34] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2023-03-13 04:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-13 04:48:34] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2023-03-13 04:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-13 04:48:34] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 4 ms to minimize.
[2023-03-13 04:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-13 04:48:35] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2023-03-13 04:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-13 04:48:35] [INFO ] After 1885ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :24
Attempting to minimize the solution found.
Minimization took 327 ms.
[2023-03-13 04:48:35] [INFO ] After 3205ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :24
Fused 26 Parikh solutions to 24 different solutions.
Parikh walk visited 20 properties in 114 ms.
Support contains 11 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 193/193 transitions.
Graph (trivial) has 120 edges and 101 vertex of which 6 / 101 are part of one of the 3 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 359 edges and 98 vertex of which 95 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 95 transition count 181
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 94 transition count 178
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 92 transition count 177
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 42 place count 60 transition count 113
Iterating global reduction 3 with 32 rules applied. Total rules applied 74 place count 60 transition count 113
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 82 place count 52 transition count 97
Iterating global reduction 3 with 8 rules applied. Total rules applied 90 place count 52 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 93 place count 52 transition count 94
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 4 with 2 rules applied. Total rules applied 95 place count 51 transition count 93
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 105 place count 46 transition count 120
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 46 transition count 117
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 125 place count 46 transition count 117
Applied a total of 125 rules in 77 ms. Remains 46 /101 variables (removed 55) and now considering 117/193 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 46/101 places, 117/193 transitions.
Incomplete random walk after 10000 steps, including 828 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 148 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 04:48:36] [INFO ] Flow matrix only has 109 transitions (discarded 8 similar events)
// Phase 1: matrix 109 rows 46 cols
[2023-03-13 04:48:36] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-13 04:48:36] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 04:48:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 04:48:36] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-13 04:48:36] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 04:48:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-13 04:48:36] [INFO ] After 28ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 04:48:36] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-13 04:48:36] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 117/117 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 44 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 43 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 43 transition count 111
Applied a total of 6 rules in 16 ms. Remains 43 /46 variables (removed 3) and now considering 111/117 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 43/46 places, 111/117 transitions.
Incomplete random walk after 10000 steps, including 834 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 04:48:36] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
// Phase 1: matrix 103 rows 43 cols
[2023-03-13 04:48:36] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-13 04:48:36] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 04:48:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 04:48:37] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-13 04:48:37] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 04:48:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-13 04:48:37] [INFO ] After 20ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 04:48:37] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-13 04:48:37] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 111/111 transitions.
Graph (complete) has 166 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 42 transition count 111
Applied a total of 3 rules in 34 ms. Remains 42 /43 variables (removed 1) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 42/43 places, 111/111 transitions.
Incomplete random walk after 10000 steps, including 836 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3629 steps, run visited all 1 properties in 77 ms. (steps per millisecond=47 )
Probabilistic random walk after 3629 steps, saw 1038 distinct states, run finished after 78 ms. (steps per millisecond=46 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-13 04:48:37] [INFO ] Flatten gal took : 50 ms
[2023-03-13 04:48:37] [INFO ] Flatten gal took : 33 ms
[2023-03-13 04:48:37] [INFO ] Input system was already deterministic with 193 transitions.
Computed a total of 8 stabilizing places and 14 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 59 transition count 112
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 59 transition count 112
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 50 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 50 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 106 place count 50 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 48 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 48 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 46 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 46 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 116 place count 46 transition count 78
Applied a total of 116 rules in 33 ms. Remains 46 /101 variables (removed 55) and now considering 78/193 (removed 115) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 46/101 places, 78/193 transitions.
[2023-03-13 04:48:37] [INFO ] Flatten gal took : 9 ms
[2023-03-13 04:48:37] [INFO ] Flatten gal took : 23 ms
[2023-03-13 04:48:37] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 59 transition count 112
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 59 transition count 112
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 50 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 50 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 105 place count 50 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 48 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 48 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 46 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 46 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 115 place count 46 transition count 79
Applied a total of 115 rules in 45 ms. Remains 46 /101 variables (removed 55) and now considering 79/193 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 46/101 places, 79/193 transitions.
[2023-03-13 04:48:37] [INFO ] Flatten gal took : 25 ms
[2023-03-13 04:48:37] [INFO ] Flatten gal took : 10 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Graph (trivial) has 130 edges and 101 vertex of which 6 / 101 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 39 place count 59 transition count 116
Iterating global reduction 0 with 38 rules applied. Total rules applied 77 place count 59 transition count 116
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 84 place count 52 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 91 place count 52 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 93 place count 52 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 50 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 50 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 48 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 48 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 103 place count 48 transition count 88
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 48 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 47 transition count 86
Applied a total of 106 rules in 96 ms. Remains 47 /101 variables (removed 54) and now considering 86/193 (removed 107) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 96 ms. Remains : 47/101 places, 86/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 9 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Graph (trivial) has 140 edges and 101 vertex of which 6 / 101 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 54 transition count 106
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 54 transition count 106
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 98 place count 43 transition count 84
Iterating global reduction 0 with 11 rules applied. Total rules applied 109 place count 43 transition count 84
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 114 place count 43 transition count 79
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 40 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 40 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 38 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 38 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 126 place count 38 transition count 64
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 38 transition count 63
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 2 with 2 rules applied. Total rules applied 129 place count 37 transition count 62
Applied a total of 129 rules in 68 ms. Remains 37 /101 variables (removed 64) and now considering 62/193 (removed 131) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 37/101 places, 62/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 68 transition count 130
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 68 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 62 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 62 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 62 transition count 116
Applied a total of 80 rules in 26 ms. Remains 62 /101 variables (removed 39) and now considering 116/193 (removed 77) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 62/101 places, 116/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 23 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 13 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 64 transition count 122
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 64 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 57 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 57 transition count 108
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 57 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 56 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 56 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 55 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 55 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 55 transition count 100
Applied a total of 95 rules in 6 ms. Remains 55 /101 variables (removed 46) and now considering 100/193 (removed 93) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 55/101 places, 100/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 16 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 9 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 63 transition count 118
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 63 transition count 118
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 55 transition count 102
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 55 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 55 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 53 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 53 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 51 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 51 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 51 transition count 88
Applied a total of 104 rules in 6 ms. Remains 51 /101 variables (removed 50) and now considering 88/193 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 51/101 places, 88/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 10 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 8 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 60 transition count 114
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 60 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 54 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 54 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 54 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 53 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 53 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 52 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 52 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 52 transition count 93
Applied a total of 102 rules in 4 ms. Remains 52 /101 variables (removed 49) and now considering 93/193 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 52/101 places, 93/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 13 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 62 transition count 118
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 62 transition count 118
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 87 place count 53 transition count 100
Iterating global reduction 0 with 9 rules applied. Total rules applied 96 place count 53 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 100 place count 53 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 51 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 51 transition count 90
Applied a total of 104 rules in 3 ms. Remains 51 /101 variables (removed 50) and now considering 90/193 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 51/101 places, 90/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 10 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 61 transition count 116
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 61 transition count 116
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 52 transition count 98
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 52 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 52 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 49 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 49 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 46 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 46 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 115 place count 46 transition count 78
Applied a total of 115 rules in 4 ms. Remains 46 /101 variables (removed 55) and now considering 78/193 (removed 115) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 46/101 places, 78/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 65 transition count 124
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 65 transition count 124
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 61 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 61 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 60 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 60 transition count 113
Applied a total of 82 rules in 3 ms. Remains 60 /101 variables (removed 41) and now considering 113/193 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 60/101 places, 113/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 13 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 57 transition count 108
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 57 transition count 108
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 98 place count 47 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 108 place count 47 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 112 place count 47 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 45 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 45 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 43 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 43 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 122 place count 43 transition count 72
Applied a total of 122 rules in 19 ms. Remains 43 /101 variables (removed 58) and now considering 72/193 (removed 121) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 43/101 places, 72/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 60 transition count 114
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 60 transition count 114
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 51 transition count 96
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 51 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 102 place count 51 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 49 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 49 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 47 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 47 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 47 transition count 82
Applied a total of 112 rules in 20 ms. Remains 47 /101 variables (removed 54) and now considering 82/193 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 47/101 places, 82/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 61 transition count 115
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 61 transition count 115
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 52 transition count 97
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 52 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 52 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 50 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 50 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 49 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 49 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 49 transition count 84
Applied a total of 109 rules in 3 ms. Remains 49 /101 variables (removed 52) and now considering 84/193 (removed 109) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/101 places, 84/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 19 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 60 transition count 113
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 60 transition count 113
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 51 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 51 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 102 place count 51 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 49 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 49 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 48 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 48 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 48 transition count 84
Applied a total of 109 rules in 4 ms. Remains 48 /101 variables (removed 53) and now considering 84/193 (removed 109) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 48/101 places, 84/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 14 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:38] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 193/193 transitions.
Graph (trivial) has 136 edges and 101 vertex of which 6 / 101 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 56 transition count 110
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 56 transition count 110
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 93 place count 46 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 103 place count 46 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 107 place count 46 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 43 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 43 transition count 77
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 40 transition count 71
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 40 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 121 place count 40 transition count 69
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 40 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 39 transition count 67
Applied a total of 124 rules in 27 ms. Remains 39 /101 variables (removed 62) and now considering 67/193 (removed 126) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 39/101 places, 67/193 transitions.
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 04:48:38] [INFO ] Flatten gal took : 3 ms
[2023-03-13 04:48:39] [INFO ] Input system was already deterministic with 67 transitions.
[2023-03-13 04:48:39] [INFO ] Flatten gal took : 17 ms
[2023-03-13 04:48:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 04:48:39] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-13 04:48:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 101 places, 193 transitions and 520 arcs took 6 ms.
Total runtime 10482 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: 101 NrTr: 193 NrArc: 520)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 3.518sec
RS generation: 0m 2.858sec
-> reachability set: #nodes 60090 (6.0e+04) #states 1,667,300 (6)
starting MCC model checker
--------------------------
checking: AG [AF [[p84<=0 & 0<=p84]]]
normalized: ~ [E [true U EG [~ [[p84<=0 & 0<=p84]]]]]
abstracting: (0<=p84)
states: 1,667,300 (6)
abstracting: (p84<=0)
states: 1,604,516 (6)
........
EG iterations: 8
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.578sec
checking: EG [EX [EF [AG [[p83<=1 & 1<=p83]]]]]
normalized: EG [EX [E [true U ~ [E [true U ~ [[p83<=1 & 1<=p83]]]]]]]
abstracting: (1<=p83)
states: 12,960 (4)
abstracting: (p83<=1)
states: 1,667,300 (6)
..
EG iterations: 1
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.248sec
checking: [AX [[p18<=0 & 0<=p18]] & AF [[p81<=1 & 1<=p81]]]
normalized: [~ [EG [~ [[p81<=1 & 1<=p81]]]] & ~ [EX [~ [[p18<=0 & 0<=p18]]]]]
abstracting: (0<=p18)
states: 1,667,300 (6)
abstracting: (p18<=0)
states: 1,330,772 (6)
.abstracting: (1<=p81)
states: 12,960 (4)
abstracting: (p81<=1)
states: 1,667,300 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.856sec
checking: E [[p86<=1 & 1<=p86] U AG [[[p11<=0 & 0<=p11] | [p12<=1 & 1<=p12]]]]
normalized: E [[p86<=1 & 1<=p86] U ~ [E [true U ~ [[[p12<=1 & 1<=p12] | [p11<=0 & 0<=p11]]]]]]
abstracting: (0<=p11)
states: 1,667,300 (6)
abstracting: (p11<=0)
states: 1,585,124 (6)
abstracting: (1<=p12)
states: 82,176 (4)
abstracting: (p12<=1)
states: 1,667,300 (6)
abstracting: (1<=p86)
states: 6,912 (3)
abstracting: (p86<=1)
states: 1,667,300 (6)
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.433sec
checking: [A [[p69<=1 & 1<=p69] U AF [[~ [AF [[[p6<=0 & 0<=p6] | [p34<=1 & 1<=p34]]]] | AX [[p30<=0 & 0<=p30]]]]] & AG [EX [0<=0]]]
normalized: [~ [E [true U ~ [EX [0<=0]]]] & [~ [EG [EG [~ [[~ [EX [~ [[p30<=0 & 0<=p30]]]] | EG [~ [[[p34<=1 & 1<=p34] | [p6<=0 & 0<=p6]]]]]]]]] & ~ [E [EG [~ [[~ [EX [~ [[p30<=0 & 0<=p30]]]] | EG [~ [[[p34<=1 & 1<=p34] | [p6<=0 & 0<=p6]]]]]]] U [~ [[p69<=1 & 1<=p69]] & EG [~ [[~ [EX [~ [[p30<=0 & 0<=p30]]]] | EG [~ [[[p34<=1 & 1<=p34] | [p6<=0 & 0<=p6]]]]]]]]]]]]
abstracting: (0<=p6)
states: 1,667,300 (6)
abstracting: (p6<=0)
states: 1,615,460 (6)
abstracting: (1<=p34)
states: 555,763 (5)
abstracting: (p34<=1)
states: 1,667,300 (6)
...........
EG iterations: 11
abstracting: (0<=p30)
states: 1,667,300 (6)
abstracting: (p30<=0)
states: 1,384,145 (6)
..........
EG iterations: 9
abstracting: (1<=p69)
states: 62,784 (4)
abstracting: (p69<=1)
states: 1,667,300 (6)
abstracting: (0<=p6)
states: 1,667,300 (6)
abstracting: (p6<=0)
states: 1,615,460 (6)
abstracting: (1<=p34)
states: 555,763 (5)
abstracting: (p34<=1)
states: 1,667,300 (6)
...........
EG iterations: 11
abstracting: (0<=p30)
states: 1,667,300 (6)
abstracting: (p30<=0)
states: 1,384,145 (6)
..........
EG iterations: 9
abstracting: (0<=p6)
states: 1,667,300 (6)
abstracting: (p6<=0)
states: 1,615,460 (6)
abstracting: (1<=p34)
states: 555,763 (5)
abstracting: (p34<=1)
states: 1,667,300 (6)
...........
EG iterations: 11
abstracting: (0<=p30)
states: 1,667,300 (6)
abstracting: (p30<=0)
states: 1,384,145 (6)
..........
EG iterations: 9
.
EG iterations: 1
abstracting: (0<=0)
states: 1,667,300 (6)
.-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m15.478sec
checking: AX [EG [[EF [[p3<=0 & 0<=p3]] | [[p57<=1 & 1<=p57] | [[p53<=0 & 0<=p53] & [p41<=1 & 1<=p41]]]]]]
normalized: ~ [EX [~ [EG [[[[[p41<=1 & 1<=p41] & [p53<=0 & 0<=p53]] | [p57<=1 & 1<=p57]] | E [true U [p3<=0 & 0<=p3]]]]]]]
abstracting: (0<=p3)
states: 1,667,300 (6)
abstracting: (p3<=0)
states: 1,585,124 (6)
abstracting: (1<=p57)
states: 1
abstracting: (p57<=1)
states: 1,667,300 (6)
abstracting: (0<=p53)
states: 1,667,300 (6)
abstracting: (p53<=0)
states: 1,567,076 (6)
abstracting: (1<=p41)
states: 74,880 (4)
abstracting: (p41<=1)
states: 1,667,300 (6)
EG iterations: 0
.-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.192sec
checking: EG [[[p49<=0 & 0<=p49] & [AF [[p9<=0 & 0<=p9]] & EF [EX [[[p50<=0 & 0<=p50] | [[p77<=1 & 1<=p77] | [p10<=1 & 1<=p10]]]]]]]]
normalized: EG [[[E [true U EX [[[[p10<=1 & 1<=p10] | [p77<=1 & 1<=p77]] | [p50<=0 & 0<=p50]]]] & ~ [EG [~ [[p9<=0 & 0<=p9]]]]] & [p49<=0 & 0<=p49]]]
abstracting: (0<=p49)
states: 1,667,300 (6)
abstracting: (p49<=0)
states: 1,586,660 (6)
abstracting: (0<=p9)
states: 1,667,300 (6)
abstracting: (p9<=0)
states: 1,585,124 (6)
...........
EG iterations: 11
abstracting: (0<=p50)
states: 1,667,300 (6)
abstracting: (p50<=0)
states: 1,588,100 (6)
abstracting: (1<=p77)
states: 12,960 (4)
abstracting: (p77<=1)
states: 1,667,300 (6)
abstracting: (1<=p10)
states: 76,416 (4)
abstracting: (p10<=1)
states: 1,667,300 (6)
...........
EG iterations: 10
-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.815sec
checking: AG [~ [A [EF [[[[p66<=0 & 0<=p66] | [p26<=1 & 1<=p26]] & [[p42<=0 & 0<=p42] | [p44<=1 & 1<=p44]]]] U ~ [AF [[[p47<=0 & 0<=p47] | [p78<=1 & 1<=p78]]]]]]]
normalized: ~ [E [true U [~ [EG [~ [EG [~ [[[p78<=1 & 1<=p78] | [p47<=0 & 0<=p47]]]]]]] & ~ [E [~ [EG [~ [[[p78<=1 & 1<=p78] | [p47<=0 & 0<=p47]]]]] U [~ [E [true U [[[p44<=1 & 1<=p44] | [p42<=0 & 0<=p42]] & [[p26<=1 & 1<=p26] | [p66<=0 & 0<=p66]]]]] & ~ [EG [~ [[[p78<=1 & 1<=p78] | [p47<=0 & 0<=p47]]]]]]]]]]]
abstracting: (0<=p47)
states: 1,667,300 (6)
abstracting: (p47<=0)
states: 1,590,980 (6)
abstracting: (1<=p78)
states: 12,960 (4)
abstracting: (p78<=1)
states: 1,667,300 (6)
...........
EG iterations: 11
abstracting: (0<=p66)
states: 1,667,300 (6)
abstracting: (p66<=0)
states: 1,654,340 (6)
abstracting: (1<=p26)
states: 267,360 (5)
abstracting: (p26<=1)
states: 1,667,300 (6)
abstracting: (0<=p42)
states: 1,667,300 (6)
abstracting: (p42<=0)
states: 1,592,420 (6)
abstracting: (1<=p44)
states: 74,880 (4)
abstracting: (p44<=1)
states: 1,667,300 (6)
abstracting: (0<=p47)
states: 1,667,300 (6)
abstracting: (p47<=0)
states: 1,590,980 (6)
abstracting: (1<=p78)
states: 12,960 (4)
abstracting: (p78<=1)
states: 1,667,300 (6)
...........
EG iterations: 11
abstracting: (0<=p47)
states: 1,667,300 (6)
abstracting: (p47<=0)
states: 1,590,980 (6)
abstracting: (1<=p78)
states: 12,960 (4)
abstracting: (p78<=1)
states: 1,667,300 (6)
...........
EG iterations: 11
.
EG iterations: 1
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.805sec
checking: E [[AX [EX [A [[p97<=1 & 1<=p97] U [p100<=1 & 1<=p100]]]] & AF [~ [[p64<=0 & 0<=p64]]]] U [AX [[p82<=1 & 1<=p82]] | ~ [EF [[[p47<=1 & 1<=p47] | [p58<=1 & 1<=p58]]]]]]
normalized: E [[~ [EG [[p64<=0 & 0<=p64]]] & ~ [EX [~ [EX [[~ [EG [~ [[p100<=1 & 1<=p100]]]] & ~ [E [~ [[p100<=1 & 1<=p100]] U [~ [[p97<=1 & 1<=p97]] & ~ [[p100<=1 & 1<=p100]]]]]]]]]]] U [~ [E [true U [[p58<=1 & 1<=p58] | [p47<=1 & 1<=p47]]]] | ~ [EX [~ [[p82<=1 & 1<=p82]]]]]]
abstracting: (1<=p82)
states: 12,960 (4)
abstracting: (p82<=1)
states: 1,667,300 (6)
.abstracting: (1<=p47)
states: 76,320 (4)
abstracting: (p47<=1)
states: 1,667,300 (6)
abstracting: (1<=p58)
states: 1
abstracting: (p58<=1)
states: 1,667,300 (6)
abstracting: (1<=p100)
states: 729
abstracting: (p100<=1)
states: 1,667,300 (6)
abstracting: (1<=p97)
states: 108,288 (5)
abstracting: (p97<=1)
states: 1,667,300 (6)
abstracting: (1<=p100)
states: 729
abstracting: (p100<=1)
states: 1,667,300 (6)
abstracting: (1<=p100)
states: 729
abstracting: (p100<=1)
states: 1,667,300 (6)
..
EG iterations: 2
..abstracting: (0<=p64)
states: 1,667,300 (6)
abstracting: (p64<=0)
states: 1,654,340 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12.602sec
checking: AX [EG [[A [[[[p52<=0 & 0<=p52] | [p28<=1 & 1<=p28]] & [p7<=1 & 1<=p7]] U EX [0<=0]] & [[p24<=0 & 0<=p24] | [[p84<=0 & 0<=p84] | [p35<=1 & 1<=p35]]]]]]
normalized: ~ [EX [~ [EG [[[[[p35<=1 & 1<=p35] | [p84<=0 & 0<=p84]] | [p24<=0 & 0<=p24]] & [~ [EG [~ [EX [0<=0]]]] & ~ [E [~ [EX [0<=0]] U [~ [[[p7<=1 & 1<=p7] & [[p28<=1 & 1<=p28] | [p52<=0 & 0<=p52]]]] & ~ [EX [0<=0]]]]]]]]]]]
abstracting: (0<=0)
states: 1,667,300 (6)
.abstracting: (0<=p52)
states: 1,667,300 (6)
abstracting: (p52<=0)
states: 1,623,908 (6)
abstracting: (1<=p28)
states: 283,155 (5)
abstracting: (p28<=1)
states: 1,667,300 (6)
abstracting: (1<=p7)
states: 53,280 (4)
abstracting: (p7<=1)
states: 1,667,300 (6)
abstracting: (0<=0)
states: 1,667,300 (6)
.abstracting: (0<=0)
states: 1,667,300 (6)
..
EG iterations: 1
abstracting: (0<=p24)
states: 1,667,300 (6)
abstracting: (p24<=0)
states: 1,250,417 (6)
abstracting: (0<=p84)
states: 1,667,300 (6)
abstracting: (p84<=0)
states: 1,604,516 (6)
abstracting: (1<=p35)
states: 10
abstracting: (p35<=1)
states: 1,667,300 (6)
..........
EG iterations: 10
.-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.451sec
checking: EF [[AX [[EF [[p66<=1 & 1<=p66]] & [[p28<=1 & 1<=p28] & [[[p71<=1 & 1<=p71] | [p57<=0 & 0<=p57]] | [[p12<=0 & 0<=p12] | [p71<=1 & 1<=p71]]]]]] & AX [[p57<=1 & 1<=p57]]]]
normalized: E [true U [~ [EX [~ [[p57<=1 & 1<=p57]]]] & ~ [EX [~ [[[[[[p71<=1 & 1<=p71] | [p12<=0 & 0<=p12]] | [[p57<=0 & 0<=p57] | [p71<=1 & 1<=p71]]] & [p28<=1 & 1<=p28]] & E [true U [p66<=1 & 1<=p66]]]]]]]]
abstracting: (1<=p66)
states: 12,960 (4)
abstracting: (p66<=1)
states: 1,667,300 (6)
abstracting: (1<=p28)
states: 283,155 (5)
abstracting: (p28<=1)
states: 1,667,300 (6)
abstracting: (1<=p71)
states: 12,960 (4)
abstracting: (p71<=1)
states: 1,667,300 (6)
abstracting: (0<=p57)
states: 1,667,300 (6)
abstracting: (p57<=0)
states: 1,667,299 (6)
abstracting: (0<=p12)
states: 1,667,300 (6)
abstracting: (p12<=0)
states: 1,585,124 (6)
abstracting: (1<=p71)
states: 12,960 (4)
abstracting: (p71<=1)
states: 1,667,300 (6)
.abstracting: (1<=p57)
states: 1
abstracting: (p57<=1)
states: 1,667,300 (6)
.-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.356sec
checking: EX [[EF [AG [[E [[p26<=0 & 0<=p26] U [p16<=1 & 1<=p16]] & [[p28<=0 & 0<=p28] & [p83<=1 & 1<=p83]]]]] | [~ [A [[[p96<=0 & 0<=p96] | [p73<=1 & 1<=p73]] U [[p51<=0 & 0<=p51] | [p3<=1 & 1<=p3]]]] | ~ [[p59<=0 & 0<=p59]]]]]
normalized: EX [[E [true U ~ [E [true U ~ [[[[p28<=0 & 0<=p28] & [p83<=1 & 1<=p83]] & E [[p26<=0 & 0<=p26] U [p16<=1 & 1<=p16]]]]]]] | [~ [[p59<=0 & 0<=p59]] | ~ [[~ [EG [~ [[[p3<=1 & 1<=p3] | [p51<=0 & 0<=p51]]]]] & ~ [E [~ [[[p3<=1 & 1<=p3] | [p51<=0 & 0<=p51]]] U [~ [[[p73<=1 & 1<=p73] | [p96<=0 & 0<=p96]]] & ~ [[[p3<=1 & 1<=p3] | [p51<=0 & 0<=p51]]]]]]]]]]]
abstracting: (0<=p51)
states: 1,667,300 (6)
abstracting: (p51<=0)
states: 1,592,420 (6)
abstracting: (1<=p3)
states: 82,176 (4)
abstracting: (p3<=1)
states: 1,667,300 (6)
abstracting: (0<=p96)
states: 1,667,300 (6)
abstracting: (p96<=0)
states: 1,608,836 (6)
abstracting: (1<=p73)
states: 12,960 (4)
abstracting: (p73<=1)
states: 1,667,300 (6)
abstracting: (0<=p51)
states: 1,667,300 (6)
abstracting: (p51<=0)
states: 1,592,420 (6)
abstracting: (1<=p3)
states: 82,176 (4)
abstracting: (p3<=1)
states: 1,667,300 (6)
abstracting: (0<=p51)
states: 1,667,300 (6)
abstracting: (p51<=0)
states: 1,592,420 (6)
abstracting: (1<=p3)
states: 82,176 (4)
abstracting: (p3<=1)
states: 1,667,300 (6)
...........
EG iterations: 11
abstracting: (0<=p59)
states: 1,667,300 (6)
abstracting: (p59<=0)
states: 1,667,299 (6)
abstracting: (1<=p16)
states: 320,448 (5)
abstracting: (p16<=1)
states: 1,667,300 (6)
abstracting: (0<=p26)
states: 1,667,300 (6)
abstracting: (p26<=0)
states: 1,399,940 (6)
abstracting: (1<=p83)
states: 12,960 (4)
abstracting: (p83<=1)
states: 1,667,300 (6)
abstracting: (0<=p28)
states: 1,667,300 (6)
abstracting: (p28<=0)
states: 1,384,145 (6)
.-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.602sec
checking: [EX [AF [[p41<=0 & 0<=p41]]] & [EF [AG [[[[p0<=0 & 0<=p0] | [p6<=1 & 1<=p6]] & [EF [[p39<=1 & 1<=p39]] & [EF [[p23<=1 & 1<=p23]] | [[[p40<=0 & 0<=p40] | [p79<=1 & 1<=p79]] & [p37<=1 & 1<=p37]]]]]]] | AG [[[p68<=0 & 0<=p68] | [p31<=1 & 1<=p31]]]]]
normalized: [[~ [E [true U ~ [[[p31<=1 & 1<=p31] | [p68<=0 & 0<=p68]]]]] | E [true U ~ [E [true U ~ [[[[[[p37<=1 & 1<=p37] & [[p79<=1 & 1<=p79] | [p40<=0 & 0<=p40]]] | E [true U [p23<=1 & 1<=p23]]] & E [true U [p39<=1 & 1<=p39]]] & [[p6<=1 & 1<=p6] | [p0<=0 & 0<=p0]]]]]]]] & EX [~ [EG [~ [[p41<=0 & 0<=p41]]]]]]
abstracting: (0<=p41)
states: 1,667,300 (6)
abstracting: (p41<=0)
states: 1,592,420 (6)
...........
EG iterations: 11
.abstracting: (0<=p0)
states: 1,667,300 (6)
abstracting: (p0<=0)
states: 1,667,299 (6)
abstracting: (1<=p6)
states: 51,840 (4)
abstracting: (p6<=1)
states: 1,667,300 (6)
abstracting: (1<=p39)
states: 416,883 (5)
abstracting: (p39<=1)
states: 1,667,300 (6)
abstracting: (1<=p23)
states: 416,883 (5)
abstracting: (p23<=1)
states: 1,667,300 (6)
abstracting: (0<=p40)
states: 1,667,300 (6)
abstracting: (p40<=0)
states: 1,667,297 (6)
abstracting: (1<=p79)
states: 12,960 (4)
abstracting: (p79<=1)
states: 1,667,300 (6)
abstracting: (1<=p37)
states: 416,640 (5)
abstracting: (p37<=1)
states: 1,667,300 (6)
abstracting: (0<=p68)
states: 1,667,300 (6)
abstracting: (p68<=0)
states: 1,654,340 (6)
abstracting: (1<=p31)
states: 10
abstracting: (p31<=1)
states: 1,667,300 (6)
-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m40.113sec
checking: EG [[EG [[E [[[p89<=0 & 0<=p89] | [p49<=1 & 1<=p49]] U [[p80<=0 & 0<=p80] | [p40<=1 & 1<=p40]]] & [[[p79<=1 & 1<=p79] & [[p3<=0 & 0<=p3] | [p90<=1 & 1<=p90]]] | [p63<=0 & 0<=p63]]]] & EX [[[p40<=0 & 0<=p40] | [p29<=1 & 1<=p29]]]]]
normalized: EG [[EX [[[p29<=1 & 1<=p29] | [p40<=0 & 0<=p40]]] & EG [[[[p63<=0 & 0<=p63] | [[[p90<=1 & 1<=p90] | [p3<=0 & 0<=p3]] & [p79<=1 & 1<=p79]]] & E [[[p49<=1 & 1<=p49] | [p89<=0 & 0<=p89]] U [[p40<=1 & 1<=p40] | [p80<=0 & 0<=p80]]]]]]]
abstracting: (0<=p80)
states: 1,667,300 (6)
abstracting: (p80<=0)
states: 1,604,516 (6)
abstracting: (1<=p40)
states: 3
abstracting: (p40<=1)
states: 1,667,300 (6)
abstracting: (0<=p89)
states: 1,667,300 (6)
abstracting: (p89<=0)
states: 1,607,684 (6)
abstracting: (1<=p49)
states: 80,640 (4)
abstracting: (p49<=1)
states: 1,667,300 (6)
abstracting: (1<=p79)
states: 12,960 (4)
abstracting: (p79<=1)
states: 1,667,300 (6)
abstracting: (0<=p3)
states: 1,667,300 (6)
abstracting: (p3<=0)
states: 1,585,124 (6)
abstracting: (1<=p90)
states: 110,592 (5)
abstracting: (p90<=1)
states: 1,667,300 (6)
abstracting: (0<=p63)
states: 1,667,300 (6)
abstracting: (p63<=0)
states: 1,604,516 (6)
.
EG iterations: 1
abstracting: (0<=p40)
states: 1,667,300 (6)
abstracting: (p40<=0)
states: 1,667,297 (6)
abstracting: (1<=p29)
states: 283,155 (5)
abstracting: (p29<=1)
states: 1,667,300 (6)
...........
EG iterations: 10
-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.664sec
checking: A [E [[[p66<=0 & 0<=p66] | [p30<=1 & 1<=p30]] U [p8<=1 & 1<=p8]] U [[p9<=1 & 1<=p9] & E [[[AX [[p59<=1 & 1<=p59]] | [[p47<=0 & 0<=p47] | [p59<=1 & 1<=p59]]] | [[p37<=0 & 0<=p37] | [[p76<=1 & 1<=p76] | [[p5<=0 & 0<=p5] & [[p27<=0 & 0<=p27] | [p50<=1 & 1<=p50]]]]]] U [EG [[p96<=1 & 1<=p96]] & EX [[p82<=1 & 1<=p82]]]]]]
normalized: [~ [EG [~ [[E [[[[[[[p50<=1 & 1<=p50] | [p27<=0 & 0<=p27]] & [p5<=0 & 0<=p5]] | [p76<=1 & 1<=p76]] | [p37<=0 & 0<=p37]] | [[[p59<=1 & 1<=p59] | [p47<=0 & 0<=p47]] | ~ [EX [~ [[p59<=1 & 1<=p59]]]]]] U [EX [[p82<=1 & 1<=p82]] & EG [[p96<=1 & 1<=p96]]]] & [p9<=1 & 1<=p9]]]]] & ~ [E [~ [[E [[[[[[[p50<=1 & 1<=p50] | [p27<=0 & 0<=p27]] & [p5<=0 & 0<=p5]] | [p76<=1 & 1<=p76]] | [p37<=0 & 0<=p37]] | [[[p59<=1 & 1<=p59] | [p47<=0 & 0<=p47]] | ~ [EX [~ [[p59<=1 & 1<=p59]]]]]] U [EX [[p82<=1 & 1<=p82]] & EG [[p96<=1 & 1<=p96]]]] & [p9<=1 & 1<=p9]]] U [~ [E [[[p30<=1 & 1<=p30] | [p66<=0 & 0<=p66]] U [p8<=1 & 1<=p8]]] & ~ [[E [[[[[[[p50<=1 & 1<=p50] | [p27<=0 & 0<=p27]] & [p5<=0 & 0<=p5]] | [p76<=1 & 1<=p76]] | [p37<=0 & 0<=p37]] | [[[p59<=1 & 1<=p59] | [p47<=0 & 0<=p47]] | ~ [EX [~ [[p59<=1 & 1<=p59]]]]]] U [EX [[p82<=1 & 1<=p82]] & EG [[p96<=1 & 1<=p96]]]] & [p9<=1 & 1<=p9]]]]]]]
abstracting: (1<=p9)
states: 82,176 (4)
abstracting: (p9<=1)
states: 1,667,300 (6)
abstracting: (1<=p96)
states: 58,464 (4)
abstracting: (p96<=1)
states: 1,667,300 (6)
........
EG iterations: 8
abstracting: (1<=p82)
states: 12,960 (4)
abstracting: (p82<=1)
states: 1,667,300 (6)
.abstracting: (1<=p59)
states: 1
abstracting: (p59<=1)
states: 1,667,300 (6)
.abstracting: (0<=p47)
states: 1,667,300 (6)
abstracting: (p47<=0)
states: 1,590,980 (6)
abstracting: (1<=p59)
states: 1
abstracting: (p59<=1)
states: 1,667,300 (6)
abstracting: (0<=p37)
states: 1,667,300 (6)
abstracting: (p37<=0)
states: 1,250,660 (6)
abstracting: (1<=p76)
states: 62,784 (4)
abstracting: (p76<=1)
states: 1,667,300 (6)
abstracting: (0<=p5)
states: 1,667,300 (6)
abstracting: (p5<=0)
states: 1,585,124 (6)
abstracting: (0<=p27)
states: 1,667,300 (6)
abstracting: (p27<=0)
states: 1,384,388 (6)
abstracting: (1<=p50)
states: 79,200 (4)
abstracting: (p50<=1)
states: 1,667,300 (6)
abstracting: (1<=p8)
states: 46,080 (4)
abstracting: (p8<=1)
states: 1,667,300 (6)
abstracting: (0<=p66)
states: 1,667,300 (6)
abstracting: (p66<=0)
states: 1,654,340 (6)
abstracting: (1<=p30)
states: 283,155 (5)
abstracting: (p30<=1)
states: 1,667,300 (6)
abstracting: (1<=p9)
states: 82,176 (4)
abstracting: (p9<=1)
states: 1,667,300 (6)
abstracting: (1<=p96)
states: 58,464 (4)
abstracting: (p96<=1)
states: 1,667,300 (6)
........
EG iterations: 8
abstracting: (1<=p82)
states: 12,960 (4)
abstracting: (p82<=1)
states: 1,667,300 (6)
.abstracting: (1<=p59)
states: 1
abstracting: (p59<=1)
states: 1,667,300 (6)
.abstracting: (0<=p47)
states: 1,667,300 (6)
abstracting: (p47<=0)
states: 1,590,980 (6)
abstracting: (1<=p59)
states: 1
abstracting: (p59<=1)
states: 1,667,300 (6)
abstracting: (0<=p37)
states: 1,667,300 (6)
abstracting: (p37<=0)
states: 1,250,660 (6)
abstracting: (1<=p76)
states: 62,784 (4)
abstracting: (p76<=1)
states: 1,667,300 (6)
abstracting: (0<=p5)
states: 1,667,300 (6)
abstracting: (p5<=0)
states: 1,585,124 (6)
abstracting: (0<=p27)
states: 1,667,300 (6)
abstracting: (p27<=0)
states: 1,384,388 (6)
abstracting: (1<=p50)
states: 79,200 (4)
abstracting: (p50<=1)
states: 1,667,300 (6)
abstracting: (1<=p9)
states: 82,176 (4)
abstracting: (p9<=1)
states: 1,667,300 (6)
abstracting: (1<=p96)
states: 58,464 (4)
abstracting: (p96<=1)
states: 1,667,300 (6)
........
EG iterations: 8
abstracting: (1<=p82)
states: 12,960 (4)
abstracting: (p82<=1)
states: 1,667,300 (6)
.abstracting: (1<=p59)
states: 1
abstracting: (p59<=1)
states: 1,667,300 (6)
.abstracting: (0<=p47)
states: 1,667,300 (6)
abstracting: (p47<=0)
states: 1,590,980 (6)
abstracting: (1<=p59)
states: 1
abstracting: (p59<=1)
states: 1,667,300 (6)
abstracting: (0<=p37)
states: 1,667,300 (6)
abstracting: (p37<=0)
states: 1,250,660 (6)
abstracting: (1<=p76)
states: 62,784 (4)
abstracting: (p76<=1)
states: 1,667,300 (6)
abstracting: (0<=p5)
states: 1,667,300 (6)
abstracting: (p5<=0)
states: 1,585,124 (6)
abstracting: (0<=p27)
states: 1,667,300 (6)
abstracting: (p27<=0)
states: 1,384,388 (6)
abstracting: (1<=p50)
states: 79,200 (4)
abstracting: (p50<=1)
states: 1,667,300 (6)
EG iterations: 0
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.636sec
checking: [AF [EX [~ [E [[[p39<=0 & 0<=p39] | [p29<=1 & 1<=p29]] U [p25<=1 & 1<=p25]]]]] & [AX [[[p65<=1 & 1<=p65] & [EF [[p56<=0 & 0<=p56]] & AF [AG [[p56<=0 & 0<=p56]]]]]] | E [[EF [[[p68<=0 & 0<=p68] | [p78<=1 & 1<=p78]]] & [[[p2<=0 & 0<=p2] | [p48<=1 & 1<=p48]] & [p25<=0 & 0<=p25]]] U E [E [[[p45<=0 & 0<=p45] | [p85<=1 & 1<=p85]] U [[p13<=0 & 0<=p13] | [p43<=1 & 1<=p43]]] U EF [[p84<=1 & 1<=p84]]]]]]
normalized: [[~ [EX [~ [[[~ [EG [E [true U ~ [[p56<=0 & 0<=p56]]]]] & E [true U [p56<=0 & 0<=p56]]] & [p65<=1 & 1<=p65]]]]] | E [[[[p25<=0 & 0<=p25] & [[p48<=1 & 1<=p48] | [p2<=0 & 0<=p2]]] & E [true U [[p78<=1 & 1<=p78] | [p68<=0 & 0<=p68]]]] U E [E [[[p85<=1 & 1<=p85] | [p45<=0 & 0<=p45]] U [[p43<=1 & 1<=p43] | [p13<=0 & 0<=p13]]] U E [true U [p84<=1 & 1<=p84]]]]] & ~ [EG [~ [EX [~ [E [[[p29<=1 & 1<=p29] | [p39<=0 & 0<=p39]] U [p25<=1 & 1<=p25]]]]]]]]
abstracting: (1<=p25)
states: 267,552 (5)
abstracting: (p25<=1)
states: 1,667,300 (6)
abstracting: (0<=p39)
states: 1,667,300 (6)
abstracting: (p39<=0)
states: 1,250,417 (6)
abstracting: (1<=p29)
states: 283,155 (5)
abstracting: (p29<=1)
states: 1,667,300 (6)
before gc: list nodes free: 1462772
after gc: idd nodes used:748975, unused:63251025; list nodes free:288256182
...
EG iterations: 2
abstracting: (1<=p84)
states: 62,784 (4)
abstracting: (p84<=1)
states: 1,667,300 (6)
abstracting: (0<=p13)
states: 1,667,300 (6)
abstracting: (p13<=0)
states: 1,279,268 (6)
abstracting: (1<=p43)
states: 74,880 (4)
abstracting: (p43<=1)
states: 1,667,300 (6)
abstracting: (0<=p45)
states: 1,667,300 (6)
abstracting: (p45<=0)
states: 1,590,980 (6)
abstracting: (1<=p85)
states: 6,912 (3)
abstracting: (p85<=1)
states: 1,667,300 (6)
abstracting: (0<=p68)
states: 1,667,300 (6)
abstracting: (p68<=0)
states: 1,654,340 (6)
abstracting: (1<=p78)
states: 12,960 (4)
abstracting: (p78<=1)
states: 1,667,300 (6)
abstracting: (0<=p2)
states: 1,667,300 (6)
abstracting: (p2<=0)
states: 1,585,124 (6)
abstracting: (1<=p48)
states: 80,640 (4)
abstracting: (p48<=1)
states: 1,667,300 (6)
abstracting: (0<=p25)
states: 1,667,300 (6)
abstracting: (p25<=0)
states: 1,399,748 (6)
abstracting: (1<=p65)
states: 62,784 (4)
abstracting: (p65<=1)
states: 1,667,300 (6)
abstracting: (0<=p56)
states: 1,667,300 (6)
abstracting: (p56<=0)
states: 1,667,299 (6)
abstracting: (0<=p56)
states: 1,667,300 (6)
abstracting: (p56<=0)
states: 1,667,299 (6)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m44.156sec
totally nodes used: 80280116 (8.0e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 60269816 252725129 312994945
used/not used/entry size/cache size: 41097995 26010869 16 1024MB
basic ops cache: hits/miss/sum: 17420031 73285826 90705857
used/not used/entry size/cache size: 13219483 3557733 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: 176375 867417 1043792
used/not used/entry size/cache size: 131561 8257047 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 53771185
1 10434818
2 2262215
3 516888
4 103141
5 17559
6 2642
7 372
8 37
9 5
>= 10 2
Total processing time: 3m 9.878sec
BK_STOP 1678683110152
--------------------
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.000sec
iterations count:29537 (153), effective:1310 (6)
initing FirstDep: 0m 0.000sec
iterations count:3423 (17), effective:198 (1)
iterations count:222 (1), effective:1 (0)
iterations count:3567 (18), effective:210 (1)
iterations count:271 (1), effective:1 (0)
iterations count:453 (2), effective:15 (0)
iterations count:13122 (67), effective:638 (3)
iterations count:207 (1), effective:1 (0)
iterations count:193 (1), effective:0 (0)
iterations count:220 (1), effective:2 (0)
iterations count:3646 (18), effective:213 (1)
iterations count:22424 (116), effective:1184 (6)
iterations count:470 (2), effective:15 (0)
iterations count:193 (1), effective:0 (0)
iterations count:193 (1), effective:0 (0)
iterations count:3576 (18), effective:211 (1)
iterations count:13122 (67), effective:638 (3)
iterations count:3416 (17), effective:207 (1)
iterations count:232 (1), effective:5 (0)
iterations count:3778 (19), effective:208 (1)
iterations count:3748 (19), effective:207 (1)
iterations count:27077 (140), effective:1466 (7)
iterations count:18501 (95), effective:1040 (5)
iterations count:3587 (18), effective:211 (1)
iterations count:435 (2), effective:15 (0)
iterations count:3598 (18), effective:210 (1)
iterations count:3551 (18), effective:221 (1)
iterations count:3421 (17), effective:208 (1)
iterations count:3423 (17), effective:198 (1)
iterations count:2733 (14), effective:157 (0)
iterations count:193 (1), effective:0 (0)
iterations count:213 (1), effective:1 (0)
iterations count:193 (1), effective:0 (0)
iterations count:207 (1), effective:1 (0)
iterations count:27768 (143), effective:1524 (7)
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-05"
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-05, 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-167840348400265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-05.tgz
mv HealthRecord-PT-05 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 '
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 ;