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-167819418500465.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-004, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418500465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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.4K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 8.6K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 67K 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-004-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-004-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678858479155

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-004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 05:34:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 05:34:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:34:42] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-15 05:34:42] [INFO ] Transformed 216 places.
[2023-03-15 05:34:42] [INFO ] Transformed 198 transitions.
[2023-03-15 05:34:42] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Support contains 117 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 198
Applied a total of 1 rules in 27 ms. Remains 215 /216 variables (removed 1) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 215 cols
[2023-03-15 05:34:42] [INFO ] Computed 23 place invariants in 38 ms
[2023-03-15 05:34:42] [INFO ] Implicit Places using invariants in 418 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 459 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/216 places, 198/198 transitions.
Applied a total of 0 rules in 9 ms. Remains 214 /214 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 495 ms. Remains : 214/216 places, 198/198 transitions.
Support contains 117 out of 214 places after structural reductions.
[2023-03-15 05:34:43] [INFO ] Flatten gal took : 59 ms
[2023-03-15 05:34:43] [INFO ] Flatten gal took : 24 ms
[2023-03-15 05:34:43] [INFO ] Input system was already deterministic with 198 transitions.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 797 ms. (steps per millisecond=12 ) properties (out of 94) seen :18
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 76) 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 76) 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 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 76) 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 76) 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 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 76) 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 76) 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 76) 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 76) 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 76) 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 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 76) 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 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 76) seen :10
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 66) 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 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 66) 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 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 66) 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 66) 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 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 66) 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 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 66) 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 66) 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 66) 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 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 66) 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 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 66) 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 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 66) 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 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 66) 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 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 66) 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 66) 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 66) seen :0
Running SMT prover for 66 properties.
// Phase 1: matrix 198 rows 214 cols
[2023-03-15 05:34:46] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-15 05:34:46] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:66
[2023-03-15 05:34:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-15 05:34:47] [INFO ] [Nat]Absence check using 5 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-15 05:34:48] [INFO ] After 914ms SMT Verify possible using state equation in natural domain returned unsat :25 sat :41
[2023-03-15 05:34:48] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 10 ms to minimize.
[2023-03-15 05:34:48] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 1 ms to minimize.
[2023-03-15 05:34:49] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2023-03-15 05:34:49] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 2 ms to minimize.
[2023-03-15 05:34:49] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 0 ms to minimize.
[2023-03-15 05:34:49] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2023-03-15 05:34:49] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 0 ms to minimize.
[2023-03-15 05:34:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 931 ms
[2023-03-15 05:34:49] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2023-03-15 05:34:49] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2023-03-15 05:34:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2023-03-15 05:34:49] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2023-03-15 05:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-15 05:34:50] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 1 ms to minimize.
[2023-03-15 05:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-15 05:34:50] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2023-03-15 05:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-15 05:34:50] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 1 ms to minimize.
[2023-03-15 05:34:50] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 1 ms to minimize.
[2023-03-15 05:34:50] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 1 ms to minimize.
[2023-03-15 05:34:50] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 1 ms to minimize.
[2023-03-15 05:34:50] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 0 ms to minimize.
[2023-03-15 05:34:50] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 0 ms to minimize.
[2023-03-15 05:34:51] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 0 ms to minimize.
[2023-03-15 05:34:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 776 ms
[2023-03-15 05:34:51] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2023-03-15 05:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-15 05:34:51] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 0 ms to minimize.
[2023-03-15 05:34:51] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 1 ms to minimize.
[2023-03-15 05:34:51] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 1 ms to minimize.
[2023-03-15 05:34:51] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2023-03-15 05:34:51] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2023-03-15 05:34:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 538 ms
[2023-03-15 05:34:51] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 1 ms to minimize.
[2023-03-15 05:34:51] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 0 ms to minimize.
[2023-03-15 05:34:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2023-03-15 05:34:52] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 0 ms to minimize.
[2023-03-15 05:34:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-15 05:34:52] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 1 ms to minimize.
[2023-03-15 05:34:52] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2023-03-15 05:34:52] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 0 ms to minimize.
[2023-03-15 05:34:52] [INFO ] Deduced a trap composed of 107 places in 86 ms of which 2 ms to minimize.
[2023-03-15 05:34:52] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 1 ms to minimize.
[2023-03-15 05:34:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 512 ms
[2023-03-15 05:34:52] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 2 ms to minimize.
[2023-03-15 05:34:52] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 2 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 0 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 0 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 108 places in 86 ms of which 0 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 1 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 0 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 107 places in 85 ms of which 0 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 1 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 0 ms to minimize.
[2023-03-15 05:34:53] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1111 ms
[2023-03-15 05:34:54] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 0 ms to minimize.
[2023-03-15 05:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-15 05:34:54] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2023-03-15 05:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-15 05:34:54] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 0 ms to minimize.
[2023-03-15 05:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-15 05:34:54] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2023-03-15 05:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-15 05:34:54] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
[2023-03-15 05:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-15 05:34:54] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2023-03-15 05:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-15 05:34:55] [INFO ] After 7432ms SMT Verify possible using trap constraints in natural domain returned unsat :25 sat :41
Attempting to minimize the solution found.
Minimization took 1116 ms.
[2023-03-15 05:34:56] [INFO ] After 9316ms SMT Verify possible using all constraints in natural domain returned unsat :25 sat :41
Fused 66 Parikh solutions to 41 different solutions.
Parikh walk visited 0 properties in 1554 ms.
Support contains 60 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 198/198 transitions.
Graph (complete) has 356 edges and 214 vertex of which 213 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 213 transition count 187
Reduce places removed 11 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 17 rules applied. Total rules applied 29 place count 202 transition count 181
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 35 place count 196 transition count 181
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 35 place count 196 transition count 173
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 51 place count 188 transition count 173
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 79 place count 174 transition count 159
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 172 transition count 159
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 100 place count 172 transition count 142
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 117 place count 155 transition count 142
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 126 place count 155 transition count 142
Applied a total of 126 rules in 78 ms. Remains 155 /214 variables (removed 59) and now considering 142/198 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 155/214 places, 142/198 transitions.
Incomplete random walk after 10000 steps, including 614 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 41) 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 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 41) seen :2
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 39) 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 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 39) 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 39) seen :0
Interrupted probabilistic random walk after 128518 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{0=1, 2=1, 4=1, 7=1, 11=1, 12=1, 14=1, 15=1, 16=1, 17=1, 20=1, 25=1, 26=1, 27=1, 30=1, 32=1, 33=1, 34=1, 35=1, 37=1, 38=1}
Probabilistic random walk after 128518 steps, saw 64286 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :21
Running SMT prover for 18 properties.
// Phase 1: matrix 142 rows 155 cols
[2023-03-15 05:35:02] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-15 05:35:02] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-15 05:35:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 05:35:02] [INFO ] [Nat]Absence check using 2 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-15 05:35:02] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-15 05:35:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:35:03] [INFO ] After 256ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-15 05:35:03] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2023-03-15 05:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-15 05:35:03] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2023-03-15 05:35:03] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2023-03-15 05:35:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-15 05:35:03] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2023-03-15 05:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-15 05:35:03] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2023-03-15 05:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-15 05:35:03] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 0 ms to minimize.
[2023-03-15 05:35:03] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2023-03-15 05:35:03] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2023-03-15 05:35:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2023-03-15 05:35:04] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2023-03-15 05:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-15 05:35:04] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2023-03-15 05:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-15 05:35:04] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 2 ms to minimize.
[2023-03-15 05:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-15 05:35:04] [INFO ] After 1321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 254 ms.
[2023-03-15 05:35:04] [INFO ] After 2087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 557 ms.
Support contains 30 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 142/142 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 155 transition count 138
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 151 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 150 transition count 137
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 150 transition count 133
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 18 place count 146 transition count 133
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 38 place count 136 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 135 transition count 123
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 135 transition count 120
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 132 transition count 120
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 53 place count 132 transition count 113
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 60 place count 125 transition count 113
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 62 place count 125 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 63 place count 124 transition count 112
Applied a total of 63 rules in 51 ms. Remains 124 /155 variables (removed 31) and now considering 112/142 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 124/155 places, 112/142 transitions.
Incomplete random walk after 10000 steps, including 734 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 63 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) 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 18) seen :0
Interrupted probabilistic random walk after 138902 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{3=1, 8=1, 11=1}
Probabilistic random walk after 138902 steps, saw 69497 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :3
Running SMT prover for 15 properties.
// Phase 1: matrix 112 rows 124 cols
[2023-03-15 05:35:08] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-15 05:35:08] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-15 05:35:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 05:35:08] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-15 05:35:09] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-15 05:35:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 05:35:09] [INFO ] After 180ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-15 05:35:09] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
[2023-03-15 05:35:09] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2023-03-15 05:35:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2023-03-15 05:35:09] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 7 ms to minimize.
[2023-03-15 05:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-15 05:35:09] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2023-03-15 05:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-15 05:35:09] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2023-03-15 05:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-15 05:35:09] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 0 ms to minimize.
[2023-03-15 05:35:09] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2023-03-15 05:35:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-03-15 05:35:10] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2023-03-15 05:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-15 05:35:10] [INFO ] After 849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-15 05:35:10] [INFO ] After 1352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 293 ms.
Support contains 23 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 112/112 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 124 transition count 110
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 122 transition count 110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 118 transition count 106
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 118 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 117 transition count 105
Applied a total of 15 rules in 21 ms. Remains 117 /124 variables (removed 7) and now considering 105/112 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 117/124 places, 105/112 transitions.
Incomplete random walk after 10000 steps, including 885 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 65 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 63 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 63 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 65 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 65 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 63 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 62 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 63 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 62 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 169005 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169005 steps, saw 84585 distinct states, run finished after 3004 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 105 rows 117 cols
[2023-03-15 05:35:14] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-15 05:35:14] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-15 05:35:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-15 05:35:14] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-15 05:35:14] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-15 05:35:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 05:35:14] [INFO ] After 176ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-15 05:35:14] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2023-03-15 05:35:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-15 05:35:14] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-15 05:35:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-15 05:35:14] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-15 05:35:14] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2023-03-15 05:35:15] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2023-03-15 05:35:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 182 ms
[2023-03-15 05:35:15] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2023-03-15 05:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-15 05:35:15] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2023-03-15 05:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-15 05:35:15] [INFO ] After 759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-15 05:35:15] [INFO ] After 1315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 436 ms.
Support contains 23 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 105/105 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 117/117 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 105/105 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-15 05:35:15] [INFO ] Invariant cache hit.
[2023-03-15 05:35:16] [INFO ] Implicit Places using invariants in 121 ms returned [22, 28, 48, 82, 88, 108, 114]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 122 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 110/117 places, 105/105 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 103
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 108 transition count 103
Applied a total of 5 rules in 13 ms. Remains 108 /110 variables (removed 2) and now considering 103/105 (removed 2) transitions.
// Phase 1: matrix 103 rows 108 cols
[2023-03-15 05:35:16] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:35:16] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-15 05:35:16] [INFO ] Invariant cache hit.
[2023-03-15 05:35:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 05:35:16] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 108/117 places, 103/105 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 504 ms. Remains : 108/117 places, 103/105 transitions.
Incomplete random walk after 10000 steps, including 942 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 68 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 65 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 66 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 64 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 62 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 189910 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{13=1}
Probabilistic random walk after 189910 steps, saw 95065 distinct states, run finished after 3004 ms. (steps per millisecond=63 ) properties seen :1
Running SMT prover for 14 properties.
[2023-03-15 05:35:20] [INFO ] Invariant cache hit.
[2023-03-15 05:35:20] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-15 05:35:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-15 05:35:20] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 05:35:20] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-15 05:35:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 05:35:20] [INFO ] After 136ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-15 05:35:20] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2023-03-15 05:35:20] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-15 05:35:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2023-03-15 05:35:20] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2023-03-15 05:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-15 05:35:20] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2023-03-15 05:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-15 05:35:20] [INFO ] After 507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-15 05:35:21] [INFO ] After 958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 240 ms.
Support contains 21 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 103/103 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 101
Applied a total of 4 rules in 8 ms. Remains 106 /108 variables (removed 2) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 106/108 places, 101/103 transitions.
Incomplete random walk after 10000 steps, including 946 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 701 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 805 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 676 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 674 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 693 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 671 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 657 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 681 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 682 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 679 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 667 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 675 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 658 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 678 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 349528 steps, run timeout after 6001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 349528 steps, saw 175023 distinct states, run finished after 6002 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 101 rows 106 cols
[2023-03-15 05:35:30] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:35:30] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-15 05:35:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-15 05:35:30] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:35:30] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-15 05:35:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 05:35:30] [INFO ] After 162ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-15 05:35:30] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2023-03-15 05:35:30] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-15 05:35:30] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-15 05:35:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2023-03-15 05:35:30] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-15 05:35:30] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
[2023-03-15 05:35:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-15 05:35:31] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2023-03-15 05:35:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-15 05:35:31] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2023-03-15 05:35:31] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2023-03-15 05:35:31] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2023-03-15 05:35:31] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-15 05:35:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 238 ms
[2023-03-15 05:35:31] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2023-03-15 05:35:31] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-15 05:35:31] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2023-03-15 05:35:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2023-03-15 05:35:31] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2023-03-15 05:35:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-15 05:35:31] [INFO ] After 1059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-15 05:35:31] [INFO ] After 1481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 331 ms.
Support contains 21 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 106/106 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-15 05:35:32] [INFO ] Invariant cache hit.
[2023-03-15 05:35:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-15 05:35:32] [INFO ] Invariant cache hit.
[2023-03-15 05:35:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 05:35:32] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-15 05:35:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 05:35:32] [INFO ] Invariant cache hit.
[2023-03-15 05:35:32] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 106/106 places, 101/101 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 105 transition count 100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 105 transition count 98
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 103 transition count 98
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 103 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 101 transition count 96
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 101 transition count 96
Applied a total of 11 rules in 17 ms. Remains 101 /106 variables (removed 5) and now considering 96/101 (removed 5) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 96 rows 101 cols
[2023-03-15 05:35:32] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 05:35:32] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-15 05:35:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-15 05:35:32] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 05:35:32] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 145 ms
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 480 ms
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2023-03-15 05:35:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2023-03-15 05:35:33] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2023-03-15 05:35:34] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2023-03-15 05:35:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-15 05:35:34] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2023-03-15 05:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-15 05:35:34] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2023-03-15 05:35:34] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2023-03-15 05:35:34] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2023-03-15 05:35:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2023-03-15 05:35:34] [INFO ] After 1456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-15 05:35:34] [INFO ] After 1711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Successfully simplified 25 atomic propositions for a total of 16 simplifications.
[2023-03-15 05:35:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 17 ms
[2023-03-15 05:35:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-004-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 16 ms
[2023-03-15 05:35:34] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 79 out of 214 places (down from 95) after GAL structural reductions.
FORMULA DoubleExponent-PT-004-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 356 edges and 214 vertex of which 209 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 211 transition count 198
Applied a total of 3 rules in 5 ms. Remains 211 /214 variables (removed 3) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 211/214 places, 198/198 transitions.
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 14 ms
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 15 ms
[2023-03-15 05:35:34] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 211 transition count 198
Applied a total of 3 rules in 7 ms. Remains 211 /214 variables (removed 3) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 211/214 places, 198/198 transitions.
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 14 ms
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 15 ms
[2023-03-15 05:35:34] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 211 transition count 198
Applied a total of 3 rules in 6 ms. Remains 211 /214 variables (removed 3) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 211/214 places, 198/198 transitions.
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 13 ms
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 13 ms
[2023-03-15 05:35:34] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Graph (complete) has 356 edges and 214 vertex of which 212 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 211 transition count 157
Reduce places removed 40 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 44 rules applied. Total rules applied 85 place count 171 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 89 place count 167 transition count 153
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 89 place count 167 transition count 143
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 109 place count 157 transition count 143
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 155 place count 134 transition count 120
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 134 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 133 transition count 119
Applied a total of 158 rules in 36 ms. Remains 133 /214 variables (removed 81) and now considering 119/198 (removed 79) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 133/214 places, 119/198 transitions.
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 8 ms
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:35:34] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 212 transition count 198
Applied a total of 2 rules in 5 ms. Remains 212 /214 variables (removed 2) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 212/214 places, 198/198 transitions.
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 12 ms
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 13 ms
[2023-03-15 05:35:34] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 211 transition count 198
Applied a total of 3 rules in 6 ms. Remains 211 /214 variables (removed 3) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 211/214 places, 198/198 transitions.
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 12 ms
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 12 ms
[2023-03-15 05:35:34] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 211 transition count 198
Applied a total of 3 rules in 5 ms. Remains 211 /214 variables (removed 3) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 211/214 places, 198/198 transitions.
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 12 ms
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 12 ms
[2023-03-15 05:35:34] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 212 transition count 198
Applied a total of 2 rules in 5 ms. Remains 212 /214 variables (removed 2) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 212/214 places, 198/198 transitions.
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 11 ms
[2023-03-15 05:35:34] [INFO ] Flatten gal took : 11 ms
[2023-03-15 05:35:34] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Graph (complete) has 356 edges and 214 vertex of which 211 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 210 transition count 149
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 162 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 161 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 99 place count 161 transition count 140
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 115 place count 153 transition count 140
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 173 place count 124 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 123 transition count 110
Applied a total of 174 rules in 27 ms. Remains 123 /214 variables (removed 91) and now considering 110/198 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 123/214 places, 110/198 transitions.
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:35:35] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 212 transition count 198
Applied a total of 2 rules in 5 ms. Remains 212 /214 variables (removed 2) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 212/214 places, 198/198 transitions.
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 10 ms
[2023-03-15 05:35:35] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 211 transition count 198
Applied a total of 3 rules in 5 ms. Remains 211 /214 variables (removed 3) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 211/214 places, 198/198 transitions.
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 10 ms
[2023-03-15 05:35:35] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Graph (complete) has 356 edges and 214 vertex of which 211 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 210 transition count 150
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 163 transition count 150
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 95 place count 163 transition count 143
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 109 place count 156 transition count 143
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 167 place count 127 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 126 transition count 113
Applied a total of 168 rules in 26 ms. Remains 126 /214 variables (removed 88) and now considering 113/198 (removed 85) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 126/214 places, 113/198 transitions.
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 6 ms
[2023-03-15 05:35:35] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 211 transition count 198
Applied a total of 3 rules in 5 ms. Remains 211 /214 variables (removed 3) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 211/214 places, 198/198 transitions.
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 9 ms
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 10 ms
[2023-03-15 05:35:35] [INFO ] Input system was already deterministic with 198 transitions.
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 11 ms
[2023-03-15 05:35:35] [INFO ] Flatten gal took : 10 ms
[2023-03-15 05:35:35] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-15 05:35:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 214 places, 198 transitions and 554 arcs took 2 ms.
Total runtime 53375 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/888/ctl_0_ --ctl=/tmp/888/ctl_1_ --ctl=/tmp/888/ctl_2_ --ctl=/tmp/888/ctl_3_ --ctl=/tmp/888/ctl_4_ --ctl=/tmp/888/ctl_5_ --ctl=/tmp/888/ctl_6_ --ctl=/tmp/888/ctl_7_ --ctl=/tmp/888/ctl_8_ --ctl=/tmp/888/ctl_9_ --ctl=/tmp/888/ctl_10_ --ctl=/tmp/888/ctl_11_ --ctl=/tmp/888/ctl_12_ --mu-par --mu-opt
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-00
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-02
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-03
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-04
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-05
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-06
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-07
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-08
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-09
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-10
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-13
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-14
Could not compute solution for formula : DoubleExponent-PT-004-CTLCardinality-15

