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.r135-smll-167819414400450.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 lolaxred
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 r135-smll-167819414400450
=====================================================================

--------------------
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 1678328834508

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=lolaxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 02:27:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 02:27:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:27:18] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-09 02:27:18] [INFO ] Transformed 110 places.
[2023-03-09 02:27:18] [INFO ] Transformed 98 transitions.
[2023-03-09 02:27:18] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 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 32 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2023-03-09 02:27:18] [INFO ] Computed 11 place invariants in 11 ms
[2023-03-09 02:27:18] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-09 02:27:18] [INFO ] Invariant cache hit.
[2023-03-09 02:27:19] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2023-03-09 02:27:19] [INFO ] Invariant cache hit.
[2023-03-09 02:27:19] [INFO ] Dead Transitions using invariants and state equation in 195 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 873 ms. Remains : 106/110 places, 98/98 transitions.
Support contains 75 out of 106 places after structural reductions.
[2023-03-09 02:27:19] [INFO ] Flatten gal took : 63 ms
[2023-03-09 02:27:19] [INFO ] Flatten gal took : 26 ms
[2023-03-09 02:27:19] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 901 ms. (steps per millisecond=11 ) properties (out of 64) seen :29
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 35) seen :10
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-09 02:27:21] [INFO ] Invariant cache hit.
[2023-03-09 02:27:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:27:22] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-09 02:27:22] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-09 02:27:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:27:22] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 9 ms returned sat
[2023-03-09 02:27:23] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :14
[2023-03-09 02:27:23] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 8 ms to minimize.
[2023-03-09 02:27:23] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2023-03-09 02:27:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2023-03-09 02:27:23] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2023-03-09 02:27:23] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2023-03-09 02:27:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2023-03-09 02:27:23] [INFO ] After 1121ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :14
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-09 02:27:24] [INFO ] After 1694ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :14
Fused 25 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 255 ms.
Support contains 25 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.3 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 104 transition count 87
Reduce places removed 10 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 94 transition count 82
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 33 place count 89 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 33 place count 89 transition count 77
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 43 place count 84 transition count 77
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 63 place count 74 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 72 transition count 67
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 72 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 70 transition count 65
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 74 place count 70 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 69 transition count 64
Applied a total of 75 rules in 82 ms. Remains 69 /106 variables (removed 37) and now considering 64/98 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 69/106 places, 64/98 transitions.
Incomplete random walk after 10000 steps, including 577 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 449 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 64 rows 69 cols
[2023-03-09 02:27:27] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-09 02:27:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:27:27] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 02:27:27] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 02:27:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 02:27:27] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-09 02:27:27] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 02:27:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 02:27:27] [INFO ] After 56ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-09 02:27:27] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2023-03-09 02:27:27] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2023-03-09 02:27:27] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2023-03-09 02:27:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 164 ms
[2023-03-09 02:27:27] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2023-03-09 02:27:28] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2023-03-09 02:27:28] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2023-03-09 02:27:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 218 ms
[2023-03-09 02:27:28] [INFO ] After 551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-09 02:27:28] [INFO ] After 837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 128 ms.
Support contains 18 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 69 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 68 transition count 63
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 65 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 65 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 64 transition count 59
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 64 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 63 transition count 58
Applied a total of 12 rules in 30 ms. Remains 63 /69 variables (removed 6) and now considering 58/64 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 63/69 places, 58/64 transitions.
Incomplete random walk after 10000 steps, including 685 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 560 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 552 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 551 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 547 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 535 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 543 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 555 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 556 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 549 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 58 rows 63 cols
[2023-03-09 02:27:30] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 02:27:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:27:30] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 02:27:30] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 02:27:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 02:27:30] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 02:27:30] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 02:27:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 02:27:30] [INFO ] After 59ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-09 02:27:30] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2023-03-09 02:27:30] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2023-03-09 02:27:30] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-09 02:27:30] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2023-03-09 02:27:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 230 ms
[2023-03-09 02:27:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-09 02:27:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-09 02:27:31] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-09 02:27:31] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2023-03-09 02:27:31] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2023-03-09 02:27:31] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2023-03-09 02:27:31] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 3 ms to minimize.
[2023-03-09 02:27:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 301 ms
[2023-03-09 02:27:31] [INFO ] After 735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-09 02:27:31] [INFO ] After 1014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 78 ms.
Support contains 17 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 58/58 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 58
Applied a total of 1 rules in 9 ms. Remains 63 /63 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 63/63 places, 58/58 transitions.
Incomplete random walk after 10000 steps, including 723 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 546 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 557 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 560 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 552 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 569 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 545 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 547 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 537 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 8) seen :0
Finished probabilistic random walk after 295 steps, run visited all 8 properties in 15 ms. (steps per millisecond=19 )
Probabilistic random walk after 295 steps, saw 159 distinct states, run finished after 15 ms. (steps per millisecond=19 ) properties seen :8
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 02:27:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 14 ms
[2023-03-09 02:27:33] [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-09 02:27:33] [INFO ] Flatten gal took : 9 ms
[2023-03-09 02:27:33] [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.2 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 0 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 17 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 18 ms. Remains : 63/106 places, 55/98 transitions.
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 5 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 5 ms
[2023-03-09 02:27:33] [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 4 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-09 02:27:33] [INFO ] Flatten gal took : 8 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 8 ms
[2023-03-09 02:27:33] [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 4 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-09 02:27:33] [INFO ] Flatten gal took : 7 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 7 ms
[2023-03-09 02:27:33] [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 1 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 0 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 27 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 28 ms. Remains : 64/106 places, 56/98 transitions.
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 7 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 9 ms
[2023-03-09 02:27:33] [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 4 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-09 02:27:33] [INFO ] Flatten gal took : 12 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 13 ms
[2023-03-09 02:27:33] [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 6 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 12 ms
[2023-03-09 02:27:33] [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 4 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-09 02:27:33] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 12 ms
[2023-03-09 02:27:33] [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-09 02:27:33] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:27:33] [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-09 02:27:33] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:27:33] [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-09 02:27:33] [INFO ] Flatten gal took : 10 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:27:33] [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 4 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 10 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 10 ms
[2023-03-09 02:27:33] [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 4 ms. Remains : 106/106 places, 98/98 transitions.
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 10 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 9 ms
[2023-03-09 02:27:33] [INFO ] Input system was already deterministic with 98 transitions.
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 11 ms
[2023-03-09 02:27:33] [INFO ] Flatten gal took : 10 ms
[2023-03-09 02:27:33] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-09 02:27:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 98 transitions and 272 arcs took 2 ms.
Total runtime 15746 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-002
BK_EXAMINATION: CTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
CTLFireability

FORMULA DoubleExponent-PT-002-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678328855173

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/CTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:388
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:547
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:547
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 DoubleExponent-PT-002-CTLFireability-01
lola: time limit : 189 sec
lola: memory limit: 32 pages
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: FINISHED task # 4 (type EXCL) for DoubleExponent-PT-002-CTLFireability-01
lola: result : true
lola: markings : 3708
lola: fired transitions : 3782
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: LAUNCH task # 29 (type EXCL) for 28 DoubleExponent-PT-002-CTLFireability-12
lola: time limit : 224 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: FINISHED task # 29 (type EXCL) for DoubleExponent-PT-002-CTLFireability-12
lola: result : true
lola: markings : 25
lola: fired transitions : 27
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 23 (type EXCL) for 22 DoubleExponent-PT-002-CTLFireability-10
lola: time limit : 239 sec
lola: memory limit: 32 pages
lola: FINISHED task # 23 (type EXCL) for DoubleExponent-PT-002-CTLFireability-10
lola: result : false
lola: markings : 25
lola: fired transitions : 60
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 32 (type EXCL) for 31 DoubleExponent-PT-002-CTLFireability-13
lola: time limit : 299 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 32 (type EXCL) for DoubleExponent-PT-002-CTLFireability-13
lola: result : false
lola: markings : 25
lola: fired transitions : 51
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: LAUNCH task # 44 (type EXCL) for 0 DoubleExponent-PT-002-CTLFireability-00
lola: time limit : 359 sec
lola: memory limit: 32 pages
lola: FINISHED task # 44 (type EXCL) for DoubleExponent-PT-002-CTLFireability-00
lola: result : false
lola: markings : 16
lola: fired transitions : 15
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: LAUNCH task # 26 (type EXCL) for 25 DoubleExponent-PT-002-CTLFireability-11
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 26 (type EXCL) for DoubleExponent-PT-002-CTLFireability-11
lola: result : true
lola: markings : 24
lola: fired transitions : 93
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 42 (type EXCL) for 41 DoubleExponent-PT-002-CTLFireability-15
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: FINISHED task # 42 (type EXCL) for DoubleExponent-PT-002-CTLFireability-15
lola: result : false
lola: markings : 25
lola: fired transitions : 58
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 39 (type EXCL) for 34 DoubleExponent-PT-002-CTLFireability-14
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: FINISHED task # 39 (type EXCL) for DoubleExponent-PT-002-CTLFireability-14
lola: result : true
lola: markings : 25
lola: fired transitions : 49
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 20 (type EXCL) for 15 DoubleExponent-PT-002-CTLFireability-08
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: FINISHED task # 20 (type EXCL) for DoubleExponent-PT-002-CTLFireability-08
lola: result : true
lola: markings : 56
lola: fired transitions : 111
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 DoubleExponent-PT-002-CTLFireability-07
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for DoubleExponent-PT-002-CTLFireability-07
lola: result : true
lola: markings : 24
lola: fired transitions : 23
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 DoubleExponent-PT-002-CTLFireability-05
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DoubleExponent-PT-002-CTLFireability-05
lola: result : false
lola: markings : 161
lola: fired transitions : 312
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 45 (type EXCL) for 15 DoubleExponent-PT-002-CTLFireability-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 45 (type EXCL) for DoubleExponent-PT-002-CTLFireability-08
lola: result : false
lola: markings : 8
lola: fired transitions : 7
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 DoubleExponent-PT-002-CTLFireability-06
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for DoubleExponent-PT-002-CTLFireability-06
lola: result : true
lola: markings : 2328
lola: fired transitions : 7134
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-002-CTLFireability-00: EFAG true tscc_search
DoubleExponent-PT-002-CTLFireability-01: CTL true CTL model checker
DoubleExponent-PT-002-CTLFireability-05: CTL false CTL model checker
DoubleExponent-PT-002-CTLFireability-06: CTL true CTL model checker
DoubleExponent-PT-002-CTLFireability-07: CTL true CTL model checker
DoubleExponent-PT-002-CTLFireability-08: CONJ true CONJ
DoubleExponent-PT-002-CTLFireability-10: CTL false CTL model checker
DoubleExponent-PT-002-CTLFireability-11: CTL true CTL model checker
DoubleExponent-PT-002-CTLFireability-12: CTL true CTL model checker
DoubleExponent-PT-002-CTLFireability-13: CTL false CTL model checker
DoubleExponent-PT-002-CTLFireability-14: DISJ true CTL model checker
DoubleExponent-PT-002-CTLFireability-15: CTL false CTL model checker


Time elapsed: 1 secs. Pages in use: 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="DoubleExponent-PT-002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
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 r135-smll-167819414400450"
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 ;