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.r489-tall-167912707500946.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 UtahNoC-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707500946
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 205K 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 UtahNoC-PT-none-CTLFireability-00
FORMULA_NAME UtahNoC-PT-none-CTLFireability-01
FORMULA_NAME UtahNoC-PT-none-CTLFireability-02
FORMULA_NAME UtahNoC-PT-none-CTLFireability-03
FORMULA_NAME UtahNoC-PT-none-CTLFireability-04
FORMULA_NAME UtahNoC-PT-none-CTLFireability-05
FORMULA_NAME UtahNoC-PT-none-CTLFireability-06
FORMULA_NAME UtahNoC-PT-none-CTLFireability-07
FORMULA_NAME UtahNoC-PT-none-CTLFireability-08
FORMULA_NAME UtahNoC-PT-none-CTLFireability-09
FORMULA_NAME UtahNoC-PT-none-CTLFireability-10
FORMULA_NAME UtahNoC-PT-none-CTLFireability-11
FORMULA_NAME UtahNoC-PT-none-CTLFireability-12
FORMULA_NAME UtahNoC-PT-none-CTLFireability-13
FORMULA_NAME UtahNoC-PT-none-CTLFireability-14
FORMULA_NAME UtahNoC-PT-none-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679335061846

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=UtahNoC-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 17:57:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 17:57:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 17:57:43] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-20 17:57:43] [INFO ] Transformed 216 places.
[2023-03-20 17:57:43] [INFO ] Transformed 977 transitions.
[2023-03-20 17:57:43] [INFO ] Found NUPN structural information;
[2023-03-20 17:57:43] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Support contains 101 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 829/829 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 194 transition count 759
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 194 transition count 759
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 61 place count 194 transition count 742
Applied a total of 61 rules in 41 ms. Remains 194 /216 variables (removed 22) and now considering 742/829 (removed 87) transitions.
[2023-03-20 17:57:43] [INFO ] Flow matrix only has 376 transitions (discarded 366 similar events)
// Phase 1: matrix 376 rows 194 cols
[2023-03-20 17:57:43] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-20 17:57:43] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-20 17:57:43] [INFO ] Flow matrix only has 376 transitions (discarded 366 similar events)
[2023-03-20 17:57:43] [INFO ] Invariant cache hit.
[2023-03-20 17:57:43] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-20 17:57:43] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-20 17:57:43] [INFO ] Flow matrix only has 376 transitions (discarded 366 similar events)
[2023-03-20 17:57:43] [INFO ] Invariant cache hit.
[2023-03-20 17:57:44] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 194/216 places, 742/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 726 ms. Remains : 194/216 places, 742/829 transitions.
Support contains 101 out of 194 places after structural reductions.
[2023-03-20 17:57:44] [INFO ] Flatten gal took : 143 ms
[2023-03-20 17:57:44] [INFO ] Flatten gal took : 32 ms
[2023-03-20 17:57:44] [INFO ] Input system was already deterministic with 742 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 86) seen :55
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-20 17:57:45] [INFO ] Flow matrix only has 376 transitions (discarded 366 similar events)
[2023-03-20 17:57:45] [INFO ] Invariant cache hit.
[2023-03-20 17:57:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 17:57:45] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:29
[2023-03-20 17:57:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-20 17:57:46] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :28
[2023-03-20 17:57:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-20 17:57:46] [INFO ] After 364ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :2 sat :28
[2023-03-20 17:57:47] [INFO ] After 1069ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :28
Attempting to minimize the solution found.
Minimization took 401 ms.
[2023-03-20 17:57:47] [INFO ] After 2105ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :28
Fused 30 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 212 ms.
Support contains 43 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 224 edges and 194 vertex of which 53 / 194 are part of one of the 16 SCC in 12 ms
Free SCC test removed 37 places
Drop transitions removed 176 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 212 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 4 place count 157 transition count 527
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 154 transition count 525
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 152 transition count 525
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 152 transition count 523
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 150 transition count 523
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 25 place count 140 transition count 485
Iterating global reduction 3 with 10 rules applied. Total rules applied 35 place count 140 transition count 485
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 40 place count 140 transition count 480
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 139 transition count 476
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 139 transition count 476
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 50 place count 135 transition count 469
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 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 4 with 18 rules applied. Total rules applied 68 place count 135 transition count 451
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 73 place count 132 transition count 449
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 82 place count 132 transition count 440
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 84 place count 130 transition count 438
Iterating global reduction 6 with 2 rules applied. Total rules applied 86 place count 130 transition count 438
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 88 place count 130 transition count 436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 90 place count 129 transition count 449
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 96 place count 129 transition count 443
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 105 place count 123 transition count 440
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 106 place count 123 transition count 439
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 113 place count 123 transition count 439
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 114 place count 123 transition count 438
Applied a total of 114 rules in 157 ms. Remains 123 /194 variables (removed 71) and now considering 438/742 (removed 304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 123/194 places, 438/742 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 28) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 17:57:48] [INFO ] Flow matrix only has 250 transitions (discarded 188 similar events)
// Phase 1: matrix 250 rows 123 cols
[2023-03-20 17:57:48] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-20 17:57:48] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 17:57:48] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 17:57:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-20 17:57:48] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 17:57:48] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-20 17:57:49] [INFO ] After 50ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 17:57:49] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-20 17:57:49] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 9 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 438/438 transitions.
Graph (trivial) has 81 edges and 123 vertex of which 22 / 123 are part of one of the 6 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 23 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 50 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 2 place count 107 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 106 transition count 387
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 17 place count 92 transition count 332
Iterating global reduction 2 with 14 rules applied. Total rules applied 31 place count 92 transition count 332
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 48 place count 92 transition count 315
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 51 place count 89 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 89 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 57 place count 89 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 88 transition count 307
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 64 place count 88 transition count 302
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 87 transition count 301
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 87 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 87 transition count 300
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 70 place count 87 transition count 297
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 79 place count 84 transition count 291
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 84 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 83 transition count 290
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 59 edges and 81 vertex of which 14 / 81 are part of one of the 5 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 84 place count 72 transition count 290
Drop transitions removed 16 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 112 place count 72 transition count 262
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 115 place count 69 transition count 250
Iterating global reduction 8 with 3 rules applied. Total rules applied 118 place count 69 transition count 250
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 119 place count 68 transition count 246
Iterating global reduction 8 with 1 rules applied. Total rules applied 120 place count 68 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 121 place count 68 transition count 245
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 127 place count 65 transition count 253
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 128 place count 65 transition count 252
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 134 place count 65 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 135 place count 64 transition count 245
Applied a total of 135 rules in 58 ms. Remains 64 /123 variables (removed 59) and now considering 245/438 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 64/123 places, 245/438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 17:57:49] [INFO ] Flow matrix only has 144 transitions (discarded 101 similar events)
// Phase 1: matrix 144 rows 64 cols
[2023-03-20 17:57:49] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-20 17:57:49] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 17:57:49] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 17:57:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-20 17:57:49] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 17:57:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-20 17:57:49] [INFO ] After 7ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 17:57:49] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 17:57:49] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 245/245 transitions.
Graph (trivial) has 44 edges and 64 vertex of which 6 / 64 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 6 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 58 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 58 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 58 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 58 transition count 218
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 57 transition count 216
Applied a total of 12 rules in 11 ms. Remains 57 /64 variables (removed 7) and now considering 216/245 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 57/64 places, 216/245 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 171158 steps, run visited all 1 properties in 355 ms. (steps per millisecond=482 )
Probabilistic random walk after 171158 steps, saw 80605 distinct states, run finished after 355 ms. (steps per millisecond=482 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-20 17:57:49] [INFO ] Flatten gal took : 29 ms
[2023-03-20 17:57:49] [INFO ] Flatten gal took : 31 ms
[2023-03-20 17:57:49] [INFO ] Input system was already deterministic with 742 transitions.
Support contains 91 out of 194 places (down from 96) after GAL structural reductions.
Computed a total of 2 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 162 transition count 590
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 162 transition count 590
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 89 place count 162 transition count 565
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 155 transition count 544
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 155 transition count 544
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 112 place count 155 transition count 535
Applied a total of 112 rules in 11 ms. Remains 155 /194 variables (removed 39) and now considering 535/742 (removed 207) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 155/194 places, 535/742 transitions.
[2023-03-20 17:57:49] [INFO ] Flatten gal took : 20 ms
[2023-03-20 17:57:49] [INFO ] Flatten gal took : 17 ms
[2023-03-20 17:57:49] [INFO ] Input system was already deterministic with 535 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 162 transition count 590
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 162 transition count 590
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 89 place count 162 transition count 565
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 97 place count 154 transition count 541
Iterating global reduction 1 with 8 rules applied. Total rules applied 105 place count 154 transition count 541
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 115 place count 154 transition count 531
Applied a total of 115 rules in 10 ms. Remains 154 /194 variables (removed 40) and now considering 531/742 (removed 211) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 154/194 places, 531/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 14 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 14 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 165 transition count 601
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 165 transition count 601
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 80 place count 165 transition count 579
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 160 transition count 564
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 160 transition count 564
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 97 place count 160 transition count 557
Applied a total of 97 rules in 10 ms. Remains 160 /194 variables (removed 34) and now considering 557/742 (removed 185) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 160/194 places, 557/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 14 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 15 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 557 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 310 edges and 194 vertex of which 81 / 194 are part of one of the 13 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 185 edges and 124 vertex of which 25 / 124 are part of one of the 4 SCC in 0 ms
Free SCC test removed 21 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 103 transition count 525
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 83 place count 103 transition count 445
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 105 place count 81 transition count 339
Iterating global reduction 2 with 22 rules applied. Total rules applied 127 place count 81 transition count 339
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 157 place count 81 transition count 309
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 164 place count 74 transition count 292
Iterating global reduction 3 with 7 rules applied. Total rules applied 171 place count 74 transition count 292
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 179 place count 74 transition count 284
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 4 with 4 rules applied. Total rules applied 183 place count 72 transition count 282
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 187 place count 72 transition count 278
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 189 place count 70 transition count 272
Iterating global reduction 5 with 2 rules applied. Total rules applied 191 place count 70 transition count 272
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 69 transition count 270
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 69 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 194 place count 69 transition count 269
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 216 place count 69 transition count 247
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 217 place count 69 transition count 247
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 218 place count 68 transition count 246
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 68 transition count 246
Applied a total of 219 rules in 37 ms. Remains 68 /194 variables (removed 126) and now considering 246/742 (removed 496) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 68/194 places, 246/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 7 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 7 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 160 transition count 579
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 160 transition count 579
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 95 place count 160 transition count 552
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 103 place count 152 transition count 528
Iterating global reduction 1 with 8 rules applied. Total rules applied 111 place count 152 transition count 528
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 121 place count 152 transition count 518
Applied a total of 121 rules in 9 ms. Remains 152 /194 variables (removed 42) and now considering 518/742 (removed 224) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 152/194 places, 518/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 13 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 14 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 518 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 307 edges and 194 vertex of which 78 / 194 are part of one of the 15 SCC in 0 ms
Free SCC test removed 63 places
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 194 edges and 129 vertex of which 23 / 129 are part of one of the 3 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 537
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 86 place count 109 transition count 454
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 109 place count 86 transition count 349
Iterating global reduction 2 with 23 rules applied. Total rules applied 132 place count 86 transition count 349
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 161 place count 86 transition count 320
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 170 place count 77 transition count 297
Iterating global reduction 3 with 9 rules applied. Total rules applied 179 place count 77 transition count 297
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 190 place count 77 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 196 place count 74 transition count 283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 200 place count 74 transition count 279
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 202 place count 72 transition count 273
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 72 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 206 place count 72 transition count 271
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 226 place count 72 transition count 251
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 227 place count 72 transition count 251
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 228 place count 71 transition count 250
Iterating global reduction 6 with 1 rules applied. Total rules applied 229 place count 71 transition count 250
Applied a total of 229 rules in 35 ms. Remains 71 /194 variables (removed 123) and now considering 250/742 (removed 492) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 71/194 places, 250/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 7 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 6 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 317 edges and 194 vertex of which 82 / 194 are part of one of the 14 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 196 edges and 124 vertex of which 26 / 124 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 102 transition count 527
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 89 place count 102 transition count 441
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 112 place count 79 transition count 330
Iterating global reduction 2 with 23 rules applied. Total rules applied 135 place count 79 transition count 330
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 167 place count 79 transition count 298
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 175 place count 71 transition count 278
Iterating global reduction 3 with 8 rules applied. Total rules applied 183 place count 71 transition count 278
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 193 place count 71 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 199 place count 68 transition count 265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 203 place count 68 transition count 261
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 205 place count 66 transition count 255
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 66 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 209 place count 66 transition count 253
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 228 place count 66 transition count 234
Applied a total of 228 rules in 23 ms. Remains 66 /194 variables (removed 128) and now considering 234/742 (removed 508) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 66/194 places, 234/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 5 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 6 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 160 transition count 580
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 160 transition count 580
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 93 place count 160 transition count 555
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 100 place count 153 transition count 534
Iterating global reduction 1 with 7 rules applied. Total rules applied 107 place count 153 transition count 534
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 116 place count 153 transition count 525
Applied a total of 116 rules in 7 ms. Remains 153 /194 variables (removed 41) and now considering 525/742 (removed 217) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 153/194 places, 525/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 16 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 13 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 525 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 318 edges and 194 vertex of which 84 / 194 are part of one of the 14 SCC in 0 ms
Free SCC test removed 70 places
Ensure Unique test removed 219 transitions
Reduce isomorphic transitions removed 219 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 192 edges and 122 vertex of which 26 / 122 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 100 transition count 522
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 89 place count 100 transition count 436
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 112 place count 77 transition count 325
Iterating global reduction 2 with 23 rules applied. Total rules applied 135 place count 77 transition count 325
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 167 place count 77 transition count 293
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 175 place count 69 transition count 273
Iterating global reduction 3 with 8 rules applied. Total rules applied 183 place count 69 transition count 273
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 193 place count 69 transition count 263
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 199 place count 66 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 203 place count 66 transition count 256
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 205 place count 64 transition count 250
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 64 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 209 place count 64 transition count 248
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 228 place count 64 transition count 229
Applied a total of 228 rules in 19 ms. Remains 64 /194 variables (removed 130) and now considering 229/742 (removed 513) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 64/194 places, 229/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 5 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 6 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 165 transition count 604
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 165 transition count 604
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 78 place count 165 transition count 584
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 159 transition count 566
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 159 transition count 566
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 98 place count 159 transition count 558
Applied a total of 98 rules in 7 ms. Remains 159 /194 variables (removed 35) and now considering 558/742 (removed 184) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 159/194 places, 558/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 13 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 13 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 558 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 164 transition count 598
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 164 transition count 598
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 82 place count 164 transition count 576
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 157 transition count 555
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 157 transition count 555
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 105 place count 157 transition count 546
Applied a total of 105 rules in 8 ms. Remains 157 /194 variables (removed 37) and now considering 546/742 (removed 196) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 157/194 places, 546/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 12 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 13 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 546 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 162 transition count 589
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 162 transition count 589
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 89 place count 162 transition count 564
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 156 transition count 546
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 156 transition count 546
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 107 place count 156 transition count 540
Applied a total of 107 rules in 8 ms. Remains 156 /194 variables (removed 38) and now considering 540/742 (removed 202) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 156/194 places, 540/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 16 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 12 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 540 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 165 transition count 605
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 165 transition count 605
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 78 place count 165 transition count 585
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 160 transition count 570
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 160 transition count 570
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 160 transition count 563
Applied a total of 95 rules in 7 ms. Remains 160 /194 variables (removed 34) and now considering 563/742 (removed 179) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 160/194 places, 563/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 13 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 13 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 165 transition count 605
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 165 transition count 605
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 81 place count 165 transition count 582
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 159 transition count 564
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 159 transition count 564
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 100 place count 159 transition count 557
Applied a total of 100 rules in 6 ms. Remains 159 /194 variables (removed 35) and now considering 557/742 (removed 185) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 159/194 places, 557/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 12 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 13 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 557 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 170 transition count 629
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 170 transition count 629
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 69 place count 170 transition count 608
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 75 place count 164 transition count 590
Iterating global reduction 1 with 6 rules applied. Total rules applied 81 place count 164 transition count 590
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 164 transition count 582
Applied a total of 89 rules in 6 ms. Remains 164 /194 variables (removed 30) and now considering 582/742 (removed 160) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 164/194 places, 582/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 15 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 13 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 582 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 310 edges and 194 vertex of which 81 / 194 are part of one of the 13 SCC in 0 ms
Free SCC test removed 68 places
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 103 transition count 415
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 103 transition count 415
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 72 place count 103 transition count 390
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 95 transition count 367
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 95 transition count 367
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 98 place count 95 transition count 357
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 92 transition count 354
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 108 place count 92 transition count 350
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 90 transition count 344
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 90 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 90 transition count 342
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 122 place count 90 transition count 334
Applied a total of 122 rules in 18 ms. Remains 90 /194 variables (removed 104) and now considering 334/742 (removed 408) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 90/194 places, 334/742 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 11 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 7 ms
[2023-03-20 17:57:50] [INFO ] Input system was already deterministic with 334 transitions.
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 16 ms
[2023-03-20 17:57:50] [INFO ] Flatten gal took : 17 ms
[2023-03-20 17:57:50] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 17:57:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 742 transitions and 2329 arcs took 3 ms.
Total runtime 7718 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/489/ctl_0_ --ctl=/tmp/489/ctl_1_ --ctl=/tmp/489/ctl_2_ --ctl=/tmp/489/ctl_3_ --ctl=/tmp/489/ctl_4_ --ctl=/tmp/489/ctl_5_ --ctl=/tmp/489/ctl_6_ --ctl=/tmp/489/ctl_7_ --ctl=/tmp/489/ctl_8_ --ctl=/tmp/489/ctl_9_ --ctl=/tmp/489/ctl_10_ --ctl=/tmp/489/ctl_11_ --ctl=/tmp/489/ctl_12_ --ctl=/tmp/489/ctl_13_ --ctl=/tmp/489/ctl_14_ --ctl=/tmp/489/ctl_15_ --mu-par --mu-opt
FORMULA UtahNoC-PT-none-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA UtahNoC-PT-none-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679335284541

