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.r105-tall-167814481100346.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 DES-PT-00a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481100346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 26 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 26 15:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:49 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 31K 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 DES-PT-00a-CTLFireability-00
FORMULA_NAME DES-PT-00a-CTLFireability-01
FORMULA_NAME DES-PT-00a-CTLFireability-02
FORMULA_NAME DES-PT-00a-CTLFireability-03
FORMULA_NAME DES-PT-00a-CTLFireability-04
FORMULA_NAME DES-PT-00a-CTLFireability-05
FORMULA_NAME DES-PT-00a-CTLFireability-06
FORMULA_NAME DES-PT-00a-CTLFireability-07
FORMULA_NAME DES-PT-00a-CTLFireability-08
FORMULA_NAME DES-PT-00a-CTLFireability-09
FORMULA_NAME DES-PT-00a-CTLFireability-10
FORMULA_NAME DES-PT-00a-CTLFireability-11
FORMULA_NAME DES-PT-00a-CTLFireability-12
FORMULA_NAME DES-PT-00a-CTLFireability-13
FORMULA_NAME DES-PT-00a-CTLFireability-14
FORMULA_NAME DES-PT-00a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678284087853

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=DES-PT-00a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 14:01:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 14:01:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 14:01:29] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-08 14:01:29] [INFO ] Transformed 115 places.
[2023-03-08 14:01:29] [INFO ] Transformed 76 transitions.
[2023-03-08 14:01:29] [INFO ] Found NUPN structural information;
[2023-03-08 14:01:29] [INFO ] Parsed PT model containing 115 places and 76 transitions and 373 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 80 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Applied a total of 0 rules in 11 ms. Remains 115 /115 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 115 cols
[2023-03-08 14:01:29] [INFO ] Computed 57 place invariants in 16 ms
[2023-03-08 14:01:29] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-08 14:01:29] [INFO ] Invariant cache hit.
[2023-03-08 14:01:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:01:29] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-08 14:01:29] [INFO ] Invariant cache hit.
[2023-03-08 14:01:29] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 115/115 places, 62/62 transitions.
Support contains 80 out of 115 places after structural reductions.
[2023-03-08 14:01:30] [INFO ] Flatten gal took : 28 ms
[2023-03-08 14:01:30] [INFO ] Flatten gal took : 11 ms
[2023-03-08 14:01:30] [INFO ] Input system was already deterministic with 62 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 45) seen :40
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 14:01:30] [INFO ] Invariant cache hit.
[2023-03-08 14:01:30] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 14:01:30] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-08 14:01:30] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 14:01:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 14:01:31] [INFO ] [Nat]Absence check using 35 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-08 14:01:31] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 14:01:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 14:01:31] [INFO ] After 55ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 14:01:31] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-08 14:01:31] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 31 ms.
Support contains 14 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 62/62 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 115 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 114 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 113 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 113 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 111 transition count 57
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 111 transition count 57
Applied a total of 12 rules in 30 ms. Remains 111 /115 variables (removed 4) and now considering 57/62 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 111/115 places, 57/62 transitions.
Incomplete random walk after 10000 steps, including 198 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 57 rows 111 cols
[2023-03-08 14:01:31] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-08 14:01:31] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 14:01:31] [INFO ] [Real]Absence check using 36 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-08 14:01:31] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 14:01:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 14:01:31] [INFO ] [Nat]Absence check using 36 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-08 14:01:31] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 14:01:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 14:01:31] [INFO ] After 28ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 14:01:31] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-08 14:01:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-08 14:01:31] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 14:01:31] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 9 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 57/57 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 56
Applied a total of 1 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 56/57 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 111/111 places, 56/57 transitions.
Incomplete random walk after 10000 steps, including 156 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 56 rows 111 cols
[2023-03-08 14:01:32] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 14:01:32] [INFO ] [Real]Absence check using 38 positive place invariants in 5 ms returned sat
[2023-03-08 14:01:32] [INFO ] [Real]Absence check using 38 positive and 21 generalized place invariants in 3 ms returned sat
[2023-03-08 14:01:32] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 14:01:32] [INFO ] [Nat]Absence check using 38 positive place invariants in 4 ms returned sat
[2023-03-08 14:01:32] [INFO ] [Nat]Absence check using 38 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-08 14:01:32] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 14:01:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 14:01:32] [INFO ] After 11ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 14:01:32] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2023-03-08 14:01:32] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2023-03-08 14:01:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2023-03-08 14:01:32] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 14:01:32] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 56/56 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 111 transition count 56
Applied a total of 1 rules in 14 ms. Remains 111 /111 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 111/111 places, 56/56 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2080687 steps, run timeout after 3001 ms. (steps per millisecond=693 ) properties seen :{}
Probabilistic random walk after 2080687 steps, saw 267134 distinct states, run finished after 3002 ms. (steps per millisecond=693 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 56 rows 111 cols
[2023-03-08 14:01:35] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 14:01:35] [INFO ] [Real]Absence check using 38 positive place invariants in 5 ms returned sat
[2023-03-08 14:01:35] [INFO ] [Real]Absence check using 38 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-08 14:01:35] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 14:01:35] [INFO ] [Nat]Absence check using 38 positive place invariants in 9 ms returned sat
[2023-03-08 14:01:35] [INFO ] [Nat]Absence check using 38 positive and 21 generalized place invariants in 6 ms returned sat
[2023-03-08 14:01:35] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 14:01:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 14:01:35] [INFO ] After 15ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 14:01:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2023-03-08 14:01:35] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2023-03-08 14:01:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-03-08 14:01:35] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 14:01:35] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 56/56 transitions.
Applied a total of 0 rules in 10 ms. Remains 111 /111 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 111/111 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2023-03-08 14:01:35] [INFO ] Invariant cache hit.
[2023-03-08 14:01:35] [INFO ] Implicit Places using invariants in 79 ms returned [11, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/111 places, 56/56 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 109 transition count 56
Applied a total of 1 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 109 cols
[2023-03-08 14:01:35] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-08 14:01:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 14:01:35] [INFO ] Invariant cache hit.
[2023-03-08 14:01:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 14:01:35] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 109/111 places, 56/56 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 286 ms. Remains : 109/111 places, 56/56 transitions.
Incomplete random walk after 10000 steps, including 153 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2271332 steps, run timeout after 3001 ms. (steps per millisecond=756 ) properties seen :{}
Probabilistic random walk after 2271332 steps, saw 292994 distinct states, run finished after 3001 ms. (steps per millisecond=756 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 14:01:39] [INFO ] Invariant cache hit.
[2023-03-08 14:01:39] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-08 14:01:39] [INFO ] [Real]Absence check using 36 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-08 14:01:39] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 14:01:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 14:01:39] [INFO ] [Nat]Absence check using 36 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-08 14:01:39] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 14:01:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 14:01:39] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 14:01:39] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 14:01:39] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 7 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 8 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 62 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 59
Applied a total of 6 rules in 11 ms. Remains 112 /115 variables (removed 3) and now considering 59/62 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 112/115 places, 59/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 6 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 6 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 60
Applied a total of 4 rules in 8 ms. Remains 113 /115 variables (removed 2) and now considering 60/62 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 113/115 places, 60/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 59
Applied a total of 6 rules in 11 ms. Remains 112 /115 variables (removed 3) and now considering 59/62 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 112/115 places, 59/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 115/115 places, 62/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 6 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 59
Applied a total of 6 rules in 11 ms. Remains 112 /115 variables (removed 3) and now considering 59/62 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 112/115 places, 59/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 6 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 3 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 114/115 places, 61/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 4 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 114/115 places, 61/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 6 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 113 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 4 place count 111 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 110 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 110 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 108 transition count 57
Applied a total of 10 rules in 11 ms. Remains 108 /115 variables (removed 7) and now considering 57/62 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 108/115 places, 57/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 4 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 3 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 114/115 places, 61/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 112 transition count 59
Applied a total of 6 rules in 7 ms. Remains 112 /115 variables (removed 3) and now considering 59/62 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 112/115 places, 59/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 2 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 114/115 places, 61/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 4 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 58
Applied a total of 8 rules in 8 ms. Remains 111 /115 variables (removed 4) and now considering 58/62 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 111/115 places, 58/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 2 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 114/115 places, 61/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 4 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 2 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 114/115 places, 61/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 3 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 114/115 places, 61/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 4 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 4 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 61
Applied a total of 2 rules in 1 ms. Remains 114 /115 variables (removed 1) and now considering 61/62 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 114/115 places, 61/62 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 4 ms
[2023-03-08 14:01:39] [INFO ] Input system was already deterministic with 61 transitions.
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 4 ms
[2023-03-08 14:01:39] [INFO ] Flatten gal took : 5 ms
[2023-03-08 14:01:39] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-08 14:01:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 115 places, 62 transitions and 309 arcs took 1 ms.
Total runtime 10452 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/525/ctl_0_ --ctl=/tmp/525/ctl_1_ --ctl=/tmp/525/ctl_2_ --ctl=/tmp/525/ctl_3_ --ctl=/tmp/525/ctl_4_ --ctl=/tmp/525/ctl_5_ --ctl=/tmp/525/ctl_6_ --ctl=/tmp/525/ctl_7_ --ctl=/tmp/525/ctl_8_ --ctl=/tmp/525/ctl_9_ --ctl=/tmp/525/ctl_10_ --ctl=/tmp/525/ctl_11_ --ctl=/tmp/525/ctl_12_ --ctl=/tmp/525/ctl_13_ --ctl=/tmp/525/ctl_14_ --ctl=/tmp/525/ctl_15_ --mu-par --mu-opt
FORMULA DES-PT-00a-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-00a-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678286685770

