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.r521-tall-167987246100010.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 Anderson-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 185K Mar 31 16:48 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 Anderson-PT-05-CTLFireability-00
FORMULA_NAME Anderson-PT-05-CTLFireability-01
FORMULA_NAME Anderson-PT-05-CTLFireability-02
FORMULA_NAME Anderson-PT-05-CTLFireability-03
FORMULA_NAME Anderson-PT-05-CTLFireability-04
FORMULA_NAME Anderson-PT-05-CTLFireability-05
FORMULA_NAME Anderson-PT-05-CTLFireability-06
FORMULA_NAME Anderson-PT-05-CTLFireability-07
FORMULA_NAME Anderson-PT-05-CTLFireability-08
FORMULA_NAME Anderson-PT-05-CTLFireability-09
FORMULA_NAME Anderson-PT-05-CTLFireability-10
FORMULA_NAME Anderson-PT-05-CTLFireability-11
FORMULA_NAME Anderson-PT-05-CTLFireability-12
FORMULA_NAME Anderson-PT-05-CTLFireability-13
FORMULA_NAME Anderson-PT-05-CTLFireability-14
FORMULA_NAME Anderson-PT-05-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680853508609

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=Anderson-PT-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 07:45:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 07:45:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 07:45:11] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-04-07 07:45:11] [INFO ] Transformed 161 places.
[2023-04-07 07:45:11] [INFO ] Transformed 365 transitions.
[2023-04-07 07:45:11] [INFO ] Found NUPN structural information;
[2023-04-07 07:45:11] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Support contains 77 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 348
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 348
Applied a total of 18 rules in 37 ms. Remains 152 /161 variables (removed 9) and now considering 348/365 (removed 17) transitions.
// Phase 1: matrix 348 rows 152 cols
[2023-04-07 07:45:11] [INFO ] Computed 13 invariants in 40 ms
[2023-04-07 07:45:11] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-04-07 07:45:11] [INFO ] Invariant cache hit.
[2023-04-07 07:45:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 07:45:12] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2023-04-07 07:45:12] [INFO ] Invariant cache hit.
[2023-04-07 07:45:12] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/161 places, 348/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1106 ms. Remains : 152/161 places, 348/365 transitions.
Support contains 77 out of 152 places after structural reductions.
[2023-04-07 07:45:12] [INFO ] Flatten gal took : 96 ms
[2023-04-07 07:45:12] [INFO ] Flatten gal took : 61 ms
[2023-04-07 07:45:12] [INFO ] Input system was already deterministic with 348 transitions.
Support contains 76 out of 152 places (down from 77) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 66) seen :43
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-04-07 07:45:13] [INFO ] Invariant cache hit.
[2023-04-07 07:45:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-04-07 07:45:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 07:45:14] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-07 07:45:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-04-07 07:45:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 07:45:14] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :9
[2023-04-07 07:45:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 07:45:15] [INFO ] After 239ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :4 sat :9
[2023-04-07 07:45:15] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :9
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-04-07 07:45:15] [INFO ] After 1263ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :9
Fused 13 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 13 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 348/348 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 152 transition count 329
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 133 transition count 329
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 62 place count 109 transition count 201
Iterating global reduction 0 with 24 rules applied. Total rules applied 86 place count 109 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 108 transition count 200
Applied a total of 88 rules in 28 ms. Remains 108 /152 variables (removed 44) and now considering 200/348 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 108/152 places, 200/348 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 200 rows 108 cols
[2023-04-07 07:45:16] [INFO ] Computed 13 invariants in 4 ms
[2023-04-07 07:45:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-04-07 07:45:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-04-07 07:45:16] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-04-07 07:45:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 07:45:16] [INFO ] After 17ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 07:45:16] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 07:45:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-04-07 07:45:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2023-04-07 07:45:16] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 07:45:16] [INFO ] After 39ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 07:45:16] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-04-07 07:45:17] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 200/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 106 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 106 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 105 transition count 181
Applied a total of 6 rules in 36 ms. Remains 105 /108 variables (removed 3) and now considering 181/200 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 105/108 places, 181/200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 181 rows 105 cols
[2023-04-07 07:45:17] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 07:45:17] [INFO ] [Real]Absence check using 6 positive place invariants in 53 ms returned sat
[2023-04-07 07:45:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 48 ms returned sat
[2023-04-07 07:45:17] [INFO ] After 63ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-04-07 07:45:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 07:45:17] [INFO ] After 13ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 07:45:17] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 07:45:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-04-07 07:45:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 18 ms returned sat
[2023-04-07 07:45:17] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 07:45:17] [INFO ] After 32ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 07:45:17] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-04-07 07:45:17] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 181/181 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 172
Applied a total of 2 rules in 17 ms. Remains 104 /105 variables (removed 1) and now considering 172/181 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 104/105 places, 172/181 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 172 rows 104 cols
[2023-04-07 07:45:18] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 07:45:18] [INFO ] [Real]Absence check using 6 positive place invariants in 32 ms returned sat
[2023-04-07 07:45:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-04-07 07:45:18] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 07:45:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 07:45:18] [INFO ] After 13ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 07:45:18] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 07:45:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-04-07 07:45:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 07:45:18] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 07:45:18] [INFO ] After 15ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 07:45:18] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 07:45:18] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA Anderson-PT-05-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 07:45:18] [INFO ] Flatten gal took : 22 ms
[2023-04-07 07:45:18] [INFO ] Flatten gal took : 21 ms
[2023-04-07 07:45:18] [INFO ] Input system was already deterministic with 348 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 328
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 328
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 67 place count 105 transition count 181
Iterating global reduction 0 with 27 rules applied. Total rules applied 94 place count 105 transition count 181
Applied a total of 94 rules in 13 ms. Remains 105 /152 variables (removed 47) and now considering 181/348 (removed 167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 105/152 places, 181/348 transitions.
[2023-04-07 07:45:18] [INFO ] Flatten gal took : 26 ms
[2023-04-07 07:45:18] [INFO ] Flatten gal took : 27 ms
[2023-04-07 07:45:18] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 192
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 192
Applied a total of 56 rules in 12 ms. Remains 124 /152 variables (removed 28) and now considering 192/348 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 124/152 places, 192/348 transitions.
[2023-04-07 07:45:18] [INFO ] Flatten gal took : 38 ms
[2023-04-07 07:45:18] [INFO ] Flatten gal took : 10 ms
[2023-04-07 07:45:18] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 125 transition count 201
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 125 transition count 201
Applied a total of 54 rules in 18 ms. Remains 125 /152 variables (removed 27) and now considering 201/348 (removed 147) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 125/152 places, 201/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 9 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 9 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 125 transition count 193
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 125 transition count 193
Applied a total of 54 rules in 42 ms. Remains 125 /152 variables (removed 27) and now considering 193/348 (removed 155) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 125/152 places, 193/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 8 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 13 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 184
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 184
Applied a total of 56 rules in 3 ms. Remains 124 /152 variables (removed 28) and now considering 184/348 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/152 places, 184/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 7 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 24 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 192
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 192
Applied a total of 56 rules in 4 ms. Remains 124 /152 variables (removed 28) and now considering 192/348 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/152 places, 192/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 7 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 32 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 166
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 166
Applied a total of 60 rules in 3 ms. Remains 122 /152 variables (removed 30) and now considering 166/348 (removed 182) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 122/152 places, 166/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 22 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 7 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 168
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 168
Applied a total of 56 rules in 3 ms. Remains 124 /152 variables (removed 28) and now considering 168/348 (removed 180) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 124/152 places, 168/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 23 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 7 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 328
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 328
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 69 place count 103 transition count 163
Iterating global reduction 0 with 29 rules applied. Total rules applied 98 place count 103 transition count 163
Applied a total of 98 rules in 24 ms. Remains 103 /152 variables (removed 49) and now considering 163/348 (removed 185) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 103/152 places, 163/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 6 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 22 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 152 transition count 331
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 331
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 60 place count 109 transition count 185
Iterating global reduction 0 with 26 rules applied. Total rules applied 86 place count 109 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 108 transition count 184
Applied a total of 88 rules in 27 ms. Remains 108 /152 variables (removed 44) and now considering 184/348 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 108/152 places, 184/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 22 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 7 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 127 transition count 203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 127 transition count 203
Applied a total of 50 rules in 5 ms. Remains 127 /152 variables (removed 25) and now considering 203/348 (removed 145) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 127/152 places, 203/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 7 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 24 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 126 transition count 194
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 126 transition count 194
Applied a total of 52 rules in 4 ms. Remains 126 /152 variables (removed 26) and now considering 194/348 (removed 154) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 126/152 places, 194/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 23 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 7 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 125 transition count 201
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 125 transition count 201
Applied a total of 54 rules in 21 ms. Remains 125 /152 variables (removed 27) and now considering 201/348 (removed 147) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 125/152 places, 201/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 7 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 16 ms
[2023-04-07 07:45:19] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 174
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 174
Applied a total of 60 rules in 4 ms. Remains 122 /152 variables (removed 30) and now considering 174/348 (removed 174) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 122/152 places, 174/348 transitions.
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 22 ms
[2023-04-07 07:45:19] [INFO ] Flatten gal took : 6 ms
[2023-04-07 07:45:20] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 123 transition count 175
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 123 transition count 175
Applied a total of 58 rules in 3 ms. Remains 123 /152 variables (removed 29) and now considering 175/348 (removed 173) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 123/152 places, 175/348 transitions.
[2023-04-07 07:45:20] [INFO ] Flatten gal took : 30 ms
[2023-04-07 07:45:20] [INFO ] Flatten gal took : 6 ms
[2023-04-07 07:45:20] [INFO ] Input system was already deterministic with 175 transitions.
[2023-04-07 07:45:20] [INFO ] Flatten gal took : 29 ms
[2023-04-07 07:45:20] [INFO ] Flatten gal took : 29 ms
[2023-04-07 07:45:20] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2023-04-07 07:45:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 152 places, 348 transitions and 1328 arcs took 3 ms.
Total runtime 9333 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/496/ctl_0_ --ctl=/tmp/496/ctl_1_ --ctl=/tmp/496/ctl_2_ --ctl=/tmp/496/ctl_3_ --ctl=/tmp/496/ctl_4_ --ctl=/tmp/496/ctl_5_ --ctl=/tmp/496/ctl_6_ --ctl=/tmp/496/ctl_7_ --ctl=/tmp/496/ctl_8_ --ctl=/tmp/496/ctl_9_ --ctl=/tmp/496/ctl_10_ --ctl=/tmp/496/ctl_11_ --ctl=/tmp/496/ctl_12_ --ctl=/tmp/496/ctl_13_ --ctl=/tmp/496/ctl_14_ --mu-par --mu-opt
FORMULA Anderson-PT-05-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Anderson-PT-05-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680855419818

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name Anderson-PT-05-CTLFireability-00
ctl formula formula --ctl=/tmp/496/ctl_0_
ctl formula name Anderson-PT-05-CTLFireability-01
ctl formula formula --ctl=/tmp/496/ctl_1_
ctl formula name Anderson-PT-05-CTLFireability-02
ctl formula formula --ctl=/tmp/496/ctl_2_
ctl formula name Anderson-PT-05-CTLFireability-03
ctl formula formula --ctl=/tmp/496/ctl_3_
ctl formula name Anderson-PT-05-CTLFireability-04
ctl formula formula --ctl=/tmp/496/ctl_4_
ctl formula name Anderson-PT-05-CTLFireability-05
ctl formula formula --ctl=/tmp/496/ctl_5_
ctl formula name Anderson-PT-05-CTLFireability-06
ctl formula formula --ctl=/tmp/496/ctl_6_
ctl formula name Anderson-PT-05-CTLFireability-08
ctl formula formula --ctl=/tmp/496/ctl_7_
ctl formula name Anderson-PT-05-CTLFireability-09
ctl formula formula --ctl=/tmp/496/ctl_8_
ctl formula name Anderson-PT-05-CTLFireability-10
ctl formula formula --ctl=/tmp/496/ctl_9_
ctl formula name Anderson-PT-05-CTLFireability-11
ctl formula formula --ctl=/tmp/496/ctl_10_
ctl formula name Anderson-PT-05-CTLFireability-12
ctl formula formula --ctl=/tmp/496/ctl_11_
ctl formula name Anderson-PT-05-CTLFireability-13
ctl formula formula --ctl=/tmp/496/ctl_12_
ctl formula name Anderson-PT-05-CTLFireability-14
ctl formula formula --ctl=/tmp/496/ctl_13_
ctl formula name Anderson-PT-05-CTLFireability-15
ctl formula formula --ctl=/tmp/496/ctl_14_
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 152 places, 348 transitions and 1328 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 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: 348->348 groups
pnml2lts-sym: Regrouping took 0.080 real 0.080 user 0.000 sys
pnml2lts-sym: state vector length is 152; there are 348 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: 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 138549716 group checks and 0 next state calls
pnml2lts-sym: reachability took 1789.410 real 7131.220 user 17.720 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 530124 states, 88011 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/496/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/496/ctl_14_ holds for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_3_ 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/496/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_12_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/496/ctl_8_ does not hold for the initial state
pnml2lts-sym: group_next: 2954 nodes total
pnml2lts-sym: group_explored: 4069 nodes, 2592 short vectors total
pnml2lts-sym: max token count: 1

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="Anderson-PT-05"
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 Anderson-PT-05, 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 r521-tall-167987246100010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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