--------------------
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 UtahNoC-PT-none-CTLFireability-00
ctl formula formula --ctl=/tmp/489/ctl_0_
ctl formula name UtahNoC-PT-none-CTLFireability-01
ctl formula formula --ctl=/tmp/489/ctl_1_
ctl formula name UtahNoC-PT-none-CTLFireability-02
ctl formula formula --ctl=/tmp/489/ctl_2_
ctl formula name UtahNoC-PT-none-CTLFireability-03
ctl formula formula --ctl=/tmp/489/ctl_3_
ctl formula name UtahNoC-PT-none-CTLFireability-04
ctl formula formula --ctl=/tmp/489/ctl_4_
ctl formula name UtahNoC-PT-none-CTLFireability-05
ctl formula formula --ctl=/tmp/489/ctl_5_
ctl formula name UtahNoC-PT-none-CTLFireability-06
ctl formula formula --ctl=/tmp/489/ctl_6_
ctl formula name UtahNoC-PT-none-CTLFireability-07
ctl formula formula --ctl=/tmp/489/ctl_7_
ctl formula name UtahNoC-PT-none-CTLFireability-08
ctl formula formula --ctl=/tmp/489/ctl_8_
ctl formula name UtahNoC-PT-none-CTLFireability-09
ctl formula formula --ctl=/tmp/489/ctl_9_
ctl formula name UtahNoC-PT-none-CTLFireability-10
ctl formula formula --ctl=/tmp/489/ctl_10_
ctl formula name UtahNoC-PT-none-CTLFireability-11
ctl formula formula --ctl=/tmp/489/ctl_11_
ctl formula name UtahNoC-PT-none-CTLFireability-12
ctl formula formula --ctl=/tmp/489/ctl_12_
ctl formula name UtahNoC-PT-none-CTLFireability-13
ctl formula formula --ctl=/tmp/489/ctl_13_
ctl formula name UtahNoC-PT-none-CTLFireability-14
ctl formula formula --ctl=/tmp/489/ctl_14_
ctl formula name UtahNoC-PT-none-CTLFireability-15
ctl formula formula --ctl=/tmp/489/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 194 places, 742 transitions and 2329 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.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 742->539 groups
pnml2lts-sym: Regrouping took 0.200 real 0.190 user 0.000 sys
pnml2lts-sym: state vector length is 194; there are 539 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 1907826 group checks and 0 next state calls
pnml2lts-sym: reachability took 21.250 real 84.860 user 0.040 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 2290447549 states, 15778 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/489/ctl_2_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/489/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_15_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_5_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/489/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_10_ holds for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_12_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/489/ctl_14_ holds for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/489/ctl_11_ does not hold for the initial state
pnml2lts-sym: group_next: 5319 nodes total
pnml2lts-sym: group_explored: 4234 nodes, 3234 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="UtahNoC-PT-none"
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 UtahNoC-PT-none, 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 r489-tall-167912707500946"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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