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.r137-smll-167819418500449.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 ltsminxred
Input is DoubleExponent-PT-002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418500449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 33K 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 DoubleExponent-PT-002-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678856399105

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 05:00:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 05:00:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:00:02] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-15 05:00:02] [INFO ] Transformed 110 places.
[2023-03-15 05:00:02] [INFO ] Transformed 98 transitions.
[2023-03-15 05:00:02] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Support contains 82 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Applied a total of 0 rules in 21 ms. Remains 110 /110 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 110 cols
[2023-03-15 05:00:02] [INFO ] Computed 14 place invariants in 18 ms
[2023-03-15 05:00:02] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-15 05:00:02] [INFO ] Invariant cache hit.
[2023-03-15 05:00:02] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2023-03-15 05:00:02] [INFO ] Invariant cache hit.
[2023-03-15 05:00:02] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 110/110 places, 98/98 transitions.
Support contains 82 out of 110 places after structural reductions.
[2023-03-15 05:00:03] [INFO ] Flatten gal took : 43 ms
[2023-03-15 05:00:03] [INFO ] Flatten gal took : 19 ms
[2023-03-15 05:00:03] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 81 out of 110 places (down from 82) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 333 resets, run finished after 734 ms. (steps per millisecond=13 ) properties (out of 83) seen :34
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
[2023-03-15 05:00:05] [INFO ] Invariant cache hit.
[2023-03-15 05:00:05] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-15 05:00:05] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 05:00:05] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:48
[2023-03-15 05:00:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-15 05:00:06] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-15 05:00:06] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :21 sat :28
[2023-03-15 05:00:06] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 7 ms to minimize.
[2023-03-15 05:00:06] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2023-03-15 05:00:06] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2023-03-15 05:00:06] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2023-03-15 05:00:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 242 ms
[2023-03-15 05:00:06] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2023-03-15 05:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-15 05:00:06] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2023-03-15 05:00:07] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2023-03-15 05:00:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-03-15 05:00:07] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2023-03-15 05:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-15 05:00:07] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2023-03-15 05:00:07] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2023-03-15 05:00:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-03-15 05:00:07] [INFO ] After 1253ms SMT Verify possible using trap constraints in natural domain returned unsat :22 sat :27
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-15 05:00:07] [INFO ] After 1885ms SMT Verify possible using all constraints in natural domain returned unsat :22 sat :27
Fused 49 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 30 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 109 transition count 92
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 103 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 101 transition count 90
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 101 transition count 87
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 98 transition count 87
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 47 place count 86 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 84 transition count 75
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 56 place count 84 transition count 70
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 61 place count 79 transition count 70
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 66 place count 79 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 78 transition count 69
Applied a total of 67 rules in 54 ms. Remains 78 /110 variables (removed 32) and now considering 69/98 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 78/110 places, 69/98 transitions.
Incomplete random walk after 10000 steps, including 680 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :22
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 69 rows 78 cols
[2023-03-15 05:00:08] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-15 05:00:08] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 05:00:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 05:00:08] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 05:00:08] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 05:00:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:00:08] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-15 05:00:08] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2023-03-15 05:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-15 05:00:08] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-15 05:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-15 05:00:08] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-15 05:00:08] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 36 ms.
Support contains 9 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 69/69 transitions.
Graph (complete) has 160 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 76 transition count 60
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 67 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 67 transition count 59
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 21 place count 66 transition count 59
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 33 place count 60 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 35 place count 59 transition count 53
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 59 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 57 transition count 51
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 57 transition count 51
Applied a total of 41 rules in 24 ms. Remains 57 /78 variables (removed 21) and now considering 51/69 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 57/78 places, 51/69 transitions.
Incomplete random walk after 10000 steps, including 750 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 528 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 551 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 555 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 554 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Finished probabilistic random walk after 2734 steps, run visited all 5 properties in 24 ms. (steps per millisecond=113 )
Probabilistic random walk after 2734 steps, saw 1397 distinct states, run finished after 25 ms. (steps per millisecond=109 ) properties seen :5
Successfully simplified 22 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 05:00:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-15 05:00:09] [INFO ] Flatten gal took : 13 ms
[2023-03-15 05:00:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-002-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 05:00:09] [INFO ] Flatten gal took : 11 ms
[2023-03-15 05:00:09] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 54 out of 110 places (down from 55) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 178 edges and 110 vertex of which 104 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 98
Applied a total of 2 rules in 5 ms. Remains 108 /110 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 108/110 places, 98/98 transitions.
[2023-03-15 05:00:09] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:00:09] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:00:09] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 6 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 05:00:09] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:09] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:00:09] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 5 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 05:00:09] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:09] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:09] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 6 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:00:10] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 47 place count 82 transition count 70
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 55 place count 78 transition count 70
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 63 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 62 transition count 54
Applied a total of 86 rules in 26 ms. Remains 62 /110 variables (removed 48) and now considering 54/98 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 62/110 places, 54/98 transitions.
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 4 ms
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 5 ms
[2023-03-15 05:00:10] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 3 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:10] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 98
Applied a total of 2 rules in 3 ms. Remains 108 /110 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 108/110 places, 98/98 transitions.
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:10] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 47 place count 82 transition count 70
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 55 place count 78 transition count 70
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 63 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 62 transition count 54
Applied a total of 86 rules in 20 ms. Remains 62 /110 variables (removed 48) and now considering 54/98 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 62/110 places, 54/98 transitions.
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 4 ms
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 4 ms
[2023-03-15 05:00:10] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 6 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:10] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 105 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 49 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 77 transition count 69
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 87 place count 62 transition count 54
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 62 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 61 transition count 53
Applied a total of 90 rules in 15 ms. Remains 61 /110 variables (removed 49) and now considering 53/98 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 61/110 places, 53/98 transitions.
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 4 ms
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 5 ms
[2023-03-15 05:00:10] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 2 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:10] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 98
Applied a total of 3 rules in 2 ms. Remains 107 /110 variables (removed 3) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 107/110 places, 98/98 transitions.
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:10] [INFO ] Input system was already deterministic with 98 transitions.
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:10] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:10] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-15 05:00:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 98 transitions and 276 arcs took 2 ms.
Total runtime 8453 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/513/ctl_0_ --ctl=/tmp/513/ctl_1_ --ctl=/tmp/513/ctl_2_ --ctl=/tmp/513/ctl_3_ --ctl=/tmp/513/ctl_4_ --ctl=/tmp/513/ctl_5_ --ctl=/tmp/513/ctl_6_ --ctl=/tmp/513/ctl_7_ --ctl=/tmp/513/ctl_8_ --ctl=/tmp/513/ctl_9_ --ctl=/tmp/513/ctl_10_ --ctl=/tmp/513/ctl_11_ --mu-par --mu-opt
FORMULA DoubleExponent-PT-002-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678856416542