--------------------
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 DES-PT-00a-CTLFireability-00
ctl formula formula --ctl=/tmp/525/ctl_0_
ctl formula name DES-PT-00a-CTLFireability-01
ctl formula formula --ctl=/tmp/525/ctl_1_
ctl formula name DES-PT-00a-CTLFireability-02
ctl formula formula --ctl=/tmp/525/ctl_2_
ctl formula name DES-PT-00a-CTLFireability-03
ctl formula formula --ctl=/tmp/525/ctl_3_
ctl formula name DES-PT-00a-CTLFireability-04
ctl formula formula --ctl=/tmp/525/ctl_4_
ctl formula name DES-PT-00a-CTLFireability-05
ctl formula formula --ctl=/tmp/525/ctl_5_
ctl formula name DES-PT-00a-CTLFireability-06
ctl formula formula --ctl=/tmp/525/ctl_6_
ctl formula name DES-PT-00a-CTLFireability-07
ctl formula formula --ctl=/tmp/525/ctl_7_
ctl formula name DES-PT-00a-CTLFireability-08
ctl formula formula --ctl=/tmp/525/ctl_8_
ctl formula name DES-PT-00a-CTLFireability-09
ctl formula formula --ctl=/tmp/525/ctl_9_
ctl formula name DES-PT-00a-CTLFireability-10
ctl formula formula --ctl=/tmp/525/ctl_10_
ctl formula name DES-PT-00a-CTLFireability-11
ctl formula formula --ctl=/tmp/525/ctl_11_
ctl formula name DES-PT-00a-CTLFireability-12
ctl formula formula --ctl=/tmp/525/ctl_12_
ctl formula name DES-PT-00a-CTLFireability-13
ctl formula formula --ctl=/tmp/525/ctl_13_
ctl formula name DES-PT-00a-CTLFireability-14
ctl formula formula --ctl=/tmp/525/ctl_14_
ctl formula name DES-PT-00a-CTLFireability-15
ctl formula formula --ctl=/tmp/525/ctl_15_
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 115 places, 62 transitions and 309 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: 62->57 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 115; 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: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 19387 group checks and 0 next state calls
pnml2lts-sym: reachability took 2547.110 real 10180.790 user 0.170 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 24196956529 states, 2912 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/525/ctl_1_ 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/525/ctl_15_ holds for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_14_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/525/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_12_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/525/ctl_11_ does not hold for the initial state
pnml2lts-sym: group_next: 748 nodes total
pnml2lts-sym: group_explored: 2146 nodes, 856085720 short vectors total
pnml2lts-sym: max token count: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-00a"
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 DES-PT-00a, 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 r105-tall-167814481100346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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