Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772300617.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300617
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K Apr 30 05:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 05:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:33 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 Dekker-PT-050-CTLCardinality-00
FORMULA_NAME Dekker-PT-050-CTLCardinality-01
FORMULA_NAME Dekker-PT-050-CTLCardinality-02
FORMULA_NAME Dekker-PT-050-CTLCardinality-03
FORMULA_NAME Dekker-PT-050-CTLCardinality-04
FORMULA_NAME Dekker-PT-050-CTLCardinality-05
FORMULA_NAME Dekker-PT-050-CTLCardinality-06
FORMULA_NAME Dekker-PT-050-CTLCardinality-07
FORMULA_NAME Dekker-PT-050-CTLCardinality-08
FORMULA_NAME Dekker-PT-050-CTLCardinality-09
FORMULA_NAME Dekker-PT-050-CTLCardinality-10
FORMULA_NAME Dekker-PT-050-CTLCardinality-11
FORMULA_NAME Dekker-PT-050-CTLCardinality-12
FORMULA_NAME Dekker-PT-050-CTLCardinality-13
FORMULA_NAME Dekker-PT-050-CTLCardinality-14
FORMULA_NAME Dekker-PT-050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652631468820

Running Version 202205111006
[2022-05-15 16:17:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:17:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:17:50] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2022-05-15 16:17:50] [INFO ] Transformed 250 places.
[2022-05-15 16:17:50] [INFO ] Transformed 2600 transitions.
[2022-05-15 16:17:50] [INFO ] Found NUPN structural information;
[2022-05-15 16:17:50] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 368 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-050-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 73 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:17:50] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2022-05-15 16:17:50] [INFO ] Computed 150 place invariants in 19 ms
[2022-05-15 16:17:51] [INFO ] Implicit Places using invariants in 855 ms returned [103, 112, 115, 124, 133, 136, 142, 145, 154, 160, 163, 166, 169, 175, 178, 190, 193, 196, 217, 220, 223, 226, 229, 232, 238, 241, 244]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 892 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 23 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 223/250 places, 2600/2600 transitions.
Support contains 126 out of 223 places after structural reductions.
[2022-05-15 16:17:52] [INFO ] Flatten gal took : 242 ms
[2022-05-15 16:17:52] [INFO ] Flatten gal took : 171 ms
[2022-05-15 16:17:52] [INFO ] Input system was already deterministic with 2600 transitions.
Support contains 125 out of 223 places (down from 126) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 93) seen :49
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Running SMT prover for 42 properties.
[2022-05-15 16:17:53] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:17:53] [INFO ] Computed 123 place invariants in 5 ms
[2022-05-15 16:17:53] [INFO ] [Real]Absence check using 100 positive place invariants in 19 ms returned sat
[2022-05-15 16:17:53] [INFO ] [Real]Absence check using 100 positive and 23 generalized place invariants in 4 ms returned sat
[2022-05-15 16:17:54] [INFO ] After 266ms SMT Verify possible using state equation in real domain returned unsat :27 sat :6 real:9
[2022-05-15 16:17:54] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:17:54] [INFO ] After 107ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :27 sat :0 real:15
[2022-05-15 16:17:54] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :27 sat :0 real:15
[2022-05-15 16:17:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2022-05-15 16:17:54] [INFO ] [Nat]Absence check using 100 positive and 23 generalized place invariants in 4 ms returned sat
[2022-05-15 16:17:54] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :27 sat :15
[2022-05-15 16:17:54] [INFO ] After 178ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :27 sat :15
[2022-05-15 16:17:54] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 5 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2022-05-15 16:17:55] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1695 ms
[2022-05-15 16:17:56] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1695 ms
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 16:17:56] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
[2022-05-15 16:17:57] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 1919 ms
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 157 ms
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
[2022-05-15 16:17:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 16:17:59] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 940 ms
[2022-05-15 16:17:59] [INFO ] After 5217ms SMT Verify possible using trap constraints in natural domain returned unsat :27 sat :15
Attempting to minimize the solution found.
Minimization took 162 ms.
[2022-05-15 16:18:00] [INFO ] After 5819ms SMT Verify possible using all constraints in natural domain returned unsat :27 sat :15
Fused 42 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 22 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 160 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 118014 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118014 steps, saw 98903 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 15 properties.
[2022-05-15 16:18:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:18:03] [INFO ] Computed 123 place invariants in 2 ms
[2022-05-15 16:18:03] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2022-05-15 16:18:03] [INFO ] [Real]Absence check using 100 positive and 23 generalized place invariants in 3 ms returned sat
[2022-05-15 16:18:04] [INFO ] After 231ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:9
[2022-05-15 16:18:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:18:04] [INFO ] After 105ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-15 16:18:04] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-15 16:18:04] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2022-05-15 16:18:04] [INFO ] [Nat]Absence check using 100 positive and 23 generalized place invariants in 3 ms returned sat
[2022-05-15 16:18:04] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-15 16:18:04] [INFO ] After 170ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-15 16:18:04] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2022-05-15 16:18:05] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1667 ms
[2022-05-15 16:18:06] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1667 ms
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 16:18:06] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 16:18:07] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 1938 ms
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:18:08] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-15 16:18:09] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 979 ms
[2022-05-15 16:18:09] [INFO ] After 5213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 158 ms.
[2022-05-15 16:18:09] [INFO ] After 5735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 22 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 84 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 76 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:18:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:18:10] [INFO ] Computed 123 place invariants in 15 ms
[2022-05-15 16:18:10] [INFO ] Implicit Places using invariants in 766 ms returned [100, 105, 108, 118, 123, 126, 133, 140, 143, 148, 159, 166, 169, 172, 181, 184, 187, 190, 193, 196, 211, 220]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 772 ms to find 22 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 201/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 67 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/223 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2022-05-15 16:18:11] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:18:11] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:18:11] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 16:18:11] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-15 16:18:11] [INFO ] After 195ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:8
[2022-05-15 16:18:11] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:18:11] [INFO ] After 86ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-15 16:18:11] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-15 16:18:11] [INFO ] [Nat]Absence check using 100 positive place invariants in 13 ms returned sat
[2022-05-15 16:18:11] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:18:12] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-15 16:18:12] [INFO ] After 137ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-15 16:18:12] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1104 ms
[2022-05-15 16:18:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1105 ms
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2022-05-15 16:18:13] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Trap strengthening procedure interrupted after too many repetitions 837 ms
[2022-05-15 16:18:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 838 ms
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Trap strengthening procedure interrupted after too many repetitions 605 ms
[2022-05-15 16:18:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 606 ms
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 16:18:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 235 ms
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 490 ms
[2022-05-15 16:18:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 491 ms
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 16:18:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 199 ms
[2022-05-15 16:18:15] [INFO ] After 3808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 123 ms.
[2022-05-15 16:18:16] [INFO ] After 4219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 20 out of 201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 55 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 123369 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123369 steps, saw 103231 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 13 properties.
[2022-05-15 16:18:19] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:18:19] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-15 16:18:19] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2022-05-15 16:18:19] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 16:18:20] [INFO ] After 189ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:8
[2022-05-15 16:18:20] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:18:20] [INFO ] After 76ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-15 16:18:20] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-15 16:18:20] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 16:18:20] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:18:20] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-15 16:18:20] [INFO ] After 139ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-05-15 16:18:20] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-15 16:18:20] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 16:18:21] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1095 ms
[2022-05-15 16:18:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1095 ms
[2022-05-15 16:18:21] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 818 ms
[2022-05-15 16:18:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 818 ms
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-15 16:18:22] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Trap strengthening procedure interrupted after too many repetitions 641 ms
[2022-05-15 16:18:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 641 ms
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 238 ms
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2022-05-15 16:18:23] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Trap strengthening procedure interrupted after too many repetitions 486 ms
[2022-05-15 16:18:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 486 ms
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2022-05-15 16:18:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 176 ms
[2022-05-15 16:18:24] [INFO ] After 3782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 131 ms.
[2022-05-15 16:18:24] [INFO ] After 4222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 20 out of 201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 63 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 54 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:18:24] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:18:24] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:18:25] [INFO ] Implicit Places using invariants in 416 ms returned []
[2022-05-15 16:18:25] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:18:25] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:18:25] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:18:25] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2022-05-15 16:18:25] [INFO ] Redundant transitions in 163 ms returned []
[2022-05-15 16:18:25] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:18:25] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:18:26] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Graph (complete) has 305 edges and 201 vertex of which 81 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.4 ms
Discarding 120 places :
Also discarding 1560 output transitions
Drop transitions removed 1560 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 960 transitions
Reduce isomorphic transitions removed 960 transitions.
Iterating post reduction 0 with 961 rules applied. Total rules applied 962 place count 80 transition count 80
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 33 rules applied. Total rules applied 995 place count 58 transition count 69
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1006 place count 58 transition count 58
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 1013 place count 58 transition count 51
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 1034 place count 44 transition count 44
Applied a total of 1034 rules in 64 ms. Remains 44 /201 variables (removed 157) and now considering 44/2600 (removed 2556) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 44 rows 44 cols
[2022-05-15 16:18:26] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-15 16:18:26] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2022-05-15 16:18:26] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:5
[2022-05-15 16:18:26] [INFO ] After 64ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:10
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 16:18:26] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-15 16:18:26] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2022-05-15 16:18:26] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-15 16:18:26] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-15 16:18:26] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
[2022-05-15 16:18:26] [INFO ] Flatten gal took : 2 ms
[2022-05-15 16:18:26] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:18:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16279124294129302207.gal : 1 ms
[2022-05-15 16:18:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5007084046268361699.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10410538986603673798;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16279124294129302207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5007084046268361699.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5007084046268361699.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 12
Reachability property AtomicPropp14 is true.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :12 after 384
Reachability property AtomicPropp87 is true.
Reachability property AtomicPropp72 is true.
Reachability property AtomicPropp44 is true.
Reachability property AtomicPropp5 is true.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :384 after 12288
Reachability property AtomicPropp80 is true.
Reachability property AtomicPropp79 is true.
Reachability property AtomicPropp37 is true.
Reachability property AtomicPropp26 is true.
Reachability property AtomicPropp10 is true.
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :12288 after 393216
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.3593e+06,0.018241,3996,2,69,20,707,8,0,228,181,0
Total reachable state count : 2359296

Verifying 13 reachability properties.
Reachability property AtomicPropp5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp5,1024,0.01874,3996,2,57,20,707,9,0,237,181,0
Reachability property AtomicPropp6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp6,48,0.01896,3996,2,52,20,707,10,0,242,181,0
Reachability property AtomicPropp10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp10,1,0.0193,3996,2,45,20,707,11,0,247,181,0
Reachability property AtomicPropp14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp14,48,0.019659,3996,2,52,20,707,12,0,252,181,0
Reachability property AtomicPropp26 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp26,196608,0.019842,3996,2,64,20,707,13,0,254,181,0
Reachability property AtomicPropp37 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp37,384,0.020117,3996,2,55,20,707,14,0,259,181,0
Reachability property AtomicPropp44 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp44,768,0.020382,3996,2,56,20,707,15,0,261,181,0
Reachability property AtomicPropp70 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp70,196608,0.020621,3996,2,64,20,707,15,0,263,181,0
Reachability property AtomicPropp72 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp72,384,0.020834,3996,2,55,20,707,16,0,265,181,0
Reachability property AtomicPropp79 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp79,6144,0.021167,3996,2,59,20,707,17,0,270,181,0
Reachability property AtomicPropp80 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp80,98304,0.021379,3996,2,63,20,707,18,0,270,181,0
Reachability property AtomicPropp87 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp87,24,0.021661,3996,2,51,20,707,19,0,275,181,0
Reachability property AtomicPropp91 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp91,192,0.021976,3996,2,54,20,707,19,0,276,181,0
Successfully simplified 27 atomic propositions for a total of 13 simplifications.
[2022-05-15 16:18:27] [INFO ] Flatten gal took : 127 ms
[2022-05-15 16:18:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Dekker-PT-050-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 16:18:27] [INFO ] Flatten gal took : 139 ms
[2022-05-15 16:18:27] [INFO ] Input system was already deterministic with 2600 transitions.
Support contains 64 out of 223 places (down from 96) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:18:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:18:27] [INFO ] Computed 123 place invariants in 1 ms
[2022-05-15 16:18:28] [INFO ] Implicit Places using invariants in 711 ms returned [100, 105, 108, 118, 123, 126, 133, 140, 143, 148, 166, 169, 181, 184, 187, 190, 193, 196, 211, 220]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 716 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 203/223 places, 2600/2600 transitions.
[2022-05-15 16:18:28] [INFO ] Flatten gal took : 101 ms
[2022-05-15 16:18:28] [INFO ] Flatten gal took : 101 ms
[2022-05-15 16:18:28] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:18:28] [INFO ] Flatten gal took : 127 ms
[2022-05-15 16:18:29] [INFO ] Flatten gal took : 100 ms
[2022-05-15 16:18:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality1683297986952898732.gal : 22 ms
[2022-05-15 16:18:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality3497904924055390135.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1683297986952898732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3497904924055390135.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.697645,36808,2,654,5,47389,6,0,3415,15080,0


Converting to forward existential form...Done !
original formula: (EF(EX(AX(EG(((p1_8==0)||(p0_24==1)))))) * (EG((p3_20==0)) + (AX((flag_0_20==1)) * ((!(E((((p0_29!=1)&&(flag_0_13==1))&&((p3_38==0)||(fla...300
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX(!(EX(!(EG(((p1_8==0)||(p0_24==1))))))))))] = FALSE * ([(EY((Init * !(EG((p3_20==0))))) *...441
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,6.32391,186548,1,0,5284,1.21331e+06,5250,2623,35777,607961,5251
FORMULA Dekker-PT-050-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 26 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:18:35] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:18:35] [INFO ] Computed 123 place invariants in 4 ms
[2022-05-15 16:18:36] [INFO ] Implicit Places using invariants in 707 ms returned [100, 108, 118, 123, 133, 140, 143, 148, 159, 166, 169, 172, 181, 184, 187, 190, 196, 211, 220]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 712 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 204 /204 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 204/223 places, 2600/2600 transitions.
[2022-05-15 16:18:36] [INFO ] Flatten gal took : 97 ms
[2022-05-15 16:18:36] [INFO ] Flatten gal took : 111 ms
[2022-05-15 16:18:36] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:18:36] [INFO ] Flatten gal took : 103 ms
[2022-05-15 16:18:36] [INFO ] Flatten gal took : 105 ms
[2022-05-15 16:18:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality6745805576523172334.gal : 14 ms
[2022-05-15 16:18:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality1662864378786033877.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6745805576523172334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1662864378786033877.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.674033,36752,2,658,5,47358,6,0,3419,15094,0


Converting to forward existential form...Done !
original formula: E(EX(TRUE) U (E((((flag_1_2==0)||(p1_29==1)) * !(AX((p0_10==1)))) U ((flag_0_36==1) * EG(E((p0_37==1) U (flag_0_9==1))))) * !(E(((flag_1_...280
=> equivalent forward existential formula: [((FwdU(Init,EX(TRUE)) * E((((flag_1_2==0)||(p1_29==1)) * !(!(EX(!((p0_10==1)))))) U ((flag_0_36==1) * EG(E((p0_...332
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.37152,198516,1,0,5304,1.2305e+06,5241,2641,36060,664804,5274
FORMULA Dekker-PT-050-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 18 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:18:43] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:18:43] [INFO ] Computed 123 place invariants in 1 ms
[2022-05-15 16:18:44] [INFO ] Implicit Places using invariants in 746 ms returned [100, 105, 108, 115, 118, 123, 126, 133, 140, 143, 148, 159, 166, 169, 172, 181, 184, 187, 190, 193, 196, 220]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 759 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/223 places, 2600/2600 transitions.
[2022-05-15 16:18:44] [INFO ] Flatten gal took : 86 ms
[2022-05-15 16:18:44] [INFO ] Flatten gal took : 98 ms
[2022-05-15 16:18:44] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:18:44] [INFO ] Flatten gal took : 96 ms
[2022-05-15 16:18:44] [INFO ] Flatten gal took : 119 ms
[2022-05-15 16:18:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality13673359851951103508.gal : 9 ms
[2022-05-15 16:18:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality4222979638159917778.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13673359851951103508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4222979638159917778.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.708748,36812,2,646,5,47209,6,0,3407,15008,0


Converting to forward existential form...Done !
original formula: AX(EX(EX(((p0_45==0)||(p1_43==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(EX(((p0_45==0)||(p1_43==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,4.52257,153408,1,0,5262,996172,5216,2605,35290,484978,5211
FORMULA Dekker-PT-050-CTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:18:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:18:49] [INFO ] Computed 123 place invariants in 2 ms
[2022-05-15 16:18:50] [INFO ] Implicit Places using invariants in 724 ms returned [100, 105, 108, 115, 118, 123, 126, 133, 140, 143, 148, 159, 166, 169, 172, 181, 184, 187, 190, 193, 196, 211, 220]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 727 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/223 places, 2600/2600 transitions.
[2022-05-15 16:18:50] [INFO ] Flatten gal took : 85 ms
[2022-05-15 16:18:50] [INFO ] Flatten gal took : 115 ms
[2022-05-15 16:18:50] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:18:50] [INFO ] Flatten gal took : 94 ms
[2022-05-15 16:18:50] [INFO ] Flatten gal took : 89 ms
[2022-05-15 16:18:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality1773540300125699222.gal : 9 ms
[2022-05-15 16:18:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality17930902531152041659.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1773540300125699222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17930902531152041659.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.696259,36648,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: E((EX((flag_1_40==1)) + (p3_23==1)) U (EX(TRUE) * ((flag_0_33==0)||(p1_20==1))))
=> equivalent forward existential formula: [(EY((FwdU(Init,(EX((flag_1_40==1)) + (p3_23==1))) * ((flag_0_33==0)||(p1_20==1)))) * TRUE)] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,4.86215,151980,1,0,5262,1.00545e+06,5219,2605,35632,492367,5212
FORMULA Dekker-PT-050-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:18:55] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:18:55] [INFO ] Computed 123 place invariants in 3 ms
[2022-05-15 16:18:56] [INFO ] Implicit Places using invariants in 745 ms returned [100, 105, 108, 115, 118, 123, 126, 133, 140, 143, 148, 159, 166, 169, 172, 181, 184, 187, 190, 193, 196, 211, 220]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 748 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/223 places, 2600/2600 transitions.
[2022-05-15 16:18:56] [INFO ] Flatten gal took : 82 ms
[2022-05-15 16:18:56] [INFO ] Flatten gal took : 96 ms
[2022-05-15 16:18:56] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:18:56] [INFO ] Flatten gal took : 113 ms
[2022-05-15 16:18:56] [INFO ] Flatten gal took : 90 ms
[2022-05-15 16:18:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality7032136741584926146.gal : 8 ms
[2022-05-15 16:18:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality17401119801627452499.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7032136741584926146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17401119801627452499.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.713813,36688,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.807931,36688,1,0,6,46701,7,1,6448,14896,1
FORMULA Dekker-PT-050-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 18 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:18:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:18:57] [INFO ] Computed 123 place invariants in 2 ms
[2022-05-15 16:18:58] [INFO ] Implicit Places using invariants in 744 ms returned [100, 105, 115, 118, 123, 126, 133, 140, 143, 148, 159, 169, 172, 181, 184, 187, 190, 193, 211, 220]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 746 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 15 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 203/223 places, 2600/2600 transitions.
[2022-05-15 16:18:58] [INFO ] Flatten gal took : 101 ms
[2022-05-15 16:18:58] [INFO ] Flatten gal took : 100 ms
[2022-05-15 16:18:58] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:18:58] [INFO ] Flatten gal took : 93 ms
[2022-05-15 16:18:59] [INFO ] Flatten gal took : 96 ms
[2022-05-15 16:18:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality12729926090983690313.gal : 91 ms
[2022-05-15 16:18:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3346502333436687080.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12729926090983690313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3346502333436687080.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.748653,36904,2,654,5,47488,6,0,3415,15098,0


Converting to forward existential form...Done !
original formula: AG(((AX(EF((p3_22==1))) + EX(EX((flag_0_34==0)))) + ((EF((p3_37==0)) * AF((p0_3==0))) * (AX(FALSE) * ((p0_27==0)||((p1_44==0)&&(p0_38==1)...161
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((!(EX(!(E(TRUE U (p3_22==1))))) + EX(EX((flag_0_34==0)))))) * !(E(TRUE U (p3_37==0))))]...528
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,5.95032,160536,1,0,5269,1.05834e+06,5235,2610,35752,517029,5230
FORMULA Dekker-PT-050-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 247 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:19:05] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:19:05] [INFO ] Computed 123 place invariants in 1 ms
[2022-05-15 16:19:06] [INFO ] Implicit Places using invariants in 724 ms returned [100, 105, 108, 115, 118, 123, 126, 133, 140, 143, 148, 159, 166, 172, 181, 184, 187, 193, 196, 211, 220]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 730 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 202/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 119 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 202/223 places, 2600/2600 transitions.
[2022-05-15 16:19:06] [INFO ] Flatten gal took : 87 ms
[2022-05-15 16:19:06] [INFO ] Flatten gal took : 100 ms
[2022-05-15 16:19:06] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:19:06] [INFO ] Flatten gal took : 89 ms
[2022-05-15 16:19:06] [INFO ] Flatten gal took : 108 ms
[2022-05-15 16:19:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality11933194169906627572.gal : 8 ms
[2022-05-15 16:19:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality1958733167152469522.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11933194169906627572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1958733167152469522.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.722238,36764,2,650,5,47431,6,0,3411,15068,0


Converting to forward existential form...Done !
original formula: AG(AF((EG(E(((p1_27==0)||(p3_1==1)) U (p0_28==1))) * (AF(((flag_0_32==0)&&(p3_29==1))) + E((p3_39!=1) U (((p0_36==0)||(p0_36==1))&&((p1_7...182
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EG(E(((p1_27==0)||(p3_1==1)) U (p0_28==1))) * (!(EG(!(((flag_0_32==0)&&(p3_29==1))))) +...240
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.08269,170548,1,0,5282,1.12898e+06,5243,2624,35724,558693,5249
FORMULA Dekker-PT-050-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:19:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:19:13] [INFO ] Computed 123 place invariants in 1 ms
[2022-05-15 16:19:13] [INFO ] Implicit Places using invariants in 726 ms returned [100, 105, 108, 115, 123, 126, 133, 140, 143, 148, 159, 166, 169, 172, 181, 184, 187, 190, 193, 196, 211, 220]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 729 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/223 places, 2600/2600 transitions.
[2022-05-15 16:19:13] [INFO ] Flatten gal took : 82 ms
[2022-05-15 16:19:13] [INFO ] Flatten gal took : 90 ms
[2022-05-15 16:19:14] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:19:14] [INFO ] Flatten gal took : 91 ms
[2022-05-15 16:19:14] [INFO ] Flatten gal took : 90 ms
[2022-05-15 16:19:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality6150730744370945294.gal : 8 ms
[2022-05-15 16:19:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality3302550622362360041.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6150730744370945294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3302550622362360041.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.718,36732,2,646,5,46791,6,0,3407,14932,0


Converting to forward existential form...Done !
original formula: AX(E(EX(EF(((flag_1_38==0)||(p3_22==1)))) U E(EG((p0_7==1)) U (flag_1_5==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(EX(E(TRUE U ((flag_1_38==0)||(p3_22==1)))) U E(EG((p0_7==1)) U (flag_1_5==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,5.52191,167252,1,0,5271,1.08251e+06,5232,2614,35567,545922,5239
FORMULA Dekker-PT-050-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:19:19] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:19:19] [INFO ] Computed 123 place invariants in 3 ms
[2022-05-15 16:19:20] [INFO ] Implicit Places using invariants in 762 ms returned [100, 105, 115, 118, 123, 126, 133, 140, 143, 148, 159, 166, 169, 172, 181, 184, 187, 190, 193, 196, 211, 220]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 769 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/223 places, 2600/2600 transitions.
[2022-05-15 16:19:20] [INFO ] Flatten gal took : 78 ms
[2022-05-15 16:19:20] [INFO ] Flatten gal took : 113 ms
[2022-05-15 16:19:21] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:19:21] [INFO ] Flatten gal took : 87 ms
[2022-05-15 16:19:21] [INFO ] Flatten gal took : 89 ms
[2022-05-15 16:19:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality13088895469925154935.gal : 8 ms
[2022-05-15 16:19:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality2210627701760917965.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13088895469925154935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2210627701760917965.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.683641,36724,2,646,5,46747,6,0,3407,14924,0


Converting to forward existential form...Done !
original formula: EX((EX(AG((((flag_1_23==0)&&((flag_0_26==0)||(p1_40==1)))&&((p0_3==0)||(p0_3==1))))) + EX(((flag_0_25==0)&&(p3_13==1)))))
=> equivalent forward existential formula: ([(EY(EY(Init)) * !(E(TRUE U !((((flag_1_23==0)&&((flag_0_26==0)||(p1_40==1)))&&((p0_3==0)||(p0_3==1)))))))] != ...220
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,4.64161,152204,1,0,5264,1.00478e+06,5223,2603,35472,485433,5213
FORMULA Dekker-PT-050-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 18 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:19:25] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:19:25] [INFO ] Computed 123 place invariants in 3 ms
[2022-05-15 16:19:26] [INFO ] Implicit Places using invariants in 740 ms returned [100, 105, 108, 115, 118, 123, 126, 133, 140, 143, 148, 159, 166, 169, 172, 181, 184, 190, 193, 196, 211, 220]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 744 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/223 places, 2600/2600 transitions.
[2022-05-15 16:19:26] [INFO ] Flatten gal took : 87 ms
[2022-05-15 16:19:26] [INFO ] Flatten gal took : 92 ms
[2022-05-15 16:19:27] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:19:27] [INFO ] Flatten gal took : 86 ms
[2022-05-15 16:19:27] [INFO ] Flatten gal took : 88 ms
[2022-05-15 16:19:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality9826176591156101662.gal : 9 ms
[2022-05-15 16:19:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality3954054169982446190.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9826176591156101662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3954054169982446190.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.671603,36732,2,646,5,47099,6,0,3407,14988,0


Converting to forward existential form...Done !
original formula: EG(EX((E(EF(((flag_0_44==0)||(p0_35==1))) U (flag_0_6!=1)) * ((p3_17==0)||(flag_0_48==1)))))
=> equivalent forward existential formula: [FwdG(Init,EX((E(E(TRUE U ((flag_0_44==0)||(p0_35==1))) U (flag_0_6!=1)) * ((p3_17==0)||(flag_0_48==1)))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,5.07841,154968,1,0,5262,1.03553e+06,5227,2606,35925,501147,5223
FORMULA Dekker-PT-050-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 223 /223 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:19:32] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 223 cols
[2022-05-15 16:19:32] [INFO ] Computed 123 place invariants in 1 ms
[2022-05-15 16:19:33] [INFO ] Implicit Places using invariants in 733 ms returned [100, 105, 108, 115, 118, 123, 126, 133, 140, 143, 148, 159, 166, 169, 172, 181, 184, 187, 190, 193, 196, 211, 220]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 741 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/223 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/223 places, 2600/2600 transitions.
[2022-05-15 16:19:33] [INFO ] Flatten gal took : 81 ms
[2022-05-15 16:19:33] [INFO ] Flatten gal took : 93 ms
[2022-05-15 16:19:33] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:19:33] [INFO ] Flatten gal took : 122 ms
[2022-05-15 16:19:33] [INFO ] Flatten gal took : 85 ms
[2022-05-15 16:19:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9047351452618884027.gal : 8 ms
[2022-05-15 16:19:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality18407279991763670715.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9047351452618884027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18407279991763670715.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.692854,36812,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AX(AX(EF(((flag_0_29==1)||((p1_31==0)&&(flag_0_46==0))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U ((flag_0_29==1)||((p1_31==0)&&(flag_0_46==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,4.6814,152028,1,0,5260,1.01361e+06,5221,2602,35276,488038,5210
FORMULA Dekker-PT-050-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2022-05-15 16:19:38] [INFO ] Flatten gal took : 96 ms
[2022-05-15 16:19:38] [INFO ] Flatten gal took : 99 ms
Total runtime 108702 ms.

BK_STOP 1652631578767

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Dekker-PT-050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Dekker-PT-050, 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 r060-tall-165254772300617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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