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.r106-tall-167814483000617.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 DLCround-PT-03a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483000617
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 25 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 148K 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 DLCround-PT-03a-CTLCardinality-00
FORMULA_NAME DLCround-PT-03a-CTLCardinality-01
FORMULA_NAME DLCround-PT-03a-CTLCardinality-02
FORMULA_NAME DLCround-PT-03a-CTLCardinality-03
FORMULA_NAME DLCround-PT-03a-CTLCardinality-04
FORMULA_NAME DLCround-PT-03a-CTLCardinality-05
FORMULA_NAME DLCround-PT-03a-CTLCardinality-06
FORMULA_NAME DLCround-PT-03a-CTLCardinality-07
FORMULA_NAME DLCround-PT-03a-CTLCardinality-08
FORMULA_NAME DLCround-PT-03a-CTLCardinality-09
FORMULA_NAME DLCround-PT-03a-CTLCardinality-10
FORMULA_NAME DLCround-PT-03a-CTLCardinality-11
FORMULA_NAME DLCround-PT-03a-CTLCardinality-12
FORMULA_NAME DLCround-PT-03a-CTLCardinality-13
FORMULA_NAME DLCround-PT-03a-CTLCardinality-14
FORMULA_NAME DLCround-PT-03a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678445627005

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=DLCround-PT-03a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 10:53:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 10:53:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:53:48] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-10 10:53:48] [INFO ] Transformed 113 places.
[2023-03-10 10:53:48] [INFO ] Transformed 617 transitions.
[2023-03-10 10:53:48] [INFO ] Found NUPN structural information;
[2023-03-10 10:53:48] [INFO ] Parsed PT model containing 113 places and 617 transitions and 2269 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
Support contains 72 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 545/545 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 526
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 526
Drop transitions removed 165 transitions
Redundant transition composition rules discarded 165 transitions
Iterating global reduction 0 with 165 rules applied. Total rules applied 171 place count 110 transition count 361
Applied a total of 171 rules in 28 ms. Remains 110 /113 variables (removed 3) and now considering 361/545 (removed 184) transitions.
[2023-03-10 10:53:48] [INFO ] Flow matrix only has 103 transitions (discarded 258 similar events)
// Phase 1: matrix 103 rows 110 cols
[2023-03-10 10:53:48] [INFO ] Computed 52 place invariants in 11 ms
[2023-03-10 10:53:49] [INFO ] Implicit Places using invariants in 442 ms returned [66, 70, 71, 76, 77, 86, 87, 88, 90, 95, 97, 101, 102, 103, 105, 107]
Discarding 16 places :
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Implicit Place search using SMT only with invariants took 469 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/113 places, 307/545 transitions.
Drop transitions removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 94 transition count 145
Applied a total of 162 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 145/307 (removed 162) transitions.
[2023-03-10 10:53:49] [INFO ] Flow matrix only has 103 transitions (discarded 42 similar events)
// Phase 1: matrix 103 rows 94 cols
[2023-03-10 10:53:49] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-10 10:53:49] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-10 10:53:49] [INFO ] Flow matrix only has 103 transitions (discarded 42 similar events)
[2023-03-10 10:53:49] [INFO ] Invariant cache hit.
[2023-03-10 10:53:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 10:53:49] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 94/113 places, 145/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 623 ms. Remains : 94/113 places, 145/545 transitions.
Support contains 72 out of 94 places after structural reductions.
[2023-03-10 10:53:49] [INFO ] Flatten gal took : 26 ms
[2023-03-10 10:53:49] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DLCround-PT-03a-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 10:53:49] [INFO ] Flatten gal took : 10 ms
[2023-03-10 10:53:49] [INFO ] Input system was already deterministic with 145 transitions.
Support contains 62 out of 94 places (down from 72) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 49) seen :34
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-10 10:53:50] [INFO ] Flow matrix only has 103 transitions (discarded 42 similar events)
[2023-03-10 10:53:50] [INFO ] Invariant cache hit.
[2023-03-10 10:53:50] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-10 10:53:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-10 10:53:50] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :0
Fused 15 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 15 atomic propositions for a total of 14 simplifications.
FORMULA DLCround-PT-03a-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 10:53:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 8 ms
[2023-03-10 10:53:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DLCround-PT-03a-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 11 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 145 transitions.
Support contains 32 out of 94 places (down from 44) after GAL structural reductions.
Computed a total of 29 stabilizing places and 1 stable transitions
Graph (complete) has 190 edges and 94 vertex of which 70 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 145/145 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 72 transition count 145
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 37 place count 57 transition count 115
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 57 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 57 transition count 111
Applied a total of 56 rules in 5 ms. Remains 57 /94 variables (removed 37) and now considering 111/145 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 57/94 places, 111/145 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 145/145 transitions.
Graph (trivial) has 136 edges and 94 vertex of which 60 / 94 are part of one of the 8 SCC in 2 ms
Free SCC test removed 52 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Graph (complete) has 70 edges and 42 vertex of which 19 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 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 19 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 18 transition count 24
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 14 place count 8 transition count 10
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 8 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 8 transition count 9
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 29 place count 6 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 6 transition count 6
Applied a total of 30 rules in 10 ms. Remains 6 /94 variables (removed 88) and now considering 6/145 (removed 139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 6/94 places, 6/145 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 0 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 0 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 145/145 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 72 transition count 145
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 37 place count 57 transition count 115
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 57 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 57 transition count 111
Applied a total of 56 rules in 3 ms. Remains 57 /94 variables (removed 37) and now considering 111/145 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/94 places, 111/145 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 145/145 transitions.
Graph (trivial) has 125 edges and 94 vertex of which 50 / 94 are part of one of the 7 SCC in 0 ms
Free SCC test removed 43 places
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Graph (complete) has 89 edges and 51 vertex of which 27 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 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 27 transition count 43
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 26 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 24 transition count 41
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 18 place count 14 transition count 25
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 14 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 31 place count 14 transition count 22
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 33 place count 13 transition count 21
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 5 with 4 rules applied. Total rules applied 37 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 39 place count 11 transition count 17
Applied a total of 39 rules in 5 ms. Remains 11 /94 variables (removed 83) and now considering 17/145 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 11/94 places, 17/145 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 1 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 1 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 145/145 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 72 transition count 145
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 35 place count 59 transition count 119
Iterating global reduction 1 with 13 rules applied. Total rules applied 48 place count 59 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 59 transition count 117
Applied a total of 50 rules in 3 ms. Remains 59 /94 variables (removed 35) and now considering 117/145 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 59/94 places, 117/145 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 145/145 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 70 transition count 145
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 38 place count 56 transition count 117
Iterating global reduction 1 with 14 rules applied. Total rules applied 52 place count 56 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 56 transition count 113
Applied a total of 56 rules in 3 ms. Remains 56 /94 variables (removed 38) and now considering 113/145 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 56/94 places, 113/145 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 145/145 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 70 transition count 145
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 40 place count 54 transition count 113
Iterating global reduction 1 with 16 rules applied. Total rules applied 56 place count 54 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 60 place count 54 transition count 109
Applied a total of 60 rules in 3 ms. Remains 54 /94 variables (removed 40) and now considering 109/145 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 54/94 places, 109/145 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 145/145 transitions.
Graph (trivial) has 134 edges and 94 vertex of which 58 / 94 are part of one of the 8 SCC in 0 ms
Free SCC test removed 50 places
Ensure Unique test removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Graph (complete) has 73 edges and 44 vertex of which 20 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 13 edges and 9 vertex of which 6 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 4 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 36 place count 3 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 37 place count 3 transition count 3
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 39 place count 2 transition count 3
Applied a total of 39 rules in 3 ms. Remains 2 /94 variables (removed 92) and now considering 3/145 (removed 142) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 2/94 places, 3/145 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 0 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 1 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 145/145 transitions.
Graph (trivial) has 130 edges and 94 vertex of which 59 / 94 are part of one of the 8 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Graph (complete) has 73 edges and 43 vertex of which 19 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 9 edges and 8 vertex of which 5 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 4 transition count 16
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 31 place count 4 transition count 9
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 4 transition count 5
Applied a total of 35 rules in 2 ms. Remains 4 /94 variables (removed 90) and now considering 5/145 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 4/94 places, 5/145 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 0 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 0 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 145/145 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 75 transition count 145
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 32 place count 62 transition count 119
Iterating global reduction 1 with 13 rules applied. Total rules applied 45 place count 62 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 62 transition count 116
Applied a total of 48 rules in 3 ms. Remains 62 /94 variables (removed 32) and now considering 116/145 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 62/94 places, 116/145 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:53:50] [INFO ] Input system was already deterministic with 116 transitions.
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 4 ms
[2023-03-10 10:53:50] [INFO ] Flatten gal took : 5 ms
[2023-03-10 10:53:50] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-10 10:53:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 145 transitions and 341 arcs took 1 ms.
Total runtime 1935 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: 94 NrTr: 145 NrArc: 341)

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

