Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481200433.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DES-PT-20b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-20b-CTLCardinality-00
FORMULA_NAME DES-PT-20b-CTLCardinality-01
FORMULA_NAME DES-PT-20b-CTLCardinality-02
FORMULA_NAME DES-PT-20b-CTLCardinality-03
FORMULA_NAME DES-PT-20b-CTLCardinality-04
FORMULA_NAME DES-PT-20b-CTLCardinality-05
FORMULA_NAME DES-PT-20b-CTLCardinality-06
FORMULA_NAME DES-PT-20b-CTLCardinality-07
FORMULA_NAME DES-PT-20b-CTLCardinality-08
FORMULA_NAME DES-PT-20b-CTLCardinality-09
FORMULA_NAME DES-PT-20b-CTLCardinality-10
FORMULA_NAME DES-PT-20b-CTLCardinality-11
FORMULA_NAME DES-PT-20b-CTLCardinality-12
FORMULA_NAME DES-PT-20b-CTLCardinality-13
FORMULA_NAME DES-PT-20b-CTLCardinality-14
FORMULA_NAME DES-PT-20b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678297389033

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 17:43:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 17:43:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 17:43:10] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-08 17:43:10] [INFO ] Transformed 360 places.
[2023-03-08 17:43:10] [INFO ] Transformed 311 transitions.
[2023-03-08 17:43:10] [INFO ] Found NUPN structural information;
[2023-03-08 17:43:10] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
FORMULA DES-PT-20b-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 105 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 311
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 347 transition count 300
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 347 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 340 transition count 293
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 340 transition count 293
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 44 place count 340 transition count 287
Applied a total of 44 rules in 63 ms. Remains 340 /360 variables (removed 20) and now considering 287/311 (removed 24) transitions.
// Phase 1: matrix 287 rows 340 cols
[2023-03-08 17:43:10] [INFO ] Computed 63 place invariants in 32 ms
[2023-03-08 17:43:11] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-08 17:43:11] [INFO ] Invariant cache hit.
[2023-03-08 17:43:11] [INFO ] Implicit Places using invariants and state equation in 313 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 843 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 339/360 places, 287/311 transitions.
Applied a total of 0 rules in 7 ms. Remains 339 /339 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 914 ms. Remains : 339/360 places, 287/311 transitions.
Support contains 105 out of 339 places after structural reductions.
[2023-03-08 17:43:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-08 17:43:11] [INFO ] Flatten gal took : 49 ms
[2023-03-08 17:43:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-20b-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 17:43:11] [INFO ] Flatten gal took : 20 ms
[2023-03-08 17:43:11] [INFO ] Input system was already deterministic with 287 transitions.
Support contains 83 out of 339 places (down from 105) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 48) seen :41
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 287 rows 339 cols
[2023-03-08 17:43:12] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-08 17:43:12] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 17:43:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2023-03-08 17:43:12] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 22 ms returned sat
[2023-03-08 17:43:13] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 17:43:13] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 4 ms to minimize.
[2023-03-08 17:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-08 17:43:13] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2023-03-08 17:43:13] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-08 17:43:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2023-03-08 17:43:13] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-08 17:43:13] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2023-03-08 17:43:13] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2023-03-08 17:43:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2023-03-08 17:43:13] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2023-03-08 17:43:14] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2023-03-08 17:43:14] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2023-03-08 17:43:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2023-03-08 17:43:14] [INFO ] After 1203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-08 17:43:14] [INFO ] After 1552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 298 ms.
Support contains 7 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 287/287 transitions.
Graph (complete) has 694 edges and 339 vertex of which 331 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 331 transition count 262
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 313 transition count 262
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 39 place count 313 transition count 252
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 59 place count 303 transition count 252
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 71 place count 291 transition count 240
Iterating global reduction 2 with 12 rules applied. Total rules applied 83 place count 291 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 291 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 290 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 290 transition count 237
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 88 place count 289 transition count 237
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 94 place count 283 transition count 231
Iterating global reduction 4 with 6 rules applied. Total rules applied 100 place count 283 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 7 rules applied. Total rules applied 107 place count 283 transition count 224
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 109 place count 282 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 109 place count 282 transition count 220
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 115 place count 279 transition count 220
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 265 place count 204 transition count 145
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 6 with 4 rules applied. Total rules applied 269 place count 202 transition count 147
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 270 place count 202 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 271 place count 201 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 272 place count 201 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 273 place count 200 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 274 place count 199 transition count 145
Applied a total of 274 rules in 110 ms. Remains 199 /339 variables (removed 140) and now considering 145/287 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 199/339 places, 145/287 transitions.
Incomplete random walk after 10000 steps, including 440 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1049595 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1049595 steps, saw 143769 distinct states, run finished after 3002 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 145 rows 199 cols
[2023-03-08 17:43:17] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 17:43:18] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 17:43:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 17:43:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2023-03-08 17:43:18] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 17:43:18] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-08 17:43:18] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2023-03-08 17:43:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2023-03-08 17:43:18] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-08 17:43:18] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2023-03-08 17:43:18] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-08 17:43:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 164 ms
[2023-03-08 17:43:18] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-08 17:43:18] [INFO ] After 699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 94 ms.
Support contains 7 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 145/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 199/199 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 145/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-08 17:43:18] [INFO ] Invariant cache hit.
[2023-03-08 17:43:18] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-08 17:43:18] [INFO ] Invariant cache hit.
[2023-03-08 17:43:19] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-08 17:43:19] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 17:43:19] [INFO ] Invariant cache hit.
[2023-03-08 17:43:19] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 199/199 places, 145/145 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 199 transition count 145
Applied a total of 1 rules in 12 ms. Remains 199 /199 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 145 rows 199 cols
[2023-03-08 17:43:19] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 17:43:19] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 17:43:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 17:43:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 58 ms returned sat
[2023-03-08 17:43:19] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 17:43:19] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-08 17:43:19] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-20b-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 17:43:19] [INFO ] Flatten gal took : 15 ms
[2023-03-08 17:43:19] [INFO ] Flatten gal took : 17 ms
[2023-03-08 17:43:19] [INFO ] Input system was already deterministic with 287 transitions.
Computed a total of 141 stabilizing places and 134 stable transitions
Graph (complete) has 694 edges and 339 vertex of which 331 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 338 transition count 287
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 322 transition count 271
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 322 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 322 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 317 transition count 265
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 317 transition count 265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 317 transition count 261
Applied a total of 48 rules in 36 ms. Remains 317 /339 variables (removed 22) and now considering 261/287 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 317/339 places, 261/287 transitions.
[2023-03-08 17:43:19] [INFO ] Flatten gal took : 13 ms
[2023-03-08 17:43:19] [INFO ] Flatten gal took : 14 ms
[2023-03-08 17:43:19] [INFO ] Input system was already deterministic with 261 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Graph (complete) has 694 edges and 339 vertex of which 331 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 330 transition count 265
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 314 transition count 265
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 314 transition count 255
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 304 transition count 255
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 65 place count 292 transition count 243
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 292 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 292 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 291 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 80 place count 291 transition count 240
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 290 transition count 240
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 88 place count 284 transition count 234
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 284 transition count 234
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 7 rules applied. Total rules applied 101 place count 284 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 103 place count 283 transition count 226
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 103 place count 283 transition count 223
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 109 place count 280 transition count 223
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 241 place count 214 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 243 place count 212 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 244 place count 211 transition count 155
Applied a total of 244 rules in 84 ms. Remains 211 /339 variables (removed 128) and now considering 155/287 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 211/339 places, 155/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 338 transition count 287
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 321 transition count 270
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 321 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 321 transition count 269
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 314 transition count 262
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 314 transition count 262
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 313 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 313 transition count 254
Applied a total of 59 rules in 35 ms. Remains 313 /339 variables (removed 26) and now considering 254/287 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 313/339 places, 254/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 12 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 12 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Graph (complete) has 694 edges and 339 vertex of which 331 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 330 transition count 267
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 316 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 315 transition count 266
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 31 place count 315 transition count 257
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 49 place count 306 transition count 257
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 60 place count 295 transition count 246
Iterating global reduction 3 with 11 rules applied. Total rules applied 71 place count 295 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 295 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 294 transition count 244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 74 place count 294 transition count 243
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 76 place count 293 transition count 243
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 82 place count 287 transition count 237
Iterating global reduction 5 with 6 rules applied. Total rules applied 88 place count 287 transition count 237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 5 with 7 rules applied. Total rules applied 95 place count 287 transition count 230
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 97 place count 286 transition count 229
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 97 place count 286 transition count 226
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 103 place count 283 transition count 226
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 7 with 142 rules applied. Total rules applied 245 place count 212 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 211 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 247 place count 210 transition count 154
Applied a total of 247 rules in 67 ms. Remains 210 /339 variables (removed 129) and now considering 154/287 (removed 133) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 210/339 places, 154/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Graph (complete) has 694 edges and 339 vertex of which 331 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 330 transition count 265
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 314 transition count 265
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 314 transition count 255
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 304 transition count 255
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 65 place count 292 transition count 243
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 292 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 292 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 291 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 80 place count 291 transition count 240
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 290 transition count 240
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 88 place count 284 transition count 234
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 284 transition count 234
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 7 rules applied. Total rules applied 101 place count 284 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 103 place count 283 transition count 226
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 103 place count 283 transition count 223
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 109 place count 280 transition count 223
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 249 place count 210 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 251 place count 208 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 252 place count 207 transition count 151
Applied a total of 252 rules in 45 ms. Remains 207 /339 variables (removed 132) and now considering 151/287 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 207/339 places, 151/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 151 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
FORMULA DES-PT-20b-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 338 transition count 287
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 323 transition count 272
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 323 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 317 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 317 transition count 266
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 317 transition count 261
Applied a total of 48 rules in 16 ms. Remains 317 /339 variables (removed 22) and now considering 261/287 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 317/339 places, 261/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 12 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 261 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 338 transition count 287
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 321 transition count 270
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 321 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 321 transition count 269
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 314 transition count 262
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 314 transition count 262
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 313 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 313 transition count 254
Applied a total of 59 rules in 17 ms. Remains 313 /339 variables (removed 26) and now considering 254/287 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 313/339 places, 254/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 338 transition count 287
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 324 transition count 273
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 324 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 324 transition count 272
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 318 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 318 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 318 transition count 262
Applied a total of 46 rules in 11 ms. Remains 318 /339 variables (removed 21) and now considering 262/287 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 318/339 places, 262/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 13 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 323 transition count 271
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 323 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 323 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 317 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 317 transition count 264
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 317 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 316 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 316 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 316 transition count 256
Applied a total of 54 rules in 13 ms. Remains 316 /339 variables (removed 23) and now considering 256/287 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 316/339 places, 256/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 338 transition count 287
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 321 transition count 270
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 321 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 321 transition count 269
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 314 transition count 262
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 314 transition count 262
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 313 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 313 transition count 254
Applied a total of 59 rules in 13 ms. Remains 313 /339 variables (removed 26) and now considering 254/287 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 313/339 places, 254/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 8 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 338 transition count 287
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 322 transition count 271
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 322 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 322 transition count 270
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 316 transition count 264
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 316 transition count 264
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 316 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 315 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 315 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 315 transition count 257
Applied a total of 54 rules in 13 ms. Remains 315 /339 variables (removed 24) and now considering 257/287 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 315/339 places, 257/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 287/287 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 338 transition count 287
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 324 transition count 273
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 324 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 324 transition count 272
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 318 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 318 transition count 266
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 47 place count 318 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 317 transition count 260
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 317 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 317 transition count 259
Applied a total of 50 rules in 13 ms. Remains 317 /339 variables (removed 22) and now considering 259/287 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 317/339 places, 259/287 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:43:20] [INFO ] Input system was already deterministic with 259 transitions.
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:43:20] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:43:20] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-08 17:43:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 339 places, 287 transitions and 921 arcs took 2 ms.
Total runtime 10319 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/539/ctl_0_ --ctl=/tmp/539/ctl_1_ --ctl=/tmp/539/ctl_2_ --ctl=/tmp/539/ctl_3_ --ctl=/tmp/539/ctl_4_ --ctl=/tmp/539/ctl_5_ --ctl=/tmp/539/ctl_6_ --ctl=/tmp/539/ctl_7_ --ctl=/tmp/539/ctl_8_ --ctl=/tmp/539/ctl_9_ --ctl=/tmp/539/ctl_10_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 196264 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097788 kB
Could not compute solution for formula : DES-PT-20b-CTLCardinality-00
Could not compute solution for formula : DES-PT-20b-CTLCardinality-01
Could not compute solution for formula : DES-PT-20b-CTLCardinality-02
FORMULA DES-PT-20b-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DES-PT-20b-CTLCardinality-06
Could not compute solution for formula : DES-PT-20b-CTLCardinality-08
Could not compute solution for formula : DES-PT-20b-CTLCardinality-09
Could not compute solution for formula : DES-PT-20b-CTLCardinality-10
Could not compute solution for formula : DES-PT-20b-CTLCardinality-13
Could not compute solution for formula : DES-PT-20b-CTLCardinality-14
FORMULA DES-PT-20b-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678300973360

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name DES-PT-20b-CTLCardinality-00
ctl formula formula --ctl=/tmp/539/ctl_0_
ctl formula name DES-PT-20b-CTLCardinality-01
ctl formula formula --ctl=/tmp/539/ctl_1_
ctl formula name DES-PT-20b-CTLCardinality-02
ctl formula formula --ctl=/tmp/539/ctl_2_
ctl formula name DES-PT-20b-CTLCardinality-03
ctl formula formula --ctl=/tmp/539/ctl_3_
ctl formula name DES-PT-20b-CTLCardinality-06
ctl formula formula --ctl=/tmp/539/ctl_4_
ctl formula name DES-PT-20b-CTLCardinality-08
ctl formula formula --ctl=/tmp/539/ctl_5_
ctl formula name DES-PT-20b-CTLCardinality-09
ctl formula formula --ctl=/tmp/539/ctl_6_
ctl formula name DES-PT-20b-CTLCardinality-10
ctl formula formula --ctl=/tmp/539/ctl_7_
ctl formula name DES-PT-20b-CTLCardinality-13
ctl formula formula --ctl=/tmp/539/ctl_8_
ctl formula name DES-PT-20b-CTLCardinality-14
ctl formula formula --ctl=/tmp/539/ctl_9_
ctl formula name DES-PT-20b-CTLCardinality-15
ctl formula formula --ctl=/tmp/539/ctl_10_
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 339 places, 287 transitions and 921 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 287->285 groups
pnml2lts-sym: Regrouping took 0.060 real 0.060 user 0.000 sys
pnml2lts-sym: state vector length is 339; there are 285 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 12209787 group checks and 0 next state calls
pnml2lts-sym: reachability took 41.740 real 166.130 user 0.680 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.060 real 0.240 user 0.000 sys
pnml2lts-sym: state space has 1.83694341248426e+21 states, 321515 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/539/ctl_3_ holds for the initial state
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/539/ctl_10_ does not hold for the initial state
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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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
Killing (15) : 545
Killing (9) : 545

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-20b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-20b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481200433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;