About the Execution of ITS-Tools for Peterson-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 753.260 | 270369.00 | 295105.00 | 1029.60 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r147-tall-162089138200388.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-4, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-162089138200388
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 697K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 286K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 27K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 27 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 27 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 25 08:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 25 08:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 520K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1620949179125
Running Version 0
[2021-05-13 23:39:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2021-05-13 23:39:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:39:40] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-13 23:39:40] [INFO ] Transformed 480 places.
[2021-05-13 23:39:40] [INFO ] Transformed 690 transitions.
[2021-05-13 23:39:40] [INFO ] Found NUPN structural information;
[2021-05-13 23:39:40] [INFO ] Parsed PT model containing 480 places and 690 transitions in 125 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 480) seen :218
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 262) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 262) seen :0
Running SMT prover for 262 properties.
[2021-05-13 23:39:41] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-13 23:39:41] [INFO ] Computed 19 place invariants in 31 ms
[2021-05-13 23:39:43] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:262
[2021-05-13 23:39:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-13 23:39:45] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:39:50] [INFO ] [Nat]Absence check using state equation in 4053 ms returned unsat :0 sat :262
[2021-05-13 23:39:50] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-13 23:39:50] [INFO ] [Nat]Added 132 Read/Feed constraints in 17 ms returned sat
Attempting to minimize the solution found.
Minimization took 4817 ms.
[2021-05-13 23:40:00] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :262
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 262 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 480 transition count 632
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 422 transition count 632
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 116 place count 422 transition count 582
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 216 place count 372 transition count 582
Applied a total of 216 rules in 76 ms. Remains 372 /480 variables (removed 108) and now considering 582/690 (removed 108) transitions.
Finished structural reductions, in 1 iterations. Remains : 372/480 places, 582/690 transitions.
[2021-05-13 23:40:00] [INFO ] Flatten gal took : 76 ms
[2021-05-13 23:40:00] [INFO ] Flatten gal took : 32 ms
[2021-05-13 23:40:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4118138444092377314.gal : 16 ms
[2021-05-13 23:40:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3510535902342898588.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4118138444092377314.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3510535902342898588.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4118138444092377314.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3510535902342898588.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3510535902342898588.prop.
SDD proceeding with computation,262 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,262 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,262 properties remain. new max is 16
SDD size :4 after 13
Invariant property smplace_165 does not hold.
Invariant property smplace_19 does not hold.
SDD proceeding with computation,260 properties remain. new max is 16
SDD size :13 after 18
Invariant property smplace_349 does not hold.
SDD proceeding with computation,259 properties remain. new max is 16
SDD size :18 after 19
Invariant property smplace_280 does not hold.
SDD proceeding with computation,258 properties remain. new max is 16
SDD size :19 after 40
SDD proceeding with computation,258 properties remain. new max is 32
SDD size :40 after 44
Invariant property smplace_171 does not hold.
Invariant property smplace_43 does not hold.
Invariant property smplace_38 does not hold.
Invariant property smplace_21 does not hold.
SDD proceeding with computation,254 properties remain. new max is 32
SDD size :44 after 121
Invariant property smplace_351 does not hold.
SDD proceeding with computation,253 properties remain. new max is 32
SDD size :121 after 127
SDD proceeding with computation,253 properties remain. new max is 64
SDD size :127 after 145
SDD proceeding with computation,253 properties remain. new max is 128
SDD size :145 after 216
SDD proceeding with computation,253 properties remain. new max is 256
SDD size :216 after 432
Invariant property smplace_364 does not hold.
Invariant property smplace_160 does not hold.
Invariant property smplace_44 does not hold.
Invariant property smplace_26 does not hold.
SDD proceeding with computation,249 properties remain. new max is 256
SDD size :432 after 741
Invariant property smplace_368 does not hold.
Invariant property smplace_363 does not hold.
Invariant property smplace_284 does not hold.
Invariant property smplace_281 does not hold.
Invariant property smplace_159 does not hold.
Invariant property smplace_154 does not hold.
Invariant property smplace_25 does not hold.
Invariant property smplace_6 does not hold.
SDD proceeding with computation,241 properties remain. new max is 256
SDD size :741 after 1040
Invariant property smplace_399 does not hold.
Invariant property smplace_398 does not hold.
Invariant property smplace_397 does not hold.
Invariant property smplace_263 does not hold.
Invariant property smplace_262 does not hold.
Invariant property smplace_261 does not hold.
Invariant property smplace_186 does not hold.
Invariant property smplace_176 does not hold.
Invariant property smplace_175 does not hold.
SDD proceeding with computation,232 properties remain. new max is 256
SDD size :1040 after 3047
SDD proceeding with computation,232 properties remain. new max is 512
SDD size :3047 after 3558
Invariant property smplace_366 does not hold.
Invariant property smplace_361 does not hold.
Invariant property smplace_283 does not hold.
Invariant property smplace_239 does not hold.
Invariant property smplace_169 does not hold.
Invariant property smplace_152 does not hold.
Invariant property smplace_23 does not hold.
Invariant property smplace_4 does not hold.
SDD proceeding with computation,224 properties remain. new max is 512
SDD size :3558 after 4308
SDD proceeding with computation,224 properties remain. new max is 1024
SDD size :4308 after 8336
Invariant property smplace_379 does not hold.
Invariant property smplace_360 does not hold.
Invariant property smplace_271 does not hold.
Invariant property smplace_164 does not hold.
Invariant property smplace_141 does not hold.
Invariant property smplace_31 does not hold.
Invariant property smplace_9 does not hold.
SDD proceeding with computation,217 properties remain. new max is 1024
SDD size :8336 after 14260
Invariant property smplace_358 does not hold.
Invariant property smplace_256 does not hold.
Invariant property smplace_158 does not hold.
Invariant property smplace_28 does not hold.
SDD proceeding with computation,213 properties remain. new max is 1024
SDD size :14260 after 22805
SDD proceeding with computation,213 properties remain. new max is 2048
SDD size :22805 after 28436
Invariant property smplace_376 does not hold.
Invariant property smplace_275 does not hold.
Invariant property smplace_146 does not hold.
Invariant property smplace_46 does not hold.
Invariant property smplace_13 does not hold.
SDD proceeding with computation,208 properties remain. new max is 2048
SDD size :28436 after 44712
Invariant property smplace_408 does not hold.
Invariant property smplace_374 does not hold.
Invariant property smplace_373 does not hold.
Invariant property smplace_269 does not hold.
Invariant property smplace_254 does not hold.
Invariant property smplace_162 does not hold.
Invariant property smplace_144 does not hold.
Invariant property smplace_143 does not hold.
Invariant property smplace_48 does not hold.
Invariant property smplace_42 does not hold.
Invariant property smplace_29 does not hold.
Invariant property smplace_12 does not hold.
Invariant property smplace_11 does not hold.
SDD proceeding with computation,195 properties remain. new max is 2048
SDD size :44712 after 53970
Invariant property smplace_403 does not hold.
Invariant property smplace_402 does not hold.
Invariant property smplace_401 does not hold.
Invariant property smplace_391 does not hold.
Invariant property smplace_268 does not hold.
Invariant property smplace_267 does not hold.
Invariant property smplace_266 does not hold.
Invariant property smplace_265 does not hold.
Invariant property smplace_180 does not hold.
Invariant property smplace_179 does not hold.
Invariant property smplace_177 does not hold.
Invariant property smplace_174 does not hold.
Invariant property smplace_47 does not hold.
SDD proceeding with computation,182 properties remain. new max is 2048
SDD size :53970 after 158782
SDD proceeding with computation,182 properties remain. new max is 4096
SDD size :158782 after 177442
SDD proceeding with computation,182 properties remain. new max is 8192
SDD size :177442 after 229940
Detected timeout of ITS tools.
[2021-05-13 23:40:15] [INFO ] Flatten gal took : 30 ms
[2021-05-13 23:40:15] [INFO ] Applying decomposition
[2021-05-13 23:40:16] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6365107587237692595.txt, -o, /tmp/graph6365107587237692595.bin, -w, /tmp/graph6365107587237692595.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6365107587237692595.bin, -l, -1, -v, -w, /tmp/graph6365107587237692595.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:40:16] [INFO ] Decomposing Gal with order
[2021-05-13 23:40:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:40:16] [INFO ] Removed a total of 499 redundant transitions.
[2021-05-13 23:40:16] [INFO ] Flatten gal took : 103 ms
[2021-05-13 23:40:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 173 labels/synchronizations in 21 ms.
[2021-05-13 23:40:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12119450661907480473.gal : 9 ms
[2021-05-13 23:40:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11147310728215096882.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12119450661907480473.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11147310728215096882.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12119450661907480473.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11147310728215096882.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11147310728215096882.prop.
SDD proceeding with computation,182 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,182 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,182 properties remain. new max is 16
SDD size :1 after 56
SDD proceeding with computation,182 properties remain. new max is 32
SDD size :56 after 414
SDD proceeding with computation,182 properties remain. new max is 64
SDD size :414 after 1384
SDD proceeding with computation,182 properties remain. new max is 128
SDD size :1384 after 4312
Invariant property smplace_442 does not hold.
Invariant property smplace_439 does not hold.
Invariant property smplace_388 does not hold.
Invariant property smplace_385 does not hold.
Invariant property smplace_316 does not hold.
Invariant property smplace_315 does not hold.
Invariant property smplace_311 does not hold.
Invariant property smplace_310 does not hold.
Invariant property smplace_219 does not hold.
Invariant property smplace_218 does not hold.
Invariant property smplace_195 does not hold.
Invariant property smplace_190 does not hold.
Invariant property smplace_78 does not hold.
Invariant property smplace_68 does not hold.
Invariant property smplace_66 does not hold.
Invariant property smplace_65 does not hold.
Invariant property smplace_63 does not hold.
Invariant property smplace_62 does not hold.
Invariant property smplace_61 does not hold.
Invariant property smplace_57 does not hold.
SDD proceeding with computation,162 properties remain. new max is 128
SDD size :4312 after 144464
Invariant property smplace_440 does not hold.
Invariant property smplace_437 does not hold.
Invariant property smplace_389 does not hold.
Invariant property smplace_386 does not hold.
Invariant property smplace_378 does not hold.
Invariant property smplace_314 does not hold.
Invariant property smplace_312 does not hold.
Invariant property smplace_301 does not hold.
Invariant property smplace_238 does not hold.
Invariant property smplace_217 does not hold.
Invariant property smplace_202 does not hold.
Invariant property smplace_191 does not hold.
Invariant property smplace_189 does not hold.
Invariant property smplace_156 does not hold.
Invariant property smplace_79 does not hold.
Invariant property smplace_77 does not hold.
Invariant property smplace_52 does not hold.
Invariant property smplace_8 does not hold.
SDD proceeding with computation,144 properties remain. new max is 128
SDD size :144464 after 916639
Invariant property smplace_441 does not hold.
Invariant property smplace_438 does not hold.
Invariant property smplace_432 does not hold.
Invariant property smplace_407 does not hold.
Invariant property smplace_406 does not hold.
Invariant property smplace_405 does not hold.
Invariant property smplace_404 does not hold.
Invariant property smplace_396 does not hold.
Invariant property smplace_393 does not hold.
Invariant property smplace_392 does not hold.
Invariant property smplace_362 does not hold.
Invariant property smplace_357 does not hold.
Invariant property smplace_356 does not hold.
Invariant property smplace_313 does not hold.
Invariant property smplace_304 does not hold.
Invariant property smplace_290 does not hold.
Invariant property smplace_286 does not hold.
Invariant property smplace_282 does not hold.
Invariant property smplace_278 does not hold.
Invariant property smplace_273 does not hold.
Invariant property smplace_260 does not hold.
Invariant property smplace_253 does not hold.
Invariant property smplace_220 does not hold.
Invariant property smplace_209 does not hold.
Invariant property smplace_203 does not hold.
Invariant property smplace_198 does not hold.
Invariant property smplace_192 does not hold.
Invariant property smplace_184 does not hold.
Invariant property smplace_183 does not hold.
Invariant property smplace_178 does not hold.
Invariant property smplace_173 does not hold.
Invariant property smplace_170 does not hold.
Invariant property smplace_168 does not hold.
Invariant property smplace_161 does not hold.
Invariant property smplace_157 does not hold.
Invariant property smplace_99 does not hold.
Invariant property smplace_91 does not hold.
Invariant property smplace_80 does not hold.
Invariant property smplace_69 does not hold.
Invariant property smplace_67 does not hold.
Invariant property smplace_64 does not hold.
Invariant property smplace_56 does not hold.
Invariant property smplace_49 does not hold.
Invariant property smplace_45 does not hold.
Invariant property smplace_41 does not hold.
Invariant property smplace_36 does not hold.
Invariant property smplace_35 does not hold.
Invariant property smplace_30 does not hold.
Invariant property smplace_27 does not hold.
Invariant property smplace_24 does not hold.
Invariant property smplace_18 does not hold.
SDD proceeding with computation,93 properties remain. new max is 128
SDD size :916639 after 2.7748e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3414956909625149578
[2021-05-13 23:40:31] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3414956909625149578
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3414956909625149578]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3414956909625149578] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3414956909625149578] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6133 ms. (steps per millisecond=163 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=735 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=740 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=684 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=787 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=787 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=787 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=781 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=775 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=819 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=746 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=819 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=800 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=800 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=800 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=800 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=800 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=800 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=800 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=806 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=800 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=813 ) properties (out of 93) seen :0
Interrupted probabilistic random walk after 7940184 steps, run timeout after 30001 ms. (steps per millisecond=264 ) properties seen :{3=1, 26=1, 45=1, 66=1, 79=1}
Probabilistic random walk after 7940184 steps, saw 1323473 distinct states, run finished after 30004 ms. (steps per millisecond=264 ) properties seen :{3=1, 26=1, 45=1, 66=1, 79=1}
Running SMT prover for 88 properties.
[2021-05-13 23:41:14] [INFO ] Flow matrix only has 522 transitions (discarded 60 similar events)
// Phase 1: matrix 522 rows 372 cols
[2021-05-13 23:41:14] [INFO ] Computed 19 place invariants in 13 ms
[2021-05-13 23:41:15] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:88
[2021-05-13 23:41:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-13 23:41:15] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-13 23:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:41:17] [INFO ] [Nat]Absence check using state equation in 1152 ms returned unsat :0 sat :88
[2021-05-13 23:41:17] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-13 23:41:17] [INFO ] [Nat]Added 132 Read/Feed constraints in 7 ms returned sat
Attempting to minimize the solution found.
Minimization took 1235 ms.
[2021-05-13 23:41:19] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :88
Incomplete Parikh walk after 11560 steps, including 481 resets, run finished after 102 ms. (steps per millisecond=113 ) properties (out of 88) seen :6 could not realise parikh vector
Incomplete Parikh walk after 11480 steps, including 485 resets, run finished after 77 ms. (steps per millisecond=149 ) properties (out of 82) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11400 steps, including 491 resets, run finished after 76 ms. (steps per millisecond=150 ) properties (out of 82) seen :5 could not realise parikh vector
Incomplete Parikh walk after 11340 steps, including 478 resets, run finished after 74 ms. (steps per millisecond=153 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11290 steps, including 483 resets, run finished after 76 ms. (steps per millisecond=148 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11000 steps, including 481 resets, run finished after 70 ms. (steps per millisecond=157 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11140 steps, including 484 resets, run finished after 70 ms. (steps per millisecond=159 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11030 steps, including 472 resets, run finished after 69 ms. (steps per millisecond=159 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11070 steps, including 470 resets, run finished after 70 ms. (steps per millisecond=158 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11100 steps, including 481 resets, run finished after 69 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11250 steps, including 480 resets, run finished after 69 ms. (steps per millisecond=163 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11280 steps, including 483 resets, run finished after 70 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11320 steps, including 483 resets, run finished after 70 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11300 steps, including 483 resets, run finished after 70 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11600 steps, including 498 resets, run finished after 72 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11890 steps, including 507 resets, run finished after 74 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11970 steps, including 508 resets, run finished after 73 ms. (steps per millisecond=163 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12000 steps, including 498 resets, run finished after 73 ms. (steps per millisecond=164 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11960 steps, including 496 resets, run finished after 73 ms. (steps per millisecond=163 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11850 steps, including 503 resets, run finished after 74 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11760 steps, including 498 resets, run finished after 72 ms. (steps per millisecond=163 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11910 steps, including 500 resets, run finished after 76 ms. (steps per millisecond=156 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12030 steps, including 512 resets, run finished after 74 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12110 steps, including 511 resets, run finished after 76 ms. (steps per millisecond=159 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12150 steps, including 504 resets, run finished after 75 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12030 steps, including 505 resets, run finished after 74 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11990 steps, including 502 resets, run finished after 75 ms. (steps per millisecond=159 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11890 steps, including 498 resets, run finished after 73 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11880 steps, including 507 resets, run finished after 73 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11910 steps, including 507 resets, run finished after 74 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11730 steps, including 499 resets, run finished after 74 ms. (steps per millisecond=158 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11430 steps, including 487 resets, run finished after 71 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11550 steps, including 491 resets, run finished after 71 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11350 steps, including 489 resets, run finished after 70 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11260 steps, including 483 resets, run finished after 71 ms. (steps per millisecond=158 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11170 steps, including 478 resets, run finished after 70 ms. (steps per millisecond=159 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11210 steps, including 479 resets, run finished after 70 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11240 steps, including 487 resets, run finished after 70 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11270 steps, including 478 resets, run finished after 71 ms. (steps per millisecond=158 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11380 steps, including 487 resets, run finished after 71 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11320 steps, including 490 resets, run finished after 71 ms. (steps per millisecond=159 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11260 steps, including 481 resets, run finished after 70 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11550 steps, including 485 resets, run finished after 72 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11590 steps, including 486 resets, run finished after 72 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11620 steps, including 488 resets, run finished after 72 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11550 steps, including 488 resets, run finished after 71 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11660 steps, including 491 resets, run finished after 72 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11400 steps, including 482 resets, run finished after 70 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11440 steps, including 492 resets, run finished after 71 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11420 steps, including 493 resets, run finished after 72 ms. (steps per millisecond=158 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11720 steps, including 488 resets, run finished after 73 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12010 steps, including 507 resets, run finished after 74 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12050 steps, including 501 resets, run finished after 74 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12000 steps, including 502 resets, run finished after 75 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11850 steps, including 501 resets, run finished after 74 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11870 steps, including 493 resets, run finished after 74 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11890 steps, including 495 resets, run finished after 74 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11910 steps, including 500 resets, run finished after 75 ms. (steps per millisecond=158 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11610 steps, including 492 resets, run finished after 72 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11560 steps, including 492 resets, run finished after 72 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11260 steps, including 481 resets, run finished after 70 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11320 steps, including 485 resets, run finished after 71 ms. (steps per millisecond=159 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11580 steps, including 493 resets, run finished after 71 ms. (steps per millisecond=163 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11730 steps, including 502 resets, run finished after 72 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11430 steps, including 486 resets, run finished after 70 ms. (steps per millisecond=163 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11400 steps, including 484 resets, run finished after 71 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11370 steps, including 484 resets, run finished after 70 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11260 steps, including 486 resets, run finished after 70 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11250 steps, including 476 resets, run finished after 71 ms. (steps per millisecond=158 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11220 steps, including 482 resets, run finished after 69 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11210 steps, including 477 resets, run finished after 69 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11200 steps, including 485 resets, run finished after 69 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11190 steps, including 485 resets, run finished after 70 ms. (steps per millisecond=159 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11490 steps, including 496 resets, run finished after 71 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11600 steps, including 485 resets, run finished after 72 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11450 steps, including 489 resets, run finished after 71 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11410 steps, including 486 resets, run finished after 72 ms. (steps per millisecond=158 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11380 steps, including 486 resets, run finished after 71 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11450 steps, including 485 resets, run finished after 71 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11560 steps, including 486 resets, run finished after 71 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11890 steps, including 494 resets, run finished after 74 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12010 steps, including 499 resets, run finished after 74 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11710 steps, including 498 resets, run finished after 72 ms. (steps per millisecond=162 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11450 steps, including 485 resets, run finished after 71 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11510 steps, including 493 resets, run finished after 72 ms. (steps per millisecond=159 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11460 steps, including 491 resets, run finished after 71 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11760 steps, including 494 resets, run finished after 73 ms. (steps per millisecond=161 ) properties (out of 77) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11740 steps, including 501 resets, run finished after 73 ms. (steps per millisecond=160 ) properties (out of 77) seen :0 could not realise parikh vector
Support contains 77 out of 372 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 372/372 places, 582/582 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 372 transition count 481
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 271 transition count 481
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 202 place count 271 transition count 444
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 276 place count 234 transition count 444
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 296 place count 224 transition count 434
Applied a total of 296 rules in 56 ms. Remains 224 /372 variables (removed 148) and now considering 434/582 (removed 148) transitions.
Finished structural reductions, in 1 iterations. Remains : 224/372 places, 434/582 transitions.
[2021-05-13 23:41:26] [INFO ] Flatten gal took : 20 ms
[2021-05-13 23:41:26] [INFO ] Flatten gal took : 19 ms
[2021-05-13 23:41:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18219802055866976883.gal : 2 ms
[2021-05-13 23:41:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9670074294217548916.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality18219802055866976883.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9670074294217548916.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality18219802055866976883.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9670074294217548916.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9670074294217548916.prop.
SDD proceeding with computation,77 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,77 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,77 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,77 properties remain. new max is 32
SDD size :12 after 25
SDD proceeding with computation,77 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,77 properties remain. new max is 128
SDD size :32 after 136
SDD proceeding with computation,77 properties remain. new max is 256
SDD size :136 after 272
SDD proceeding with computation,77 properties remain. new max is 512
SDD size :272 after 516
SDD proceeding with computation,77 properties remain. new max is 1024
SDD size :516 after 1969
SDD proceeding with computation,77 properties remain. new max is 2048
SDD size :1969 after 5093
SDD proceeding with computation,77 properties remain. new max is 4096
SDD size :5093 after 10061
SDD proceeding with computation,77 properties remain. new max is 8192
SDD size :10061 after 72843
SDD proceeding with computation,77 properties remain. new max is 16384
SDD size :72843 after 148105
SDD proceeding with computation,77 properties remain. new max is 32768
SDD size :148105 after 293574
Detected timeout of ITS tools.
[2021-05-13 23:41:41] [INFO ] Flatten gal took : 19 ms
[2021-05-13 23:41:41] [INFO ] Applying decomposition
[2021-05-13 23:41:41] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4706465598284254090.txt, -o, /tmp/graph4706465598284254090.bin, -w, /tmp/graph4706465598284254090.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4706465598284254090.bin, -l, -1, -v, -w, /tmp/graph4706465598284254090.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:41:41] [INFO ] Decomposing Gal with order
[2021-05-13 23:41:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:41:41] [INFO ] Removed a total of 433 redundant transitions.
[2021-05-13 23:41:41] [INFO ] Flatten gal took : 43 ms
[2021-05-13 23:41:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 7 ms.
[2021-05-13 23:41:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11109429259952596462.gal : 4 ms
[2021-05-13 23:41:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12085957038361828481.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11109429259952596462.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12085957038361828481.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11109429259952596462.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12085957038361828481.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12085957038361828481.prop.
SDD proceeding with computation,77 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,77 properties remain. new max is 8
SDD size :1 after 24
SDD proceeding with computation,77 properties remain. new max is 16
SDD size :24 after 60
SDD proceeding with computation,77 properties remain. new max is 32
SDD size :60 after 270
SDD proceeding with computation,77 properties remain. new max is 64
SDD size :270 after 4232
SDD proceeding with computation,77 properties remain. new max is 128
SDD size :17819 after 18933
Invariant property smplace_444 does not hold.
Invariant property smplace_433 does not hold.
Invariant property smplace_430 does not hold.
Invariant property smplace_384 does not hold.
Invariant property smplace_307 does not hold.
Invariant property smplace_292 does not hold.
Invariant property smplace_288 does not hold.
Invariant property smplace_215 does not hold.
Invariant property smplace_213 does not hold.
Invariant property smplace_212 does not hold.
Invariant property smplace_199 does not hold.
Invariant property smplace_98 does not hold.
Invariant property smplace_88 does not hold.
Invariant property smplace_86 does not hold.
Invariant property smplace_75 does not hold.
Invariant property smplace_73 does not hold.
Invariant property smplace_72 does not hold.
Invariant property smplace_53 does not hold.
SDD proceeding with computation,59 properties remain. new max is 128
SDD size :358129 after 382897
Invariant property smplace_431 does not hold.
Invariant property smplace_394 does not hold.
Invariant property smplace_305 does not hold.
Invariant property smplace_210 does not hold.
Invariant property smplace_197 does not hold.
Invariant property smplace_100 does not hold.
Invariant property smplace_70 does not hold.
Invariant property smplace_55 does not hold.
SDD proceeding with computation,51 properties remain. new max is 128
SDD size :650199 after 766917
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9839752675751698509
[2021-05-13 23:41:56] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9839752675751698509
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9839752675751698509]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9839752675751698509] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9839752675751698509] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4245 ms. (steps per millisecond=235 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=1075 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=1075 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=1075 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=1041 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=1041 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=1041 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=1041 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=1075 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=1075 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 51) seen :0
Interrupted probabilistic random walk after 11053164 steps, run timeout after 30001 ms. (steps per millisecond=368 ) properties seen :{1=1, 2=1, 3=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 12=1, 13=1, 15=1, 16=1, 17=1, 19=1, 20=1, 21=1, 22=1, 24=1, 25=1, 26=1, 28=1, 29=1, 30=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 39=1, 40=1, 41=1, 44=1, 45=1, 47=1, 48=1, 49=1, 50=1}
Probabilistic random walk after 11053164 steps, saw 1842537 distinct states, run finished after 30001 ms. (steps per millisecond=368 ) properties seen :{1=1, 2=1, 3=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 12=1, 13=1, 15=1, 16=1, 17=1, 19=1, 20=1, 21=1, 22=1, 24=1, 25=1, 26=1, 28=1, 29=1, 30=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 39=1, 40=1, 41=1, 44=1, 45=1, 47=1, 48=1, 49=1, 50=1}
Running SMT prover for 12 properties.
[2021-05-13 23:42:36] [INFO ] Flow matrix only has 374 transitions (discarded 60 similar events)
// Phase 1: matrix 374 rows 224 cols
[2021-05-13 23:42:36] [INFO ] Computed 19 place invariants in 4 ms
[2021-05-13 23:42:36] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:42:36] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:36] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-13 23:42:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:42:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-13 23:42:36] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:36] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-13 23:42:36] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-13 23:42:36] [INFO ] [Nat]Added 132 Read/Feed constraints in 11 ms returned sat
[2021-05-13 23:42:36] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2021-05-13 23:42:36] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2021-05-13 23:42:36] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2021-05-13 23:42:37] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:42:37] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:42:37] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2021-05-13 23:42:37] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2021-05-13 23:42:37] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:42:37] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:42:37] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2021-05-13 23:42:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 741 ms
[2021-05-13 23:42:37] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 26 ms.
[2021-05-13 23:42:38] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:42:38] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2021-05-13 23:42:38] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2021-05-13 23:42:38] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2021-05-13 23:42:39] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2021-05-13 23:42:39] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2021-05-13 23:42:39] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2021-05-13 23:42:39] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2021-05-13 23:42:39] [INFO ] Deduced a trap composed of 57 places in 34 ms of which 0 ms to minimize.
[2021-05-13 23:42:39] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2021-05-13 23:42:39] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:42:39] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:42:40] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2021-05-13 23:42:40] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:42:40] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:42:40] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2021-05-13 23:42:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2021-05-13 23:42:40] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2021-05-13 23:42:42] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:42:42] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:42:42] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:42] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2021-05-13 23:42:42] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2021-05-13 23:42:42] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:42:42] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2021-05-13 23:42:42] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2021-05-13 23:42:42] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:43] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2021-05-13 23:42:43] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:42:43] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2021-05-13 23:42:43] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4538 ms
[2021-05-13 23:42:43] [INFO ] Added : 315 causal constraints over 64 iterations in 5895 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-13 23:42:43] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:42:43] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:43] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-13 23:42:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:42:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-13 23:42:43] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:43] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-13 23:42:43] [INFO ] [Nat]Added 132 Read/Feed constraints in 14 ms returned sat
[2021-05-13 23:42:43] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:42:43] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2021-05-13 23:42:43] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2021-05-13 23:42:43] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:42:43] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 0 ms to minimize.
[2021-05-13 23:42:44] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1194 ms
[2021-05-13 23:42:44] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 21 ms.
[2021-05-13 23:42:45] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:45] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2021-05-13 23:42:45] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 1 ms to minimize.
[2021-05-13 23:42:46] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1079 ms
[2021-05-13 23:42:46] [INFO ] Added : 273 causal constraints over 55 iterations in 2129 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-13 23:42:47] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:42:47] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-13 23:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:47] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-13 23:42:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:42:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-13 23:42:47] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:47] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-13 23:42:47] [INFO ] [Nat]Added 132 Read/Feed constraints in 12 ms returned sat
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 9 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2021-05-13 23:42:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 659 ms
[2021-05-13 23:42:47] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 21 ms.
[2021-05-13 23:42:48] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:42:48] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:48] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2021-05-13 23:42:48] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2021-05-13 23:42:48] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2021-05-13 23:42:49] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2021-05-13 23:42:49] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2021-05-13 23:42:49] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 0 ms to minimize.
[2021-05-13 23:42:49] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2021-05-13 23:42:49] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:42:49] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:42:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 792 ms
[2021-05-13 23:42:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2021-05-13 23:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2021-05-13 23:42:49] [INFO ] Added : 219 causal constraints over 45 iterations in 1742 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-13 23:42:49] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-13 23:42:49] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:49] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-13 23:42:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:42:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:42:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-13 23:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:49] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-13 23:42:49] [INFO ] [Nat]Added 132 Read/Feed constraints in 12 ms returned sat
[2021-05-13 23:42:49] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2021-05-13 23:42:50] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2021-05-13 23:42:50] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:50] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2021-05-13 23:42:50] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:50] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 0 ms to minimize.
[2021-05-13 23:42:50] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2021-05-13 23:42:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 426 ms
[2021-05-13 23:42:50] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 22 ms.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2021-05-13 23:42:51] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2021-05-13 23:42:52] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 0 ms to minimize.
[2021-05-13 23:42:52] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2021-05-13 23:42:52] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1067 ms
[2021-05-13 23:42:52] [INFO ] Added : 279 causal constraints over 57 iterations in 2226 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-13 23:42:52] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:42:52] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:52] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-13 23:42:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:42:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-13 23:42:52] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:52] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-13 23:42:52] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-13 23:42:52] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2021-05-13 23:42:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:53] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:53] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2021-05-13 23:42:53] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2021-05-13 23:42:53] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:42:53] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:53] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 513 ms
[2021-05-13 23:42:53] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 22 ms.
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2021-05-13 23:42:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 206 ms
[2021-05-13 23:42:54] [INFO ] Added : 163 causal constraints over 34 iterations in 830 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-13 23:42:54] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:42:54] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:54] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-13 23:42:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:42:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-13 23:42:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:54] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-13 23:42:54] [INFO ] [Nat]Added 132 Read/Feed constraints in 12 ms returned sat
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:54] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2021-05-13 23:42:55] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1375 ms
[2021-05-13 23:42:55] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 24 ms.
[2021-05-13 23:42:56] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:42:56] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:42:56] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2021-05-13 23:42:57] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 897 ms
[2021-05-13 23:42:57] [INFO ] Added : 260 causal constraints over 52 iterations in 1850 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-13 23:42:57] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:42:57] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:57] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-13 23:42:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:42:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:42:57] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-13 23:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:42:57] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-13 23:42:57] [INFO ] [Nat]Added 132 Read/Feed constraints in 13 ms returned sat
[2021-05-13 23:42:58] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
[2021-05-13 23:42:58] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2021-05-13 23:42:58] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2021-05-13 23:42:58] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2021-05-13 23:42:58] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2021-05-13 23:42:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2021-05-13 23:42:58] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2021-05-13 23:42:58] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:42:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 431 ms
[2021-05-13 23:42:58] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 23 ms.
[2021-05-13 23:42:59] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2021-05-13 23:42:59] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2021-05-13 23:42:59] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2021-05-13 23:42:59] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2021-05-13 23:42:59] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2021-05-13 23:42:59] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2021-05-13 23:42:59] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2021-05-13 23:42:59] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2021-05-13 23:42:59] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:43:00] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:43:00] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2021-05-13 23:43:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2021-05-13 23:43:00] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2021-05-13 23:43:00] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:43:00] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:43:00] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:43:00] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:43:00] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2021-05-13 23:43:00] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1354 ms
[2021-05-13 23:43:00] [INFO ] Added : 275 causal constraints over 55 iterations in 2418 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-13 23:43:00] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-13 23:43:00] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:43:00] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-13 23:43:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:43:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:43:01] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-13 23:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:43:01] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-13 23:43:01] [INFO ] [Nat]Added 132 Read/Feed constraints in 12 ms returned sat
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2021-05-13 23:43:01] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 749 ms
[2021-05-13 23:43:01] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 18 ms.
[2021-05-13 23:43:02] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2021-05-13 23:43:02] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 0 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2021-05-13 23:43:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 944 ms
[2021-05-13 23:43:03] [INFO ] Added : 260 causal constraints over 52 iterations in 1902 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-13 23:43:03] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:43:03] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:43:03] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-13 23:43:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:43:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:43:03] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-13 23:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:43:04] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-13 23:43:04] [INFO ] [Nat]Added 132 Read/Feed constraints in 12 ms returned sat
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2021-05-13 23:43:04] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
[2021-05-13 23:43:05] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2021-05-13 23:43:05] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2021-05-13 23:43:05] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2021-05-13 23:43:05] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1058 ms
[2021-05-13 23:43:05] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 19 ms.
[2021-05-13 23:43:06] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 3 ms to minimize.
[2021-05-13 23:43:06] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2021-05-13 23:43:06] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2021-05-13 23:43:06] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2021-05-13 23:43:06] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2021-05-13 23:43:06] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:43:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 418 ms
[2021-05-13 23:43:06] [INFO ] Added : 318 causal constraints over 64 iterations in 1689 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-13 23:43:06] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:43:06] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:43:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:43:06] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-13 23:43:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:43:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:43:06] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-13 23:43:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:43:07] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-13 23:43:07] [INFO ] [Nat]Added 132 Read/Feed constraints in 12 ms returned sat
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:43:07] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2021-05-13 23:43:08] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:43:08] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 998 ms
[2021-05-13 23:43:08] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 18 ms.
[2021-05-13 23:43:09] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:43:09] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2021-05-13 23:43:09] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2021-05-13 23:43:09] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:43:09] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2021-05-13 23:43:09] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2021-05-13 23:43:09] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2021-05-13 23:43:09] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2021-05-13 23:43:09] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2021-05-13 23:43:10] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2021-05-13 23:43:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 765 ms
[2021-05-13 23:43:10] [INFO ] Added : 319 causal constraints over 64 iterations in 2044 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-13 23:43:10] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-13 23:43:10] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:43:10] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-13 23:43:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:43:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-13 23:43:10] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:43:10] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-13 23:43:10] [INFO ] [Nat]Added 132 Read/Feed constraints in 12 ms returned sat
[2021-05-13 23:43:10] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2021-05-13 23:43:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2021-05-13 23:43:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2021-05-13 23:43:10] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2021-05-13 23:43:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 194 ms
[2021-05-13 23:43:10] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 17 ms.
[2021-05-13 23:43:11] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2021-05-13 23:43:11] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:43:11] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2021-05-13 23:43:11] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:43:11] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2021-05-13 23:43:11] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:43:11] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2021-05-13 23:43:11] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2021-05-13 23:43:11] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2021-05-13 23:43:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 545 ms
[2021-05-13 23:43:11] [INFO ] Added : 208 causal constraints over 42 iterations in 1306 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-13 23:43:11] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-13 23:43:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-13 23:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:43:11] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-13 23:43:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:43:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-13 23:43:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-13 23:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:43:12] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-13 23:43:12] [INFO ] [Nat]Added 132 Read/Feed constraints in 13 ms returned sat
[2021-05-13 23:43:12] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2021-05-13 23:43:12] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2021-05-13 23:43:12] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2021-05-13 23:43:12] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
[2021-05-13 23:43:12] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2021-05-13 23:43:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 255 ms
[2021-05-13 23:43:12] [INFO ] Computed and/alt/rep : 333/850/333 causal constraints (skipped 36 transitions) in 17 ms.
[2021-05-13 23:43:13] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2021-05-13 23:43:13] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:43:13] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2021-05-13 23:43:13] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2021-05-13 23:43:13] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2021-05-13 23:43:13] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:43:13] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:43:13] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:43:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 572 ms
[2021-05-13 23:43:13] [INFO ] Added : 265 causal constraints over 53 iterations in 1535 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Incomplete Parikh walk after 85700 steps, including 1000 resets, run finished after 336 ms. (steps per millisecond=255 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 73000 steps, including 1000 resets, run finished after 206 ms. (steps per millisecond=354 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 36300 steps, including 994 resets, run finished after 112 ms. (steps per millisecond=324 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 97600 steps, including 1000 resets, run finished after 262 ms. (steps per millisecond=372 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26500 steps, including 985 resets, run finished after 78 ms. (steps per millisecond=339 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 62900 steps, including 1000 resets, run finished after 180 ms. (steps per millisecond=349 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 75600 steps, including 1000 resets, run finished after 210 ms. (steps per millisecond=360 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 73700 steps, including 1000 resets, run finished after 205 ms. (steps per millisecond=359 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 94500 steps, including 1000 resets, run finished after 258 ms. (steps per millisecond=366 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 99900 steps, including 1000 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 42900 steps, including 990 resets, run finished after 124 ms. (steps per millisecond=345 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 72900 steps, including 1000 resets, run finished after 206 ms. (steps per millisecond=353 ) properties (out of 12) seen :0 could not realise parikh vector
Support contains 12 out of 224 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 224/224 places, 434/434 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 224 transition count 400
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 190 transition count 400
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 190 transition count 389
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 179 transition count 389
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 108 place count 170 transition count 380
Applied a total of 108 rules in 28 ms. Remains 170 /224 variables (removed 54) and now considering 380/434 (removed 54) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/224 places, 380/434 transitions.
[2021-05-13 23:43:16] [INFO ] Flatten gal took : 16 ms
[2021-05-13 23:43:16] [INFO ] Flatten gal took : 15 ms
[2021-05-13 23:43:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6224814307608237011.gal : 1 ms
[2021-05-13 23:43:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10649366659606759602.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6224814307608237011.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10649366659606759602.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6224814307608237011.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10649366659606759602.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10649366659606759602.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 14
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :14 after 25
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :32 after 107
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :107 after 265
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :265 after 538
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :538 after 2321
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :2321 after 4950
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :4950 after 12400
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :12400 after 97642
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :97642 after 180829
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :180829 after 414974
Detected timeout of ITS tools.
[2021-05-13 23:43:31] [INFO ] Flatten gal took : 13 ms
[2021-05-13 23:43:31] [INFO ] Applying decomposition
[2021-05-13 23:43:31] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17257473084653121173.txt, -o, /tmp/graph17257473084653121173.bin, -w, /tmp/graph17257473084653121173.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17257473084653121173.bin, -l, -1, -v, -w, /tmp/graph17257473084653121173.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:43:31] [INFO ] Decomposing Gal with order
[2021-05-13 23:43:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:43:31] [INFO ] Removed a total of 412 redundant transitions.
[2021-05-13 23:43:31] [INFO ] Flatten gal took : 26 ms
[2021-05-13 23:43:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 247 labels/synchronizations in 7 ms.
[2021-05-13 23:43:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality211881006077100447.gal : 3 ms
[2021-05-13 23:43:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15118348631804282243.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality211881006077100447.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15118348631804282243.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality211881006077100447.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15118348631804282243.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15118348631804282243.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 86
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :86 after 402
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :402 after 480
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :480 after 13627
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :672054 after 677912
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4289283366388635515
[2021-05-13 23:43:46] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4289283366388635515
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4289283366388635515]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4289283366388635515] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4289283366388635515] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2704 ms. (steps per millisecond=369 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 678 ms. (steps per millisecond=1474 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 677 ms. (steps per millisecond=1477 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=1479 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 680 ms. (steps per millisecond=1470 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 12) seen :0
Finished probabilistic random walk after 4451402 steps, run visited all 12 properties in 10040 ms. (steps per millisecond=443 )
Probabilistic random walk after 4451402 steps, saw 742339 distinct states, run finished after 10040 ms. (steps per millisecond=443 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Able to resolve query StableMarking after proving 480 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL USE_NUPN
BK_STOP 1620949449494
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination StableMarking -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 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="Peterson-PT-4"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 Peterson-PT-4, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r147-tall-162089138200388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;