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.r265-smll-167863540300610.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 Peterson-PT-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540300610
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-CTLFireability-00
FORMULA_NAME Peterson-PT-3-CTLFireability-01
FORMULA_NAME Peterson-PT-3-CTLFireability-02
FORMULA_NAME Peterson-PT-3-CTLFireability-03
FORMULA_NAME Peterson-PT-3-CTLFireability-04
FORMULA_NAME Peterson-PT-3-CTLFireability-05
FORMULA_NAME Peterson-PT-3-CTLFireability-06
FORMULA_NAME Peterson-PT-3-CTLFireability-07
FORMULA_NAME Peterson-PT-3-CTLFireability-08
FORMULA_NAME Peterson-PT-3-CTLFireability-09
FORMULA_NAME Peterson-PT-3-CTLFireability-10
FORMULA_NAME Peterson-PT-3-CTLFireability-11
FORMULA_NAME Peterson-PT-3-CTLFireability-12
FORMULA_NAME Peterson-PT-3-CTLFireability-13
FORMULA_NAME Peterson-PT-3-CTLFireability-14
FORMULA_NAME Peterson-PT-3-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679131981523

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=Peterson-PT-3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:33:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 09:33:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:33:04] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-18 09:33:04] [INFO ] Transformed 244 places.
[2023-03-18 09:33:04] [INFO ] Transformed 332 transitions.
[2023-03-18 09:33:04] [INFO ] Found NUPN structural information;
[2023-03-18 09:33:04] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-18 09:33:04] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 38 ms.
Support contains 244 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 20 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-18 09:33:04] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-18 09:33:04] [INFO ] Computed 15 place invariants in 24 ms
[2023-03-18 09:33:05] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-18 09:33:05] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:33:05] [INFO ] Invariant cache hit.
[2023-03-18 09:33:05] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:33:05] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
[2023-03-18 09:33:05] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:33:05] [INFO ] Invariant cache hit.
[2023-03-18 09:33:06] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1293 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 244 out of 244 places after structural reductions.
[2023-03-18 09:33:06] [INFO ] Flatten gal took : 87 ms
[2023-03-18 09:33:06] [INFO ] Flatten gal took : 77 ms
[2023-03-18 09:33:06] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 64) seen :42
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-18 09:33:07] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-18 09:33:07] [INFO ] Invariant cache hit.
[2023-03-18 09:33:08] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-18 09:33:08] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-18 09:33:08] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-18 09:33:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-18 09:33:08] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-18 09:33:08] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-18 09:33:08] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:33:09] [INFO ] After 247ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-18 09:33:09] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 7 ms to minimize.
[2023-03-18 09:33:09] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 1 ms to minimize.
[2023-03-18 09:33:09] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 2 ms to minimize.
[2023-03-18 09:33:09] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2023-03-18 09:33:09] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2023-03-18 09:33:10] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-18 09:33:10] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2023-03-18 09:33:10] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2023-03-18 09:33:10] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2023-03-18 09:33:10] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2023-03-18 09:33:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1468 ms
[2023-03-18 09:33:10] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2023-03-18 09:33:10] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 0 ms to minimize.
[2023-03-18 09:33:10] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2023-03-18 09:33:11] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-18 09:33:11] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-18 09:33:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 548 ms
[2023-03-18 09:33:11] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-18 09:33:11] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2023-03-18 09:33:11] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2023-03-18 09:33:11] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2023-03-18 09:33:11] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2023-03-18 09:33:11] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 0 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 842 ms
[2023-03-18 09:33:12] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 0 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 448 ms
[2023-03-18 09:33:12] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-18 09:33:12] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 0 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2023-03-18 09:33:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2023-03-18 09:33:13] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 1 ms to minimize.
[2023-03-18 09:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-18 09:33:13] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2023-03-18 09:33:13] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2023-03-18 09:33:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-18 09:33:13] [INFO ] After 4538ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 333 ms.
[2023-03-18 09:33:13] [INFO ] After 5556ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 3 properties in 165 ms.
Support contains 15 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 244 transition count 254
Reduce places removed 78 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 83 rules applied. Total rules applied 161 place count 166 transition count 249
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 166 place count 161 transition count 249
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 166 place count 161 transition count 205
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 254 place count 117 transition count 205
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 278 place count 105 transition count 193
Applied a total of 278 rules in 71 ms. Remains 105 /244 variables (removed 139) and now considering 193/332 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 105/244 places, 193/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 09:33:14] [INFO ] Flow matrix only has 169 transitions (discarded 24 similar events)
// Phase 1: matrix 169 rows 105 cols
[2023-03-18 09:33:14] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-18 09:33:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-18 09:33:14] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-18 09:33:15] [INFO ] After 124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2023-03-18 09:33:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 09:33:15] [INFO ] After 27ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 09:33:15] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 09:33:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-18 09:33:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-18 09:33:15] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 09:33:15] [INFO ] After 74ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-18 09:33:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 5 ms to minimize.
[2023-03-18 09:33:15] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-18 09:33:15] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-18 09:33:15] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2023-03-18 09:33:15] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-18 09:33:15] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2023-03-18 09:33:15] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-18 09:33:15] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2023-03-18 09:33:15] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2023-03-18 09:33:15] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 755 ms
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 202 ms
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 274 ms
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 11 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 177 ms
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-18 09:33:16] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2023-03-18 09:33:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-18 09:33:16] [INFO ] After 1673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-18 09:33:17] [INFO ] After 1957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 35 ms.
Support contains 12 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 193/193 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 104 transition count 190
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 190
Applied a total of 6 rules in 14 ms. Remains 102 /105 variables (removed 3) and now considering 190/193 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 102/105 places, 190/193 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Finished probabilistic random walk after 144550 steps, run visited all 8 properties in 772 ms. (steps per millisecond=187 )
Probabilistic random walk after 144550 steps, saw 29120 distinct states, run finished after 773 ms. (steps per millisecond=186 ) properties seen :8
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-18 09:33:18] [INFO ] Flatten gal took : 34 ms
[2023-03-18 09:33:18] [INFO ] Flatten gal took : 46 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 21 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 23 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 188 place count 150 transition count 196
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 272 place count 108 transition count 196
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 280 place count 104 transition count 192
Applied a total of 280 rules in 26 ms. Remains 104 /244 variables (removed 140) and now considering 192/332 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 104/244 places, 192/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 10 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 10 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 16 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 18 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 16 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 18 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 208 transition count 296
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 208 transition count 288
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 200 transition count 288
Applied a total of 88 rules in 20 ms. Remains 200 /244 variables (removed 44) and now considering 288/332 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 200/244 places, 288/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 11 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 11 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 244 transition count 329
Reduce places removed 3 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 15 rules applied. Total rules applied 18 place count 241 transition count 317
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 30 place count 229 transition count 317
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 30 place count 229 transition count 309
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 46 place count 221 transition count 309
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 64 place count 212 transition count 300
Applied a total of 64 rules in 26 ms. Remains 212 /244 variables (removed 32) and now considering 300/332 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 212/244 places, 300/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 12 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 12 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 10 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 13 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 14 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 20 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 88/244 places, 176/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 7 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 12 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 12 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 244 transition count 237
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 149 transition count 237
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 190 place count 149 transition count 189
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 286 place count 101 transition count 189
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 310 place count 89 transition count 177
Applied a total of 310 rules in 14 ms. Remains 89 /244 variables (removed 155) and now considering 177/332 (removed 155) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 89/244 places, 177/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 6 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 6 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 177 transitions.
Finished random walk after 6740 steps, including 2 resets, run visited all 1 properties in 21 ms. (steps per millisecond=320 )
FORMULA Peterson-PT-3-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 244 transition count 240
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 185 place count 152 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 186 place count 151 transition count 239
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 186 place count 151 transition count 192
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 280 place count 104 transition count 192
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 304 place count 92 transition count 180
Applied a total of 304 rules in 15 ms. Remains 92 /244 variables (removed 152) and now considering 180/332 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 92/244 places, 180/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 6 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 6 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 10 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 11 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 13 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 11 ms
[2023-03-18 09:33:19] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 10 ms
[2023-03-18 09:33:19] [INFO ] Flatten gal took : 10 ms
[2023-03-18 09:33:20] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2023-03-18 09:33:20] [INFO ] Flatten gal took : 13 ms
[2023-03-18 09:33:20] [INFO ] Flatten gal took : 11 ms
[2023-03-18 09:33:20] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 189 place count 150 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 149 transition count 237
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 190 place count 149 transition count 190
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 284 place count 102 transition count 190
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 308 place count 90 transition count 178
Applied a total of 308 rules in 15 ms. Remains 90 /244 variables (removed 154) and now considering 178/332 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 90/244 places, 178/332 transitions.
[2023-03-18 09:33:20] [INFO ] Flatten gal took : 5 ms
[2023-03-18 09:33:20] [INFO ] Flatten gal took : 5 ms
[2023-03-18 09:33:20] [INFO ] Input system was already deterministic with 178 transitions.
[2023-03-18 09:33:20] [INFO ] Flatten gal took : 20 ms
[2023-03-18 09:33:20] [INFO ] Flatten gal took : 20 ms
[2023-03-18 09:33:20] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 29 ms.
[2023-03-18 09:33:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 2 ms.
Total runtime 15956 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/660/ctl_0_ --ctl=/tmp/660/ctl_1_ --ctl=/tmp/660/ctl_2_ --ctl=/tmp/660/ctl_3_ --ctl=/tmp/660/ctl_4_ --ctl=/tmp/660/ctl_5_ --ctl=/tmp/660/ctl_6_ --ctl=/tmp/660/ctl_7_ --ctl=/tmp/660/ctl_8_ --ctl=/tmp/660/ctl_9_ --ctl=/tmp/660/ctl_10_ --ctl=/tmp/660/ctl_11_ --ctl=/tmp/660/ctl_12_ --ctl=/tmp/660/ctl_13_ --ctl=/tmp/660/ctl_14_ --mu-par --mu-opt
FORMULA Peterson-PT-3-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679132241711

--------------------
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 Peterson-PT-3-CTLFireability-00
ctl formula formula --ctl=/tmp/660/ctl_0_
ctl formula name Peterson-PT-3-CTLFireability-01
ctl formula formula --ctl=/tmp/660/ctl_1_
ctl formula name Peterson-PT-3-CTLFireability-02
ctl formula formula --ctl=/tmp/660/ctl_2_
ctl formula name Peterson-PT-3-CTLFireability-03
ctl formula formula --ctl=/tmp/660/ctl_3_
ctl formula name Peterson-PT-3-CTLFireability-04
ctl formula formula --ctl=/tmp/660/ctl_4_
ctl formula name Peterson-PT-3-CTLFireability-05
ctl formula formula --ctl=/tmp/660/ctl_5_
ctl formula name Peterson-PT-3-CTLFireability-06
ctl formula formula --ctl=/tmp/660/ctl_6_
ctl formula name Peterson-PT-3-CTLFireability-07
ctl formula formula --ctl=/tmp/660/ctl_7_
ctl formula name Peterson-PT-3-CTLFireability-08
ctl formula formula --ctl=/tmp/660/ctl_8_
ctl formula name Peterson-PT-3-CTLFireability-10
ctl formula formula --ctl=/tmp/660/ctl_9_
ctl formula name Peterson-PT-3-CTLFireability-11
ctl formula formula --ctl=/tmp/660/ctl_10_
ctl formula name Peterson-PT-3-CTLFireability-12
ctl formula formula --ctl=/tmp/660/ctl_11_
ctl formula name Peterson-PT-3-CTLFireability-13
ctl formula formula --ctl=/tmp/660/ctl_12_
ctl formula name Peterson-PT-3-CTLFireability-14
ctl formula formula --ctl=/tmp/660/ctl_13_
ctl formula name Peterson-PT-3-CTLFireability-15
ctl formula formula --ctl=/tmp/660/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.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: 332->320 groups
pnml2lts-sym: Regrouping took 0.080 real 0.080 user 0.000 sys
pnml2lts-sym: state vector length is 244; there are 320 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 201996 group checks and 0 next state calls
pnml2lts-sym: reachability took 1.490 real 5.920 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 3407946 states, 43031 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/660/ctl_0_ 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/660/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_3_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/660/ctl_14_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_13_ holds for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_8_ holds for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_11_ 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/660/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_10_ holds for the initial state
pnml2lts-sym: Formula /tmp/660/ctl_6_ holds for the initial state
pnml2lts-sym: group_next: 2086 nodes total
pnml2lts-sym: group_explored: 2094 nodes, 1536 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="Peterson-PT-3"
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 Peterson-PT-3, 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 r265-smll-167863540300610"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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