net check time: 0m 0.000sec

init dd package: 0m 2.804sec


RS generation: 0m 0.008sec


-> reachability set: #nodes 435 (4.4e+02) #states 15,876,001 (7)



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

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

abstracting: (0<=0)
states: 15,876,001 (7)
.-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

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

abstracting: (0<=p74)
states: 15,876,001 (7)
abstracting: (p74<=0)
states: 1
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [AG [AF [[p11<=1 & 1<=p11]]]]
normalized: E [true U ~ [E [true U EG [~ [[p11<=1 & 1<=p11]]]]]]

abstracting: (1<=p11)
states: 2,646,000 (6)
abstracting: (p11<=1)
states: 15,876,001 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [AF [[[p30<=0 & 0<=p30] | [p2<=1 & 1<=p2]]]]
normalized: ~ [E [true U EG [~ [[[p2<=1 & 1<=p2] | [p30<=0 & 0<=p30]]]]]]

abstracting: (0<=p30)
states: 15,876,001 (7)
abstracting: (p30<=0)
states: 14,288,401 (7)
abstracting: (1<=p2)
states: 2,268,000 (6)
abstracting: (p2<=1)
states: 15,876,001 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[EF [[[p29<=1 & 1<=p29] | [p69<=0 & 0<=p69]]] & EX [[p67<=1 & 1<=p67]]]]
normalized: ~ [E [true U ~ [[EX [[p67<=1 & 1<=p67]] & E [true U [[p69<=0 & 0<=p69] | [p29<=1 & 1<=p29]]]]]]]