BK_STOP 1678859764034

--------------------
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-004-CTLCardinality-00
ctl formula formula --ctl=/tmp/888/ctl_0_
ctl formula name DoubleExponent-PT-004-CTLCardinality-02
ctl formula formula --ctl=/tmp/888/ctl_1_
ctl formula name DoubleExponent-PT-004-CTLCardinality-03
ctl formula formula --ctl=/tmp/888/ctl_2_
ctl formula name DoubleExponent-PT-004-CTLCardinality-04
ctl formula formula --ctl=/tmp/888/ctl_3_
ctl formula name DoubleExponent-PT-004-CTLCardinality-05
ctl formula formula --ctl=/tmp/888/ctl_4_
ctl formula name DoubleExponent-PT-004-CTLCardinality-06
ctl formula formula --ctl=/tmp/888/ctl_5_
ctl formula name DoubleExponent-PT-004-CTLCardinality-07
ctl formula formula --ctl=/tmp/888/ctl_6_
ctl formula name DoubleExponent-PT-004-CTLCardinality-08
ctl formula formula --ctl=/tmp/888/ctl_7_
ctl formula name DoubleExponent-PT-004-CTLCardinality-09
ctl formula formula --ctl=/tmp/888/ctl_8_
ctl formula name DoubleExponent-PT-004-CTLCardinality-10
ctl formula formula --ctl=/tmp/888/ctl_9_
ctl formula name DoubleExponent-PT-004-CTLCardinality-13
ctl formula formula --ctl=/tmp/888/ctl_10_
ctl formula name DoubleExponent-PT-004-CTLCardinality-14
ctl formula formula --ctl=/tmp/888/ctl_11_
ctl formula name DoubleExponent-PT-004-CTLCardinality-15
ctl formula formula --ctl=/tmp/888/ctl_12_
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 214 places, 198 transitions and 554 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 198->198 groups
pnml2lts-sym: Regrouping took 0.020 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 214; there are 198 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: 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

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-004"
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-004, 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-167819418500465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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