--------------------
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
mcc2023
ctl formula name DoubleExponent-PT-002-CTLCardinality-00
ctl formula formula --ctl=/tmp/513/ctl_0_
ctl formula name DoubleExponent-PT-002-CTLCardinality-02
ctl formula formula --ctl=/tmp/513/ctl_1_
ctl formula name DoubleExponent-PT-002-CTLCardinality-03
ctl formula formula --ctl=/tmp/513/ctl_2_
ctl formula name DoubleExponent-PT-002-CTLCardinality-04
ctl formula formula --ctl=/tmp/513/ctl_3_
ctl formula name DoubleExponent-PT-002-CTLCardinality-05
ctl formula formula --ctl=/tmp/513/ctl_4_
ctl formula name DoubleExponent-PT-002-CTLCardinality-06
ctl formula formula --ctl=/tmp/513/ctl_5_
ctl formula name DoubleExponent-PT-002-CTLCardinality-08
ctl formula formula --ctl=/tmp/513/ctl_6_
ctl formula name DoubleExponent-PT-002-CTLCardinality-09
ctl formula formula --ctl=/tmp/513/ctl_7_
ctl formula name DoubleExponent-PT-002-CTLCardinality-10
ctl formula formula --ctl=/tmp/513/ctl_8_
ctl formula name DoubleExponent-PT-002-CTLCardinality-12
ctl formula formula --ctl=/tmp/513/ctl_9_
ctl formula name DoubleExponent-PT-002-CTLCardinality-14
ctl formula formula --ctl=/tmp/513/ctl_10_
ctl formula name DoubleExponent-PT-002-CTLCardinality-15
ctl formula formula --ctl=/tmp/513/ctl_11_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 110 places, 98 transitions and 276 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 98->98 groups
pnml2lts-sym: Regrouping took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 110; there are 98 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 8176 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.080 real 0.270 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 3708 states, 4575 nodes
pnml2lts-sym: Formula /tmp/513/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/513/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/513/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/513/ctl_2_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/513/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/513/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/513/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/513/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/513/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/513/ctl_7_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/513/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/513/ctl_8_ does not hold for the initial state
pnml2lts-sym: group_next: 894 nodes total
pnml2lts-sym: group_explored: 978 nodes, 786 short vectors total
pnml2lts-sym: max token count: 16

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="DoubleExponent-PT-002"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DoubleExponent-PT-002, 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 r137-smll-167819418500449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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