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.r329-tall-167889202500818.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 RingSingleMessageInMbox-PT-d0m080, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202500818
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.7K Feb 26 05:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 05:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 05:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 05:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 05:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 05:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 05:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 05:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K Mar 5 18:23 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 RingSingleMessageInMbox-PT-d0m080-CTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679171472885

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=RingSingleMessageInMbox-PT-d0m080
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 20:31:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:31:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:31:14] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-18 20:31:14] [INFO ] Transformed 385 places.
[2023-03-18 20:31:14] [INFO ] Transformed 59 transitions.
[2023-03-18 20:31:14] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 329 places in 2 ms
Reduce places removed 329 places and 0 transitions.
Support contains 50 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Applied a total of 2 rules in 11 ms. Remains 54 /56 variables (removed 2) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 54 cols
[2023-03-18 20:31:14] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-18 20:31:15] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-18 20:31:15] [INFO ] Invariant cache hit.
[2023-03-18 20:31:15] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 20:31:15] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-18 20:31:15] [INFO ] Invariant cache hit.
[2023-03-18 20:31:15] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 59/59 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 54/56 places, 59/59 transitions.
Support contains 50 out of 54 places after structural reductions.
[2023-03-18 20:31:15] [INFO ] Flatten gal took : 21 ms
[2023-03-18 20:31:15] [INFO ] Flatten gal took : 9 ms
[2023-03-18 20:31:15] [INFO ] Input system was already deterministic with 59 transitions.
Incomplete random walk after 10000 steps, including 2183 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 63) seen :28
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :2
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 156 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :2
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :6
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-18 20:31:16] [INFO ] Invariant cache hit.
[2023-03-18 20:31:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 20:31:16] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 20:31:16] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:17
[2023-03-18 20:31:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 20:31:16] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 20:31:16] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :10
[2023-03-18 20:31:16] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 20:31:16] [INFO ] After 60ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :12 sat :10
[2023-03-18 20:31:16] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 5 ms to minimize.
[2023-03-18 20:31:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-18 20:31:17] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :10
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-18 20:31:17] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :10
Fused 22 Parikh solutions to 10 different solutions.
Parikh walk visited 2 properties in 75 ms.
Support contains 10 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 59/59 transitions.
Graph (complete) has 141 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 53 transition count 56
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 49 transition count 50
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 49 transition count 50
Applied a total of 12 rules in 13 ms. Remains 49 /54 variables (removed 5) and now considering 50/59 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 49/54 places, 50/59 transitions.
Incomplete random walk after 10000 steps, including 2174 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 527 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 982 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 3258702 steps, run timeout after 3001 ms. (steps per millisecond=1085 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1}
Probabilistic random walk after 3258702 steps, saw 1243865 distinct states, run finished after 3002 ms. (steps per millisecond=1085 ) properties seen :7
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 49 cols
[2023-03-18 20:31:20] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-18 20:31:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 20:31:20] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:31:20] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:31:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 20:31:20] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 22 ms returned sat
[2023-03-18 20:31:20] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:31:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-18 20:31:20] [INFO ] After 16ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 20:31:20] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-18 20:31:21] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 50/50 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 48
Applied a total of 4 rules in 6 ms. Remains 47 /49 variables (removed 2) and now considering 48/50 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 47/49 places, 48/50 transitions.
Incomplete random walk after 10000 steps, including 2131 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3685667 steps, run timeout after 3001 ms. (steps per millisecond=1228 ) properties seen :{}
Probabilistic random walk after 3685667 steps, saw 1405991 distinct states, run finished after 3002 ms. (steps per millisecond=1227 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 47 cols
[2023-03-18 20:31:24] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-18 20:31:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 20:31:24] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:31:24] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:31:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 20:31:24] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 20:31:24] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:31:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-18 20:31:24] [INFO ] After 5ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 20:31:24] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 20:31:24] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 47/47 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-18 20:31:24] [INFO ] Invariant cache hit.
[2023-03-18 20:31:24] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 20:31:24] [INFO ] Invariant cache hit.
[2023-03-18 20:31:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-18 20:31:24] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-18 20:31:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:31:24] [INFO ] Invariant cache hit.
[2023-03-18 20:31:24] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 47/47 places, 48/48 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 2 place count 47 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 46 transition count 46
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 3 place count 46 transition count 39
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 39 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 25 place count 35 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 35
Applied a total of 27 rules in 14 ms. Remains 34 /47 variables (removed 13) and now considering 35/48 (removed 13) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 34 cols
[2023-03-18 20:31:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 20:31:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 20:31:24] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 20:31:24] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:31:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 20:31:24] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 20:31:24] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:31:24] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2023-03-18 20:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-18 20:31:24] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-18 20:31:24] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:31:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 8 ms
[2023-03-18 20:31:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 59 transitions.
Support contains 36 out of 54 places (down from 40) after GAL structural reductions.
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 164 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 52
Applied a total of 14 rules in 4 ms. Remains 47 /54 variables (removed 7) and now considering 52/59 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 47/54 places, 52/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 3 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 4 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 51
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 50
Applied a total of 14 rules in 3 ms. Remains 47 /54 variables (removed 7) and now considering 50/59 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 47/54 places, 50/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 7 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 51
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 50
Applied a total of 14 rules in 6 ms. Remains 47 /54 variables (removed 7) and now considering 50/59 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 47/54 places, 50/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 4 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 53
Applied a total of 12 rules in 3 ms. Remains 48 /54 variables (removed 6) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 48/54 places, 53/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 53
Applied a total of 12 rules in 6 ms. Remains 48 /54 variables (removed 6) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 48/54 places, 53/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 56
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 50 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 50 transition count 55
Applied a total of 8 rules in 2 ms. Remains 50 /54 variables (removed 4) and now considering 55/59 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/54 places, 55/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 5 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 2 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 53
Applied a total of 12 rules in 2 ms. Remains 48 /54 variables (removed 6) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/54 places, 53/59 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:31:24] [INFO ] Input system was already deterministic with 53 transitions.
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:31:24] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:31:24] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-18 20:31:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 59 transitions and 231 arcs took 1 ms.
Total runtime 10358 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/511/ctl_0_ --ctl=/tmp/511/ctl_1_ --ctl=/tmp/511/ctl_2_ --ctl=/tmp/511/ctl_3_ --ctl=/tmp/511/ctl_4_ --ctl=/tmp/511/ctl_5_ --ctl=/tmp/511/ctl_6_ --ctl=/tmp/511/ctl_7_ --ctl=/tmp/511/ctl_8_ --ctl=/tmp/511/ctl_9_ --ctl=/tmp/511/ctl_10_ --ctl=/tmp/511/ctl_11_ --ctl=/tmp/511/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 14131200 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095772 kB
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m080-CTLFireability-03
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m080-CTLFireability-11
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m080-CTLFireability-12
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m080-CTLFireability-13
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679175057398

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-00
ctl formula formula --ctl=/tmp/511/ctl_0_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-01
ctl formula formula --ctl=/tmp/511/ctl_1_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-03
ctl formula formula --ctl=/tmp/511/ctl_2_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-06
ctl formula formula --ctl=/tmp/511/ctl_3_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-07
ctl formula formula --ctl=/tmp/511/ctl_4_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-08
ctl formula formula --ctl=/tmp/511/ctl_5_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-09
ctl formula formula --ctl=/tmp/511/ctl_6_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-10
ctl formula formula --ctl=/tmp/511/ctl_7_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-11
ctl formula formula --ctl=/tmp/511/ctl_8_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-12
ctl formula formula --ctl=/tmp/511/ctl_9_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-13
ctl formula formula --ctl=/tmp/511/ctl_10_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-14
ctl formula formula --ctl=/tmp/511/ctl_11_
ctl formula name RingSingleMessageInMbox-PT-d0m080-CTLFireability-15
ctl formula formula --ctl=/tmp/511/ctl_12_
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 54 places, 59 transitions and 231 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 59->57 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 54; there are 57 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: 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: Exploration took 479232 group checks and 0 next state calls
pnml2lts-sym: reachability took 18.440 real 72.780 user 0.850 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.050 user 0.000 sys
pnml2lts-sym: state space has 350014562 states, 93804 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/511/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/511/ctl_12_ 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/511/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/511/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/511/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/511/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/511/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/511/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/511/ctl_0_ does not hold for the initial state
Killing (15) : 517
Killing (9) : 517

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="RingSingleMessageInMbox-PT-d0m080"
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 RingSingleMessageInMbox-PT-d0m080, 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 r329-tall-167889202500818"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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