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-167819418500450.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418500450
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-01
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-02
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-03
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-04
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-05
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-06
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-07
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-08
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-09
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-10
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-11
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-12
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-13
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-14
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678856426310

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=CTLFireability
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:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 05:00:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:00:29] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-15 05:00:29] [INFO ] Transformed 110 places.
[2023-03-15 05:00:29] [INFO ] Transformed 98 transitions.
[2023-03-15 05:00:29] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 75 out of 110 places. Attempting structural reductions.
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 23 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-15 05:00:29] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-15 05:00:29] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-15 05:00:29] [INFO ] Invariant cache hit.
[2023-03-15 05:00:30] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2023-03-15 05:00:30] [INFO ] Invariant cache hit.
[2023-03-15 05:00:30] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 106/110 places, 98/98 transitions.
Support contains 75 out of 106 places after structural reductions.
[2023-03-15 05:00:30] [INFO ] Flatten gal took : 48 ms
[2023-03-15 05:00:30] [INFO ] Flatten gal took : 17 ms
[2023-03-15 05:00:30] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 335 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 64) seen :29
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) 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 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :4
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) 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 31) seen :0
Running SMT prover for 31 properties.
[2023-03-15 05:00:32] [INFO ] Invariant cache hit.
[2023-03-15 05:00:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:00:32] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-15 05:00:32] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:29
[2023-03-15 05:00:32] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 9 ms to minimize.
[2023-03-15 05:00:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-15 05:00:32] [INFO ] After 216ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:30
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-15 05:00:32] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-15 05:00:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:00:33] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 05:00:33] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :20
[2023-03-15 05:00:33] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2023-03-15 05:00:33] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2023-03-15 05:00:33] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2023-03-15 05:00:33] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2023-03-15 05:00:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 287 ms
[2023-03-15 05:00:33] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2023-03-15 05:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-15 05:00:34] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2023-03-15 05:00:34] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2023-03-15 05:00:34] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2023-03-15 05:00:34] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2023-03-15 05:00:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 243 ms
[2023-03-15 05:00:34] [INFO ] After 1129ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :20
Attempting to minimize the solution found.
Minimization took 197 ms.
[2023-03-15 05:00:34] [INFO ] After 1634ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :20
Fused 31 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 296 ms.
Support contains 32 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 98/98 transitions.
Graph (complete) has 173 edges and 106 vertex of which 105 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 8 rules applied. Total rules applied 9 place count 104 transition count 91
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 12 rules applied. Total rules applied 21 place count 98 transition count 85
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 27 place count 92 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 27 place count 92 transition count 80
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 37 place count 87 transition count 80
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 51 place count 80 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 55 place count 78 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 78 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 77 transition count 72
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 77 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 76 transition count 71
Applied a total of 60 rules in 42 ms. Remains 76 /106 variables (removed 30) and now considering 71/98 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 76/106 places, 71/98 transitions.
Incomplete random walk after 10000 steps, including 504 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 20) seen :6
Incomplete Best-First random walk after 10000 steps, including 429 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 396 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 416 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10000 steps, including 417 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 422 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 421 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 418 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 423 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 405 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 430 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 407 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 71 rows 76 cols
[2023-03-15 05:00:37] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-15 05:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:00:37] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-15 05:00:37] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-15 05:00:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 05:00:37] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-15 05:00:37] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-15 05:00:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 05:00:37] [INFO ] After 71ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-15 05:00:37] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2023-03-15 05:00:37] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2023-03-15 05:00:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-03-15 05:00:37] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-15 05:00:37] [INFO ] After 523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 96 ms.
Support contains 19 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 71/71 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 76 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 73 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 73 transition count 67
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 8 place count 72 transition count 67
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 66 transition count 61
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 66 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 65 transition count 60
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 65 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 64 transition count 59
Applied a total of 25 rules in 26 ms. Remains 64 /76 variables (removed 12) and now considering 59/71 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 64/76 places, 59/71 transitions.
Incomplete random walk after 10000 steps, including 713 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 566 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 573 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 555 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 551 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 554 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 548 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 552 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 561 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 537 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 569 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Finished probabilistic random walk after 299 steps, run visited all 10 properties in 12 ms. (steps per millisecond=24 )
Probabilistic random walk after 299 steps, saw 161 distinct states, run finished after 12 ms. (steps per millisecond=24 ) properties seen :10
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 05:00:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 13 ms
[2023-03-15 05:00:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DoubleExponent-PT-002-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 10 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 59 out of 106 places (down from 64) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 173 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 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 24 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 48 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 48 place count 81 transition count 69
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 77 transition count 69
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 82 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 63 transition count 55
Applied a total of 83 rules in 27 ms. Remains 63 /106 variables (removed 43) and now considering 55/98 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 63/106 places, 55/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 5 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 5 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 105 transition count 77
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 85 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 84 transition count 76
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 42 place count 84 transition count 71
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 52 place count 79 transition count 71
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 80 place count 65 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 64 transition count 56
Applied a total of 81 rules in 21 ms. Remains 64 /106 variables (removed 42) and now considering 56/98 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 64/106 places, 56/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 5 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:00:40] [INFO ] Input system was already deterministic with 98 transitions.
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 10 ms
[2023-03-15 05:00:40] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:00:40] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-15 05:00:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 98 transitions and 272 arcs took 1 ms.
Total runtime 11511 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/514/ctl_0_ --ctl=/tmp/514/ctl_1_ --ctl=/tmp/514/ctl_2_ --ctl=/tmp/514/ctl_3_ --ctl=/tmp/514/ctl_4_ --ctl=/tmp/514/ctl_5_ --ctl=/tmp/514/ctl_6_ --ctl=/tmp/514/ctl_7_ --ctl=/tmp/514/ctl_8_ --ctl=/tmp/514/ctl_9_ --ctl=/tmp/514/ctl_10_ --ctl=/tmp/514/ctl_11_ --mu-par --mu-opt
FORMULA DoubleExponent-PT-002-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-002-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678856443955

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name DoubleExponent-PT-002-CTLFireability-00
ctl formula formula --ctl=/tmp/514/ctl_0_
ctl formula name DoubleExponent-PT-002-CTLFireability-01
ctl formula formula --ctl=/tmp/514/ctl_1_
ctl formula name DoubleExponent-PT-002-CTLFireability-05
ctl formula formula --ctl=/tmp/514/ctl_2_
ctl formula name DoubleExponent-PT-002-CTLFireability-06
ctl formula formula --ctl=/tmp/514/ctl_3_
ctl formula name DoubleExponent-PT-002-CTLFireability-07
ctl formula formula --ctl=/tmp/514/ctl_4_
ctl formula name DoubleExponent-PT-002-CTLFireability-08
ctl formula formula --ctl=/tmp/514/ctl_5_
ctl formula name DoubleExponent-PT-002-CTLFireability-10
ctl formula formula --ctl=/tmp/514/ctl_6_
ctl formula name DoubleExponent-PT-002-CTLFireability-11
ctl formula formula --ctl=/tmp/514/ctl_7_
ctl formula name DoubleExponent-PT-002-CTLFireability-12
ctl formula formula --ctl=/tmp/514/ctl_8_
ctl formula name DoubleExponent-PT-002-CTLFireability-13
ctl formula formula --ctl=/tmp/514/ctl_9_
ctl formula name DoubleExponent-PT-002-CTLFireability-14
ctl formula formula --ctl=/tmp/514/ctl_10_
ctl formula name DoubleExponent-PT-002-CTLFireability-15
ctl formula formula --ctl=/tmp/514/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 106 places, 98 transitions and 272 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.010 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 106; 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 9744 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.080 real 0.310 user 0.020 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, 3554 nodes
pnml2lts-sym: Formula /tmp/514/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/514/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/514/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/514/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/514/ctl_6_ 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/514/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/514/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/514/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/514/ctl_8_ holds for the initial state
pnml2lts-sym: Formula /tmp/514/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/514/ctl_10_ holds for the initial state
pnml2lts-sym: Formula /tmp/514/ctl_5_ holds for the initial state
pnml2lts-sym: group_next: 796 nodes total
pnml2lts-sym: group_explored: 891 nodes, 647 short vectors total
pnml2lts-sym: max token count: 4

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="CTLFireability"
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 CTLFireability"
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-167819418500450"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;