About the Execution of LTSMin+red for DoubleExponent-PT-003
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15908.596 | 1540837.00 | 6096297.00 | 645.70 | TTFFFTTFFTTTFTTF | normal |
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.r137-smll-167819418500457.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 DoubleExponent-PT-003, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418500457
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 50K 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 DoubleExponent-PT-003-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678856640120
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=DoubleExponent-PT-003
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 05:04:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 05:04:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:04:03] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-15 05:04:03] [INFO ] Transformed 163 places.
[2023-03-15 05:04:03] [INFO ] Transformed 148 transitions.
[2023-03-15 05:04:03] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Support contains 107 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 148
Applied a total of 1 rules in 29 ms. Remains 162 /163 variables (removed 1) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 162 cols
[2023-03-15 05:04:03] [INFO ] Computed 18 place invariants in 18 ms
[2023-03-15 05:04:03] [INFO ] Implicit Places using invariants in 320 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 364 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/163 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 400 ms. Remains : 161/163 places, 148/148 transitions.
Support contains 107 out of 161 places after structural reductions.
[2023-03-15 05:04:04] [INFO ] Flatten gal took : 60 ms
[2023-03-15 05:04:04] [INFO ] Flatten gal took : 38 ms
[2023-03-15 05:04:04] [INFO ] Input system was already deterministic with 148 transitions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 1076 ms. (steps per millisecond=9 ) properties (out of 95) seen :26
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 69) seen :5
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 64) seen :0
Running SMT prover for 64 properties.
// Phase 1: matrix 148 rows 161 cols
[2023-03-15 05:04:07] [INFO ] Computed 17 place invariants in 6 ms
[2023-03-15 05:04:08] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2023-03-15 05:04:08] [INFO ] [Real]Absence check using 5 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-15 05:04:08] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:63
[2023-03-15 05:04:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2023-03-15 05:04:08] [INFO ] [Nat]Absence check using 5 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-15 05:04:09] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :21 sat :43
[2023-03-15 05:04:09] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 7 ms to minimize.
[2023-03-15 05:04:09] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2023-03-15 05:04:09] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 1 ms to minimize.
[2023-03-15 05:04:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 339 ms
[2023-03-15 05:04:10] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-15 05:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-15 05:04:10] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 2 ms to minimize.
[2023-03-15 05:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-15 05:04:10] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2023-03-15 05:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-15 05:04:10] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2023-03-15 05:04:10] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2023-03-15 05:04:10] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2023-03-15 05:04:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 280 ms
[2023-03-15 05:04:10] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2023-03-15 05:04:10] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2023-03-15 05:04:10] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 0 ms to minimize.
[2023-03-15 05:04:10] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2023-03-15 05:04:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 315 ms
[2023-03-15 05:04:11] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2023-03-15 05:04:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-15 05:04:11] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2023-03-15 05:04:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-15 05:04:11] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2023-03-15 05:04:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-15 05:04:11] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2023-03-15 05:04:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-15 05:04:11] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 0 ms to minimize.
[2023-03-15 05:04:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-15 05:04:12] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2023-03-15 05:04:12] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2023-03-15 05:04:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-03-15 05:04:12] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 0 ms to minimize.
[2023-03-15 05:04:12] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2023-03-15 05:04:12] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 1 ms to minimize.
[2023-03-15 05:04:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 246 ms
[2023-03-15 05:04:12] [INFO ] After 3574ms SMT Verify possible using trap constraints in natural domain returned unsat :23 sat :41
Attempting to minimize the solution found.
Minimization took 679 ms.
[2023-03-15 05:04:13] [INFO ] After 4876ms SMT Verify possible using all constraints in natural domain returned unsat :23 sat :41
Fused 64 Parikh solutions to 41 different solutions.
Parikh walk visited 0 properties in 1067 ms.
Support contains 61 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 148/148 transitions.
Graph (complete) has 265 edges and 161 vertex of which 159 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 159 transition count 141
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 152 transition count 138
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 149 transition count 138
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 21 place count 149 transition count 134
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 145 transition count 134
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 47 place count 136 transition count 125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 51 place count 134 transition count 125
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 134 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 133 transition count 124
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 59 place count 133 transition count 118
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 65 place count 127 transition count 118
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 69 place count 127 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 126 transition count 117
Applied a total of 70 rules in 74 ms. Remains 126 /161 variables (removed 35) and now considering 117/148 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 126/161 places, 117/148 transitions.
Incomplete random walk after 10000 steps, including 810 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 41) seen :6
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 63 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
// Phase 1: matrix 117 rows 126 cols
[2023-03-15 05:04:15] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-15 05:04:15] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:35
[2023-03-15 05:04:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 05:04:16] [INFO ] [Nat]Absence check using 5 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-15 05:04:16] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :35
[2023-03-15 05:04:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:04:16] [INFO ] After 317ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :35
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 0 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 389 ms
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 0 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 6 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2023-03-15 05:04:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 188 ms
[2023-03-15 05:04:18] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2023-03-15 05:04:18] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2023-03-15 05:04:18] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2023-03-15 05:04:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 191 ms
[2023-03-15 05:04:18] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-03-15 05:04:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-15 05:04:18] [INFO ] After 1928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :35
Attempting to minimize the solution found.
Minimization took 408 ms.
[2023-03-15 05:04:18] [INFO ] After 3044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :35
Parikh walk visited 0 properties in 520 ms.
Support contains 52 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 117/117 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 115
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 124 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 123 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 10 place count 121 transition count 112
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 121 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 120 transition count 111
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 14 place count 120 transition count 111
Applied a total of 14 rules in 36 ms. Remains 120 /126 variables (removed 6) and now considering 111/117 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 120/126 places, 111/117 transitions.
Incomplete random walk after 10000 steps, including 783 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 64 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 66 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 63 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 65 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 67 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 66 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 34) seen :0
Interrupted probabilistic random walk after 268390 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1}
Probabilistic random walk after 268390 steps, saw 134231 distinct states, run finished after 3006 ms. (steps per millisecond=89 ) properties seen :33
Running SMT prover for 1 properties.
// Phase 1: matrix 111 rows 120 cols
[2023-03-15 05:04:23] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-15 05:04:23] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:04:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 05:04:23] [INFO ] [Nat]Absence check using 3 positive and 13 generalized place invariants in 9 ms returned sat
[2023-03-15 05:04:23] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:04:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 05:04:23] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:04:23] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-15 05:04:23] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 111/111 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 120 transition count 91
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 100 transition count 91
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 40 place count 100 transition count 87
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 96 transition count 87
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 82 place count 79 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 77 transition count 70
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 93 place count 77 transition count 63
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 100 place count 70 transition count 63
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 70 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 69 transition count 62
Applied a total of 107 rules in 34 ms. Remains 69 /120 variables (removed 51) and now considering 62/111 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 69/120 places, 62/111 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1225741 steps, run timeout after 3001 ms. (steps per millisecond=408 ) properties seen :{}
Probabilistic random walk after 1225741 steps, saw 613007 distinct states, run finished after 3006 ms. (steps per millisecond=407 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 69 cols
[2023-03-15 05:04:27] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-15 05:04:27] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 05:04:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 05:04:27] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-15 05:04:27] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 05:04:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 05:04:27] [INFO ] After 12ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 05:04:27] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-15 05:04:27] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 69/69 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 69 /69 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-15 05:04:27] [INFO ] Invariant cache hit.
[2023-03-15 05:04:27] [INFO ] Implicit Places using invariants in 100 ms returned [13, 24, 37, 41, 60, 66]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 115 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/69 places, 62/62 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 63 transition count 58
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 59 transition count 58
Applied a total of 9 rules in 10 ms. Remains 59 /63 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 59 cols
[2023-03-15 05:04:27] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 05:04:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-15 05:04:27] [INFO ] Invariant cache hit.
[2023-03-15 05:04:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-15 05:04:27] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/69 places, 58/62 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 407 ms. Remains : 59/69 places, 58/62 transitions.
Incomplete random walk after 10000 steps, including 1474 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 71660 steps, run visited all 1 properties in 172 ms. (steps per millisecond=416 )
Probabilistic random walk after 71660 steps, saw 35854 distinct states, run finished after 174 ms. (steps per millisecond=411 ) properties seen :1
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-003-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 05:04:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-15 05:04:27] [INFO ] Flatten gal took : 16 ms
FORMULA DoubleExponent-PT-003-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 05:04:27] [INFO ] Flatten gal took : 14 ms
[2023-03-15 05:04:27] [INFO ] Input system was already deterministic with 148 transitions.
Support contains 71 out of 161 places (down from 87) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 265 edges and 161 vertex of which 156 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Graph (complete) has 265 edges and 161 vertex of which 159 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 158 transition count 125
Reduce places removed 22 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 29 rules applied. Total rules applied 52 place count 136 transition count 118
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 59 place count 129 transition count 118
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 59 place count 129 transition count 111
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 73 place count 122 transition count 111
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 105 place count 106 transition count 95
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 106 transition count 95
Applied a total of 106 rules in 29 ms. Remains 106 /161 variables (removed 55) and now considering 95/148 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 106/161 places, 95/148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:04:28] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Graph (complete) has 265 edges and 161 vertex of which 158 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 157 transition count 111
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 121 transition count 111
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 73 place count 121 transition count 106
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 116 transition count 106
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 127 place count 94 transition count 84
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 94 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 93 transition count 83
Applied a total of 129 rules in 46 ms. Remains 93 /161 variables (removed 68) and now considering 83/148 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 93/161 places, 83/148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:04:28] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 160 transition count 148
Applied a total of 1 rules in 4 ms. Remains 160 /161 variables (removed 1) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 160/161 places, 148/148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 10 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 11 ms
[2023-03-15 05:04:28] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Graph (complete) has 265 edges and 161 vertex of which 158 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 157 transition count 114
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 124 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 123 transition count 113
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 69 place count 123 transition count 107
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 81 place count 117 transition count 107
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 123 place count 96 transition count 86
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 96 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 95 transition count 85
Applied a total of 127 rules in 46 ms. Remains 95 /161 variables (removed 66) and now considering 85/148 (removed 63) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 95/161 places, 85/148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 7 ms
[2023-03-15 05:04:28] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 4 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 25 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 11 ms
[2023-03-15 05:04:28] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 5 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 17 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:04:28] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 5 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 21 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 29 ms
[2023-03-15 05:04:28] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 5 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 22 ms
[2023-03-15 05:04:28] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 5 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 22 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:04:28] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 158 transition count 148
Applied a total of 3 rules in 4 ms. Remains 158 /161 variables (removed 3) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 158/161 places, 148/148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:04:28] [INFO ] Input system was already deterministic with 148 transitions.
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:04:28] [INFO ] Flatten gal took : 10 ms
[2023-03-15 05:04:28] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-15 05:04:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 148 transitions and 413 arcs took 2 ms.
Total runtime 25911 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/618/ctl_0_ --ctl=/tmp/618/ctl_1_ --ctl=/tmp/618/ctl_2_ --ctl=/tmp/618/ctl_3_ --ctl=/tmp/618/ctl_4_ --ctl=/tmp/618/ctl_5_ --ctl=/tmp/618/ctl_6_ --ctl=/tmp/618/ctl_7_ --ctl=/tmp/618/ctl_8_ --ctl=/tmp/618/ctl_9_ --mu-par --mu-opt
FORMULA DoubleExponent-PT-003-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678858180957
--------------------
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 DoubleExponent-PT-003-CTLCardinality-02
ctl formula formula --ctl=/tmp/618/ctl_0_
ctl formula name DoubleExponent-PT-003-CTLCardinality-03
ctl formula formula --ctl=/tmp/618/ctl_1_
ctl formula name DoubleExponent-PT-003-CTLCardinality-06
ctl formula formula --ctl=/tmp/618/ctl_2_
ctl formula name DoubleExponent-PT-003-CTLCardinality-07
ctl formula formula --ctl=/tmp/618/ctl_3_
ctl formula name DoubleExponent-PT-003-CTLCardinality-08
ctl formula formula --ctl=/tmp/618/ctl_4_
ctl formula name DoubleExponent-PT-003-CTLCardinality-10
ctl formula formula --ctl=/tmp/618/ctl_5_
ctl formula name DoubleExponent-PT-003-CTLCardinality-11
ctl formula formula --ctl=/tmp/618/ctl_6_
ctl formula name DoubleExponent-PT-003-CTLCardinality-12
ctl formula formula --ctl=/tmp/618/ctl_7_
ctl formula name DoubleExponent-PT-003-CTLCardinality-13
ctl formula formula --ctl=/tmp/618/ctl_8_
ctl formula name DoubleExponent-PT-003-CTLCardinality-14
ctl formula formula --ctl=/tmp/618/ctl_9_
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 161 places, 148 transitions and 413 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.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: 148->148 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 161; there are 148 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: Exploration took 114924 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.700 real 2.760 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 2385072 states, 61845 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/618/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_3_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/618/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/618/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/618/ctl_9_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/618/ctl_6_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/618/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/618/ctl_7_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/618/ctl_8_ holds for the initial state
pnml2lts-sym: group_next: 2794 nodes total
pnml2lts-sym: group_explored: 2633 nodes, 3362 short vectors total
pnml2lts-sym: max token count: 256
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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, 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 r137-smll-167819418500457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 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 '
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 ;