abstracting: (1<=p29)
states: 1,587,600 (6)
abstracting: (p29<=1)
states: 15,876,001 (7)
abstracting: (0<=p69)
states: 15,876,001 (7)
abstracting: (p69<=0)
states: 1
abstracting: (1<=p67)
states: 15,876,000 (7)
abstracting: (p67<=1)
states: 15,876,001 (7)
.-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [EF [~ [A [[[p34<=0 & 0<=p34] | [p20<=1 & 1<=p20]] U [p0<=1 & 1<=p0]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [[~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [[[p20<=1 & 1<=p20] | [p34<=0 & 0<=p34]]] & ~ [[p0<=1 & 1<=p0]]]]]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 15,876,001 (7)
abstracting: (0<=p34)
states: 15,876,001 (7)
abstracting: (p34<=0)
states: 14,288,401 (7)
abstracting: (1<=p20)
states: 2,268,000 (6)
abstracting: (p20<=1)
states: 15,876,001 (7)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 15,876,001 (7)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 15,876,001 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EG [E [[[p45<=1 & 1<=p45] | EF [[p78<=1 & 1<=p78]]] U ~ [EX [[p30<=0 & 0<=p30]]]]]
normalized: EG [E [[E [true U [p78<=1 & 1<=p78]] | [p45<=1 & 1<=p45]] U ~ [EX [[p30<=0 & 0<=p30]]]]]

abstracting: (0<=p30)
states: 15,876,001 (7)
abstracting: (p30<=0)
states: 14,288,401 (7)
.abstracting: (1<=p45)
states: 1,587,600 (6)
abstracting: (p45<=1)
states: 15,876,001 (7)
abstracting: (1<=p78)
states: 15,876,000 (7)
abstracting: (p78<=1)
states: 15,876,001 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [AG [[EX [[p68<=0 & 0<=p68]] | [EG [[p83<=1 & 1<=p83]] & EF [[[p29<=0 & 0<=p29] | [p5<=1 & 1<=p5]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[E [true U [[p5<=1 & 1<=p5] | [p29<=0 & 0<=p29]]] & EG [[p83<=1 & 1<=p83]]] | EX [[p68<=0 & 0<=p68]]]]]]]

abstracting: (0<=p68)
states: 15,876,001 (7)
abstracting: (p68<=0)
states: 1
.abstracting: (1<=p83)
states: 15,876,000 (7)
abstracting: (p83<=1)
states: 15,876,001 (7)
.
EG iterations: 1
abstracting: (0<=p29)
states: 15,876,001 (7)
abstracting: (p29<=0)
states: 14,288,401 (7)
abstracting: (1<=p5)
states: 2,268,000 (6)
abstracting: (p5<=1)
states: 15,876,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [EF [[E [[~ [[[p45<=0 & 0<=p45] | [p28<=1 & 1<=p28]]] & [[p9<=1 & 1<=p9] & [[p71<=0 & 0<=p71] | [p23<=1 & 1<=p23]]]] U [p84<=0 & 0<=p84]] | EX [[[p4<=0 & 0<=p4] & [p1<=1 & 1<=p1]]]]]]
normalized: ~ [E [true U ~ [E [true U [EX [[[p1<=1 & 1<=p1] & [p4<=0 & 0<=p4]]] | E [[[[[p23<=1 & 1<=p23] | [p71<=0 & 0<=p71]] & [p9<=1 & 1<=p9]] & ~ [[[p28<=1 & 1<=p28] | [p45<=0 & 0<=p45]]]] U [p84<=0 & 0<=p84]]]]]]]

abstracting: (0<=p84)
states: 15,876,001 (7)
abstracting: (p84<=0)
states: 1
abstracting: (0<=p45)
states: 15,876,001 (7)
abstracting: (p45<=0)
states: 14,288,401 (7)
abstracting: (1<=p28)
states: 1,587,600 (6)
abstracting: (p28<=1)
states: 15,876,001 (7)
abstracting: (1<=p9)
states: 2,646,000 (6)
abstracting: (p9<=1)
states: 15,876,001 (7)
abstracting: (0<=p71)
states: 15,876,001 (7)
abstracting: (p71<=0)
states: 1
abstracting: (1<=p23)
states: 2,646,000 (6)
abstracting: (p23<=1)
states: 15,876,001 (7)
abstracting: (0<=p4)
states: 15,876,001 (7)
abstracting: (p4<=0)
states: 13,608,001 (7)
abstracting: (1<=p1)
states: 2,268,000 (6)
abstracting: (p1<=1)
states: 15,876,001 (7)
.-> the formula is TRUE

FORMULA DLCround-PT-03a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [EG [EF [AX [EF [[p68<=0 & 0<=p68]]]]] & EF [[[AG [[~ [[p39<=1 & 1<=p39]] & ~ [[p92<=1 & 1<=p92]]]] & [[[[p7<=0 & 0<=p7] & [p4<=1 & 1<=p4]] | [[p18<=0 & 0<=p18] & [p83<=1 & 1<=p83]]] | [[[p10<=0 & 0<=p10] & [p3<=1 & 1<=p3]] | [p28<=1 & 1<=p28]]]] | [[[p53<=1 & 1<=p53] | [[p36<=0 & 0<=p36] | [p86<=1 & 1<=p86]]] & [[p2<=0 & 0<=p2] & [p75<=1 & 1<=p75]]]]]]
normalized: [E [true U [[[[p75<=1 & 1<=p75] & [p2<=0 & 0<=p2]] & [[[p86<=1 & 1<=p86] | [p36<=0 & 0<=p36]] | [p53<=1 & 1<=p53]]] | [[[[p28<=1 & 1<=p28] | [[p3<=1 & 1<=p3] & [p10<=0 & 0<=p10]]] | [[[p83<=1 & 1<=p83] & [p18<=0 & 0<=p18]] | [[p4<=1 & 1<=p4] & [p7<=0 & 0<=p7]]]] & ~ [E [true U ~ [[~ [[p92<=1 & 1<=p92]] & ~ [[p39<=1 & 1<=p39]]]]]]]]] & EG [E [true U ~ [EX [~ [E [true U [p68<=0 & 0<=p68]]]]]]]]

abstracting: (0<=p68)
states: 15,876,001 (7)
abstracting: (p68<=0)
states: 1
..
EG iterations: 1
abstracting: (1<=p39)
states: 1,587,600 (6)
abstracting: (p39<=1)
states: 15,876,001 (7)
abstracting: (1<=p92)
states: 15,876,000 (7)
abstracting: (p92<=1)
states: 15,876,001 (7)
abstracting: (0<=p7)
states: 15,876,001 (7)
abstracting: (p7<=0)
states: 13,608,001 (7)
abstracting: (1<=p4)
states: 2,268,000 (6)
abstracting: (p4<=1)
states: 15,876,001 (7)
abstracting: (0<=p18)
states: 15,876,001 (7)
abstracting: (p18<=0)
states: 13,608,001 (7)
abstracting: (1<=p83)
states: 15,876,000 (7)
abstracting: (p83<=1)
states: 15,876,001 (7)
abstracting: (0<=p10)
states: 15,876,001 (7)
abstracting: (p10<=0)
states: 13,230,001 (7)
abstracting: (1<=p3)
states: 2,268,000 (6)
abstracting: (p3<=1)
states: 15,876,001 (7)
abstracting: (1<=p28)
states: 1,587,600 (6)
abstracting: (p28<=1)
states: 15,876,001 (7)
abstracting: (1<=p53)
states: 1,587,600 (6)
abstracting: (p53<=1)
states: 15,876,001 (7)
abstracting: (0<=p36)
states: 15,876,001 (7)
abstracting: (p36<=0)
states: 14,288,401 (7)
abstracting: (1<=p86)
states: 15,876,000 (7)
abstracting: (p86<=1)
states: 15,876,001 (7)
abstracting: (0<=p2)
states: 15,876,001 (7)
abstracting: (p2<=0)
states: 13,608,001 (7)
abstracting: (1<=p75)
states: 15,876,000 (7)
abstracting: (p75<=1)
states: 15,876,001 (7)
-> the formula is FALSE

FORMULA DLCround-PT-03a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 15540 (1.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 56696 161661 218357
used/not used/entry size/cache size: 169022 66939842 16 1024MB
basic ops cache: hits/miss/sum: 8216 20757 28973
used/not used/entry size/cache size: 37084 16740132 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: 919 1891 2810
used/not used/entry size/cache size: 1891 8386717 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 67093392
1 15404
2 68
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.445sec


BK_STOP 1678445636082

--------------------
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:920 (6), effective:58 (0)

initing FirstDep: 0m 0.000sec


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

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

iterations count:372 (2), effective:11 (0)

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

iterations count:245 (1), effective:10 (0)

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

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

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

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

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

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

iterations count:197 (1), effective:5 (0)

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

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

iterations count:291 (2), effective:2 (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="DLCround-PT-03a"
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 DLCround-PT-03a, 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 r106-tall-167814483000617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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