Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r160-smll-167819446000293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is DoubleExponent-PT-004, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-167819446000293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 67K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678439754562

Running Version 202205111006
[2023-03-10 09:15:56] [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]
[2023-03-10 09:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:15:56] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-10 09:15:56] [INFO ] Transformed 216 places.
[2023-03-10 09:15:56] [INFO ] Transformed 198 transitions.
[2023-03-10 09:15:56] [INFO ] Parsed PT model containing 216 places and 198 transitions in 307 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 11 ms.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 205) seen :44
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 161) seen :0
Running SMT prover for 161 properties.
// Phase 1: matrix 198 rows 216 cols
[2023-03-10 09:15:58] [INFO ] Computed 24 place invariants in 27 ms
[2023-03-10 09:15:59] [INFO ] After 1668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:161
[2023-03-10 09:16:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 09:16:00] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2023-03-10 09:16:03] [INFO ] After 2171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :161
[2023-03-10 09:16:04] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 9 ms to minimize.
[2023-03-10 09:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-10 09:16:04] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 1 ms to minimize.
[2023-03-10 09:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-10 09:16:04] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2023-03-10 09:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-10 09:16:04] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 2 ms to minimize.
[2023-03-10 09:16:04] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2023-03-10 09:16:05] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 1 ms to minimize.
[2023-03-10 09:16:05] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 1 ms to minimize.
[2023-03-10 09:16:05] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2023-03-10 09:16:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 611 ms
[2023-03-10 09:16:05] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2023-03-10 09:16:05] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2023-03-10 09:16:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2023-03-10 09:16:05] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2023-03-10 09:16:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-10 09:16:05] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2023-03-10 09:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-10 09:16:06] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 1 ms to minimize.
[2023-03-10 09:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-10 09:16:06] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 0 ms to minimize.
[2023-03-10 09:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-10 09:16:06] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2023-03-10 09:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-10 09:16:07] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2023-03-10 09:16:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-10 09:16:07] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 0 ms to minimize.
[2023-03-10 09:16:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-10 09:16:08] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2023-03-10 09:16:08] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 1 ms to minimize.
[2023-03-10 09:16:08] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 1 ms to minimize.
[2023-03-10 09:16:08] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 0 ms to minimize.
[2023-03-10 09:16:08] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2023-03-10 09:16:08] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2023-03-10 09:16:08] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2023-03-10 09:16:08] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 0 ms to minimize.
[2023-03-10 09:16:09] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2023-03-10 09:16:09] [INFO ] Deduced a trap composed of 119 places in 85 ms of which 1 ms to minimize.
[2023-03-10 09:16:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1054 ms
[2023-03-10 09:16:09] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-03-10 09:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-10 09:16:09] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 1 ms to minimize.
[2023-03-10 09:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-10 09:16:10] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 0 ms to minimize.
[2023-03-10 09:16:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-10 09:16:10] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 1 ms to minimize.
[2023-03-10 09:16:10] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2023-03-10 09:16:10] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 1 ms to minimize.
[2023-03-10 09:16:11] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 0 ms to minimize.
[2023-03-10 09:16:11] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 0 ms to minimize.
[2023-03-10 09:16:11] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:16:11] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 1 ms to minimize.
[2023-03-10 09:16:11] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 2 ms to minimize.
[2023-03-10 09:16:11] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 0 ms to minimize.
[2023-03-10 09:16:11] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 1 ms to minimize.
[2023-03-10 09:16:11] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:16:11] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 2 ms to minimize.
[2023-03-10 09:16:11] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:16:12] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2023-03-10 09:16:12] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 1 ms to minimize.
[2023-03-10 09:16:12] [INFO ] Deduced a trap composed of 102 places in 82 ms of which 0 ms to minimize.
[2023-03-10 09:16:12] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
[2023-03-10 09:16:12] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 1 ms to minimize.
[2023-03-10 09:16:12] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2023-03-10 09:16:12] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 0 ms to minimize.
[2023-03-10 09:16:12] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 0 ms to minimize.
[2023-03-10 09:16:12] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:16:12] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 1 ms to minimize.
[2023-03-10 09:16:13] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2023-03-10 09:16:13] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2023-03-10 09:16:13] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 0 ms to minimize.
[2023-03-10 09:16:13] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 3 ms to minimize.
[2023-03-10 09:16:13] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 1 ms to minimize.
[2023-03-10 09:16:13] [INFO ] Deduced a trap composed of 110 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:13] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 0 ms to minimize.
[2023-03-10 09:16:13] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 0 ms to minimize.
[2023-03-10 09:16:13] [INFO ] Deduced a trap composed of 111 places in 82 ms of which 0 ms to minimize.
[2023-03-10 09:16:14] [INFO ] Deduced a trap composed of 106 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:14] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2023-03-10 09:16:14] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2023-03-10 09:16:14] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 1 ms to minimize.
[2023-03-10 09:16:14] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 1 ms to minimize.
[2023-03-10 09:16:14] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 1 ms to minimize.
[2023-03-10 09:16:14] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 1 ms to minimize.
[2023-03-10 09:16:14] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 0 ms to minimize.
[2023-03-10 09:16:14] [INFO ] Deduced a trap composed of 124 places in 83 ms of which 0 ms to minimize.
[2023-03-10 09:16:14] [INFO ] Deduced a trap composed of 106 places in 80 ms of which 1 ms to minimize.
[2023-03-10 09:16:15] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 0 ms to minimize.
[2023-03-10 09:16:15] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 1 ms to minimize.
[2023-03-10 09:16:15] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 1 ms to minimize.
[2023-03-10 09:16:15] [INFO ] Deduced a trap composed of 101 places in 79 ms of which 1 ms to minimize.
[2023-03-10 09:16:15] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 1 ms to minimize.
[2023-03-10 09:16:15] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 1 ms to minimize.
[2023-03-10 09:16:15] [INFO ] Deduced a trap composed of 101 places in 80 ms of which 0 ms to minimize.
[2023-03-10 09:16:15] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:16:15] [INFO ] Deduced a trap composed of 137 places in 86 ms of which 1 ms to minimize.
[2023-03-10 09:16:16] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:16:16] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:16] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:16] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
[2023-03-10 09:16:16] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:16:16] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2023-03-10 09:16:16] [INFO ] Deduced a trap composed of 108 places in 79 ms of which 0 ms to minimize.
[2023-03-10 09:16:16] [INFO ] Deduced a trap composed of 110 places in 83 ms of which 0 ms to minimize.
[2023-03-10 09:16:16] [INFO ] Deduced a trap composed of 109 places in 82 ms of which 0 ms to minimize.
[2023-03-10 09:16:17] [INFO ] Deduced a trap composed of 104 places in 83 ms of which 1 ms to minimize.
[2023-03-10 09:16:17] [INFO ] Deduced a trap composed of 102 places in 76 ms of which 1 ms to minimize.
[2023-03-10 09:16:17] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 0 ms to minimize.
[2023-03-10 09:16:17] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:16:17] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2023-03-10 09:16:17] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 1 ms to minimize.
[2023-03-10 09:16:17] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 0 ms to minimize.
[2023-03-10 09:16:17] [INFO ] Deduced a trap composed of 115 places in 82 ms of which 0 ms to minimize.
[2023-03-10 09:16:17] [INFO ] Deduced a trap composed of 107 places in 80 ms of which 1 ms to minimize.
[2023-03-10 09:16:17] [INFO ] Deduced a trap composed of 104 places in 77 ms of which 1 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 0 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 0 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 0 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 110 places in 83 ms of which 0 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 104 places in 78 ms of which 1 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 0 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 0 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 104 places in 79 ms of which 1 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 104 places in 82 ms of which 1 ms to minimize.
[2023-03-10 09:16:18] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:16:19] [INFO ] Deduced a trap composed of 107 places in 77 ms of which 0 ms to minimize.
[2023-03-10 09:16:19] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 0 ms to minimize.
[2023-03-10 09:16:19] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 0 ms to minimize.
[2023-03-10 09:16:19] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 0 ms to minimize.
[2023-03-10 09:16:19] [INFO ] Deduced a trap composed of 109 places in 82 ms of which 0 ms to minimize.
[2023-03-10 09:16:19] [INFO ] Deduced a trap composed of 113 places in 83 ms of which 1 ms to minimize.
[2023-03-10 09:16:19] [INFO ] Deduced a trap composed of 109 places in 107 ms of which 1 ms to minimize.
[2023-03-10 09:16:19] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 0 ms to minimize.
[2023-03-10 09:16:19] [INFO ] Deduced a trap composed of 131 places in 94 ms of which 1 ms to minimize.
[2023-03-10 09:16:20] [INFO ] Deduced a trap composed of 110 places in 115 ms of which 1 ms to minimize.
[2023-03-10 09:16:20] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:20] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 1 ms to minimize.
[2023-03-10 09:16:20] [INFO ] Deduced a trap composed of 130 places in 84 ms of which 1 ms to minimize.
[2023-03-10 09:16:20] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 0 ms to minimize.
[2023-03-10 09:16:20] [INFO ] Deduced a trap composed of 113 places in 84 ms of which 0 ms to minimize.
[2023-03-10 09:16:20] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 0 ms to minimize.
[2023-03-10 09:16:20] [INFO ] Deduced a trap composed of 124 places in 85 ms of which 1 ms to minimize.
[2023-03-10 09:16:20] [INFO ] Deduced a trap composed of 104 places in 80 ms of which 0 ms to minimize.
[2023-03-10 09:16:20] [INFO ] Deduced a trap composed of 116 places in 79 ms of which 0 ms to minimize.
[2023-03-10 09:16:21] [INFO ] Deduced a trap composed of 107 places in 89 ms of which 1 ms to minimize.
[2023-03-10 09:16:21] [INFO ] Deduced a trap composed of 108 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:21] [INFO ] Deduced a trap composed of 117 places in 76 ms of which 0 ms to minimize.
[2023-03-10 09:16:21] [INFO ] Deduced a trap composed of 109 places in 83 ms of which 0 ms to minimize.
[2023-03-10 09:16:21] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 1 ms to minimize.
[2023-03-10 09:16:21] [INFO ] Deduced a trap composed of 103 places in 77 ms of which 0 ms to minimize.
[2023-03-10 09:16:21] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 0 ms to minimize.
[2023-03-10 09:16:21] [INFO ] Deduced a trap composed of 113 places in 84 ms of which 1 ms to minimize.
[2023-03-10 09:16:21] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 0 ms to minimize.
[2023-03-10 09:16:22] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 1 ms to minimize.
[2023-03-10 09:16:22] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:22] [INFO ] Deduced a trap composed of 109 places in 99 ms of which 0 ms to minimize.
[2023-03-10 09:16:22] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 1 ms to minimize.
[2023-03-10 09:16:22] [INFO ] Deduced a trap composed of 118 places in 75 ms of which 0 ms to minimize.
[2023-03-10 09:16:22] [INFO ] Deduced a trap composed of 116 places in 75 ms of which 1 ms to minimize.
[2023-03-10 09:16:22] [INFO ] Deduced a trap composed of 121 places in 79 ms of which 0 ms to minimize.
[2023-03-10 09:16:23] [INFO ] Deduced a trap composed of 110 places in 77 ms of which 0 ms to minimize.
[2023-03-10 09:16:23] [INFO ] Deduced a trap composed of 120 places in 79 ms of which 0 ms to minimize.
[2023-03-10 09:16:23] [INFO ] Deduced a trap composed of 120 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:23] [INFO ] Deduced a trap composed of 116 places in 75 ms of which 0 ms to minimize.
[2023-03-10 09:16:23] [INFO ] Deduced a trap composed of 113 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:23] [INFO ] Deduced a trap composed of 122 places in 79 ms of which 1 ms to minimize.
[2023-03-10 09:16:23] [INFO ] Deduced a trap composed of 119 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:23] [INFO ] Deduced a trap composed of 113 places in 77 ms of which 0 ms to minimize.
[2023-03-10 09:16:23] [INFO ] Deduced a trap composed of 114 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:16:23] [INFO ] Deduced a trap composed of 126 places in 83 ms of which 0 ms to minimize.
[2023-03-10 09:16:24] [INFO ] Deduced a trap composed of 121 places in 78 ms of which 1 ms to minimize.
[2023-03-10 09:16:24] [INFO ] Deduced a trap composed of 110 places in 77 ms of which 1 ms to minimize.
[2023-03-10 09:16:24] [INFO ] Deduced a trap composed of 124 places in 85 ms of which 0 ms to minimize.
[2023-03-10 09:16:24] [INFO ] Deduced a trap composed of 126 places in 77 ms of which 1 ms to minimize.
[2023-03-10 09:16:24] [INFO ] Deduced a trap composed of 132 places in 77 ms of which 0 ms to minimize.
[2023-03-10 09:16:24] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 1 ms to minimize.
[2023-03-10 09:16:24] [INFO ] Deduced a trap composed of 116 places in 77 ms of which 1 ms to minimize.
[2023-03-10 09:16:24] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 1 ms to minimize.
[2023-03-10 09:16:24] [INFO ] Deduced a trap composed of 115 places in 81 ms of which 1 ms to minimize.
[2023-03-10 09:16:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 09:16:24] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:161
Fused 161 Parikh solutions to 152 different solutions.
Parikh walk visited 0 properties in 7136 ms.
Support contains 161 out of 216 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 216/216 places, 198/198 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 189
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 207 transition count 189
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 207 transition count 187
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 205 transition count 187
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 50 place count 191 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 189 transition count 173
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 189 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 188 transition count 172
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 188 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 187 transition count 171
Applied a total of 60 rules in 86 ms. Remains 187 /216 variables (removed 29) and now considering 171/198 (removed 27) transitions.
Finished structural reductions, in 1 iterations. Remains : 187/216 places, 171/198 transitions.
Interrupted random walk after 649100 steps, including 82842 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 38
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 813 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Running SMT prover for 123 properties.
// Phase 1: matrix 171 rows 187 cols
[2023-03-10 09:17:17] [INFO ] Computed 24 place invariants in 13 ms
[2023-03-10 09:17:18] [INFO ] After 782ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:123
[2023-03-10 09:17:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 09:17:19] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 9 ms returned sat
[2023-03-10 09:17:21] [INFO ] After 1371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :123
[2023-03-10 09:17:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 09:17:22] [INFO ] After 1233ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :123
[2023-03-10 09:17:22] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-10 09:17:22] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 0 ms to minimize.
[2023-03-10 09:17:22] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2023-03-10 09:17:22] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2023-03-10 09:17:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 325 ms
[2023-03-10 09:17:23] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2023-03-10 09:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-10 09:17:23] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2023-03-10 09:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-10 09:17:23] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2023-03-10 09:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-10 09:17:23] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2023-03-10 09:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-10 09:17:24] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 1 ms to minimize.
[2023-03-10 09:17:24] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:17:24] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 0 ms to minimize.
[2023-03-10 09:17:24] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 1 ms to minimize.
[2023-03-10 09:17:24] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 0 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 0 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 0 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 0 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 0 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 0 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 0 ms to minimize.
[2023-03-10 09:17:25] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2023-03-10 09:17:26] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 0 ms to minimize.
[2023-03-10 09:17:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1635 ms
[2023-03-10 09:17:26] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2023-03-10 09:17:26] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2023-03-10 09:17:26] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2023-03-10 09:17:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 216 ms
[2023-03-10 09:17:26] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2023-03-10 09:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-10 09:17:27] [INFO ] After 6281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :123
Attempting to minimize the solution found.
Minimization took 1309 ms.
[2023-03-10 09:17:28] [INFO ] After 10156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :123
Fused 123 Parikh solutions to 115 different solutions.
Parikh walk visited 0 properties in 3456 ms.
Support contains 123 out of 187 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 187/187 places, 171/171 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 187 transition count 163
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 179 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 179 transition count 162
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 178 transition count 162
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 170 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 169 transition count 154
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 169 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 168 transition count 153
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 168 transition count 153
Applied a total of 42 rules in 34 ms. Remains 168 /187 variables (removed 19) and now considering 153/171 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/187 places, 153/171 transitions.
Interrupted random walk after 626640 steps, including 80566 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 877 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Interrupted probabilistic random walk after 5893243 steps, run timeout after 135001 ms. (steps per millisecond=43 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1, 43=1, 44=1, 45=1, 46=1, 47=1, 48=1, 49=1, 50=1, 51=1, 52=1, 53=1, 54=1, 55=1, 56=1, 57=1, 58=1, 59=1, 60=1, 61=1, 62=1, 63=1, 64=1, 65=1, 69=1, 70=1, 71=1, 72=1, 73=1, 74=1, 75=1, 76=1, 77=1, 78=1, 79=1, 93=1, 94=1, 95=1, 96=1, 97=1, 98=1, 99=1, 100=1, 101=1, 102=1, 104=1, 105=1, 106=1, 107=1, 108=1, 109=1, 110=1, 111=1, 112=1, 113=1, 114=1, 115=1, 116=1, 117=1, 118=1, 119=1, 120=1, 121=1, 122=1}
Probabilistic random walk after 5893243 steps, saw 2946363 distinct states, run finished after 135004 ms. (steps per millisecond=43 ) properties seen :106
Running SMT prover for 17 properties.
// Phase 1: matrix 153 rows 168 cols
[2023-03-10 09:20:32] [INFO ] Computed 24 place invariants in 6 ms
[2023-03-10 09:20:33] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-10 09:20:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 09:20:33] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-10 09:20:33] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-10 09:20:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 09:20:33] [INFO ] After 189ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-10 09:20:33] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2023-03-10 09:20:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-10 09:20:34] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2023-03-10 09:20:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-10 09:20:34] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-10 09:20:34] [INFO ] After 1196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 2396 ms.
Support contains 17 out of 168 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 168/168 places, 153/153 transitions.
Graph (complete) has 354 edges and 168 vertex of which 165 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 165 transition count 126
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 138 transition count 126
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 55 place count 138 transition count 122
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 134 transition count 122
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 95 place count 118 transition count 106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 115 transition count 106
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 109 place count 115 transition count 98
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 117 place count 107 transition count 98
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 126 place count 107 transition count 98
Applied a total of 126 rules in 44 ms. Remains 107 /168 variables (removed 61) and now considering 98/153 (removed 55) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/168 places, 98/153 transitions.
Interrupted random walk after 868356 steps, including 111431 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 0
Incomplete Best-First random walk after 100000 steps, including 8502 resets, run finished after 2388 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8517 resets, run finished after 2669 ms. (steps per millisecond=37 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8555 resets, run finished after 2450 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8550 resets, run finished after 2367 ms. (steps per millisecond=42 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8535 resets, run finished after 2444 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8407 resets, run finished after 2403 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8512 resets, run finished after 2417 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8489 resets, run finished after 2404 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8503 resets, run finished after 2367 ms. (steps per millisecond=42 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8473 resets, run finished after 2544 ms. (steps per millisecond=39 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8580 resets, run finished after 2335 ms. (steps per millisecond=42 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8402 resets, run finished after 2389 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8409 resets, run finished after 2433 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8438 resets, run finished after 2501 ms. (steps per millisecond=39 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8485 resets, run finished after 2312 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8456 resets, run finished after 2693 ms. (steps per millisecond=37 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8462 resets, run finished after 2385 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 10198353 steps, run timeout after 213001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 10198353 steps, saw 5097814 distinct states, run finished after 213003 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 98 rows 107 cols
[2023-03-10 09:25:21] [INFO ] Computed 22 place invariants in 8 ms
[2023-03-10 09:25:21] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-10 09:25:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 09:25:21] [INFO ] [Nat]Absence check using 2 positive and 20 generalized place invariants in 13 ms returned sat
[2023-03-10 09:25:21] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-10 09:25:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:25:21] [INFO ] After 138ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-10 09:25:21] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-10 09:25:22] [INFO ] After 734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1586 ms.
Support contains 17 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 98/98 transitions.
Applied a total of 0 rules in 14 ms. Remains 107 /107 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 98/98 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 98/98 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 107 cols
[2023-03-10 09:25:23] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-10 09:25:23] [INFO ] Implicit Places using invariants in 145 ms returned [20, 26, 41, 75, 80, 98, 104]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 149 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 100/107 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 97
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 99 transition count 94
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 96 transition count 94
Applied a total of 8 rules in 13 ms. Remains 96 /100 variables (removed 4) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:25:23] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-10 09:25:23] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:25:23] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-10 09:25:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:25:24] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 96/107 places, 94/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 96/107 places, 94/98 transitions.
Interrupted random walk after 876620 steps, including 126352 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 100000 steps, including 9178 resets, run finished after 2348 ms. (steps per millisecond=42 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9087 resets, run finished after 2188 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9118 resets, run finished after 2238 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9098 resets, run finished after 2250 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9131 resets, run finished after 2210 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9096 resets, run finished after 2246 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9198 resets, run finished after 2234 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9097 resets, run finished after 2245 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9225 resets, run finished after 2313 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9133 resets, run finished after 2182 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9148 resets, run finished after 2229 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9301 resets, run finished after 2277 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9172 resets, run finished after 2291 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9181 resets, run finished after 2214 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9002 resets, run finished after 2277 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9186 resets, run finished after 2286 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9073 resets, run finished after 2285 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 9958786 steps, run timeout after 204001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 9958786 steps, saw 4977808 distinct states, run finished after 204001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:29:56] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:29:56] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-10 09:29:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:29:56] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 09:29:56] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-10 09:29:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:29:56] [INFO ] After 116ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-10 09:29:57] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-10 09:29:57] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1376 ms.
Support contains 17 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 17 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 94/94 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:29:58] [INFO ] Computed 15 place invariants in 7 ms
[2023-03-10 09:29:58] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:29:58] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:29:58] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:29:59] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-10 09:29:59] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:29:59] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:29:59] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 94/94 transitions.
Incomplete random walk after 100000 steps, including 14523 resets, run finished after 3936 ms. (steps per millisecond=25 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:30:03] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:30:03] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-10 09:30:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:30:03] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 09:30:03] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-10 09:30:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:30:03] [INFO ] After 110ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-10 09:30:03] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-10 09:30:03] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Interrupted random walk after 845225 steps, including 121943 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 0
Incomplete Best-First random walk after 100000 steps, including 9169 resets, run finished after 2240 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9145 resets, run finished after 2155 ms. (steps per millisecond=46 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9085 resets, run finished after 2147 ms. (steps per millisecond=46 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9154 resets, run finished after 2163 ms. (steps per millisecond=46 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9203 resets, run finished after 2234 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9119 resets, run finished after 2252 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9144 resets, run finished after 2257 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9186 resets, run finished after 2257 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9156 resets, run finished after 2215 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9141 resets, run finished after 2216 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9196 resets, run finished after 2182 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9101 resets, run finished after 2242 ms. (steps per millisecond=44 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9132 resets, run finished after 2305 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9157 resets, run finished after 2367 ms. (steps per millisecond=42 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9163 resets, run finished after 2178 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9283 resets, run finished after 2218 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9125 resets, run finished after 2333 ms. (steps per millisecond=42 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 9728633 steps, run timeout after 201001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 9728633 steps, saw 4862785 distinct states, run finished after 201001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:34:32] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:34:32] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-10 09:34:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:34:33] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 09:34:33] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-10 09:34:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:34:33] [INFO ] After 107ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-10 09:34:33] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-10 09:34:33] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1518 ms.
Support contains 17 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 94/94 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:34:35] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:34:35] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:34:35] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 09:34:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:34:35] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2023-03-10 09:34:35] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:34:35] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 09:34:35] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 94/94 transitions.
Incomplete random walk after 100000 steps, including 14387 resets, run finished after 3640 ms. (steps per millisecond=27 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:34:39] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 09:34:39] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-10 09:34:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:34:39] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 09:34:39] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-10 09:34:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:34:39] [INFO ] After 106ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-10 09:34:40] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-10 09:34:40] [INFO ] After 632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 934389 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 934389 steps, saw 467292 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:34:43] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 09:34:43] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:34:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:34:43] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 09:34:43] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:34:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:34:43] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:34:43] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:34:43] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 92 transition count 90
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 90 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 89 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 89 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 19 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1424 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 969404 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 969404 steps, saw 484797 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:34:46] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:34:46] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:34:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 09:34:46] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 09:34:46] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:34:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:34:46] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:34:46] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 09:34:46] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:34:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:34:46] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:34:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:34:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:34:46] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-10 09:34:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:34:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:34:47] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 83/83 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 17 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2023-03-10 09:34:47] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:34:47] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:34:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 09:34:47] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-10 09:34:47] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:34:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:34:47] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:34:47] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 09:34:47] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:34:47] [INFO ] Flatten gal took : 57 ms
[2023-03-10 09:34:47] [INFO ] Flatten gal took : 22 ms
[2023-03-10 09:34:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1764884939790680317.gal : 11 ms
[2023-03-10 09:34:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13548241773381795158.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1764884939790680317.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13548241773381795158.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality13548241773381795158.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 150
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :150 after 249
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :249 after 518
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :518 after 1240
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1240 after 2752
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2752 after 5776
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5776 after 11819
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :11819 after 23870
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :23870 after 48056
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :48056 after 96331
Detected timeout of ITS tools.
[2023-03-10 09:35:02] [INFO ] Flatten gal took : 16 ms
[2023-03-10 09:35:02] [INFO ] Applying decomposition
[2023-03-10 09:35:02] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5028604759214063663.txt' '-o' '/tmp/graph5028604759214063663.bin' '-w' '/tmp/graph5028604759214063663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5028604759214063663.bin' '-l' '-1' '-v' '-w' '/tmp/graph5028604759214063663.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:35:02] [INFO ] Decomposing Gal with order
[2023-03-10 09:35:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:35:02] [INFO ] Removed a total of 40 redundant transitions.
[2023-03-10 09:35:02] [INFO ] Flatten gal took : 85 ms
[2023-03-10 09:35:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2023-03-10 09:35:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10532423267759175417.gal : 6 ms
[2023-03-10 09:35:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8011319143714376434.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10532423267759175417.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8011319143714376434.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality8011319143714376434.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :398 after 429
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :429 after 477
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11875 after 12230
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16397043563010574169
[2023-03-10 09:35:17] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16397043563010574169
Running compilation step : cd /tmp/ltsmin16397043563010574169;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 775 ms.
Running link step : cd /tmp/ltsmin16397043563010574169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin16397043563010574169;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 941267 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 941267 steps, saw 470731 distinct states, run finished after 3005 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:35:36] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 09:35:36] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:35:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 09:35:36] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-10 09:35:36] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:35:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:35:36] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:35:36] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 09:35:36] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 95 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 92 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 92 transition count 90
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 91 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 88 transition count 87
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 88 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 85 transition count 84
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 85 transition count 84
Applied a total of 22 rules in 22 ms. Remains 85 /96 variables (removed 11) and now considering 84/94 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/96 places, 84/94 transitions.
Incomplete random walk after 10000 steps, including 1467 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 918693 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 918693 steps, saw 459441 distinct states, run finished after 3004 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 85 cols
[2023-03-10 09:35:39] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 09:35:39] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:35:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:35:39] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 10 ms returned sat
[2023-03-10 09:35:39] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:35:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:35:39] [INFO ] After 29ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:35:39] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:35:39] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 84/84 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 85 cols
[2023-03-10 09:35:39] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-10 09:35:39] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 84 rows 85 cols
[2023-03-10 09:35:39] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 09:35:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:35:39] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 317 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 84/85 places, 84/84 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 84
Applied a total of 1 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 84 cols
[2023-03-10 09:35:39] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:35:39] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 84 rows 84 cols
[2023-03-10 09:35:39] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:35:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:35:40] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 84/85 places, 84/84 transitions.
Finished structural reductions, in 2 iterations. Remains : 84/85 places, 84/84 transitions.
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 973300 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 973300 steps, saw 486752 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 84 cols
[2023-03-10 09:35:43] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:35:43] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:35:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:35:43] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-10 09:35:43] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:35:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:35:43] [INFO ] After 20ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:35:43] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:35:43] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 84 cols
[2023-03-10 09:35:43] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:35:43] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 84 rows 84 cols
[2023-03-10 09:35:43] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:35:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:35:43] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-10 09:35:43] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 84 rows 84 cols
[2023-03-10 09:35:43] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:35:43] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 84/84 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 84 transition count 77
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 74 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 74 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 72 transition count 72
Applied a total of 24 rules in 10 ms. Remains 72 /84 variables (removed 12) and now considering 72/84 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 72 cols
[2023-03-10 09:35:43] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:35:43] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:35:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:35:43] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-10 09:35:44] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:35:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:35:44] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:35:44] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 09:35:44] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:35:44] [INFO ] Flatten gal took : 11 ms
[2023-03-10 09:35:44] [INFO ] Flatten gal took : 10 ms
[2023-03-10 09:35:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8328527147136223448.gal : 2 ms
[2023-03-10 09:35:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality800106107579844677.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8328527147136223448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality800106107579844677.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality800106107579844677.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 87
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :87 after 162
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :162 after 306
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :306 after 632
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :632 after 1411
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1411 after 3167
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3167 after 6566
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6566 after 13454
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :13454 after 27230
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27230 after 54782
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :54782 after 109861
Detected timeout of ITS tools.
[2023-03-10 09:35:59] [INFO ] Flatten gal took : 10 ms
[2023-03-10 09:35:59] [INFO ] Applying decomposition
[2023-03-10 09:35:59] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17911136824638790515.txt' '-o' '/tmp/graph17911136824638790515.bin' '-w' '/tmp/graph17911136824638790515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17911136824638790515.bin' '-l' '-1' '-v' '-w' '/tmp/graph17911136824638790515.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:35:59] [INFO ] Decomposing Gal with order
[2023-03-10 09:35:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:35:59] [INFO ] Removed a total of 49 redundant transitions.
[2023-03-10 09:35:59] [INFO ] Flatten gal took : 19 ms
[2023-03-10 09:35:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2023-03-10 09:35:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9934183744422908009.gal : 4 ms
[2023-03-10 09:35:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11043428831047628482.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9934183744422908009.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11043428831047628482.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality11043428831047628482.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :182 after 313
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :891 after 1935
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :32623 after 47711
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13602083056340202087
[2023-03-10 09:36:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13602083056340202087
Running compilation step : cd /tmp/ltsmin13602083056340202087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 237 ms.
Running link step : cd /tmp/ltsmin13602083056340202087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13602083056340202087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 872509 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 872509 steps, saw 436342 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:36:32] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:36:32] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:36:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:36:32] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-10 09:36:32] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:36:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:36:32] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:36:32] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:36:32] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 96 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 92 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 92 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 91 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 88 transition count 86
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 88 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 85 transition count 83
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 85 transition count 83
Applied a total of 23 rules in 17 ms. Remains 85 /96 variables (removed 11) and now considering 83/94 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 949 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 895446 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 895446 steps, saw 447819 distinct states, run finished after 3003 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 85 cols
[2023-03-10 09:36:35] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:36:35] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:36:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:36:35] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-10 09:36:35] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:36:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:36:35] [INFO ] After 24ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:36:35] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-10 09:36:35] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 83/83 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 83/83 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 83/83 (removed 0) transitions.
// Phase 1: matrix 83 rows 85 cols
[2023-03-10 09:36:35] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 09:36:35] [INFO ] Implicit Places using invariants in 139 ms returned [37, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 140 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 83/85 places, 83/83 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 81 transition count 81
Applied a total of 5 rules in 9 ms. Remains 81 /83 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:36:36] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 09:36:36] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:36:36] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 09:36:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:36:36] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 81/85 places, 81/83 transitions.
Finished structural reductions, in 2 iterations. Remains : 81/85 places, 81/83 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 737076 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 737076 steps, saw 368617 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:36:39] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:36:39] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:36:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 09:36:39] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 09:36:39] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:36:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:36:39] [INFO ] After 19ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:36:39] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 09:36:39] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:36:39] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:36:39] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:36:39] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:36:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:36:40] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-10 09:36:40] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:36:40] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:36:40] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 16 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-10 09:36:40] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:36:40] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:36:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 09:36:40] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-10 09:36:40] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:36:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:36:40] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:36:40] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-10 09:36:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-10 09:36:40] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:36:40] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:36:40] [INFO ] Flatten gal took : 14 ms
[2023-03-10 09:36:40] [INFO ] Flatten gal took : 14 ms
[2023-03-10 09:36:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7824249543691716425.gal : 3 ms
[2023-03-10 09:36:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9232584917006087073.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7824249543691716425.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9232584917006087073.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality9232584917006087073.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 51
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :51 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 159
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :159 after 296
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :296 after 642
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :642 after 1526
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1526 after 3374
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3374 after 7070
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7070 after 14429
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :14429 after 29078
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :29078 after 58379
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :58379 after 116942
Detected timeout of ITS tools.
[2023-03-10 09:36:55] [INFO ] Flatten gal took : 10 ms
[2023-03-10 09:36:55] [INFO ] Applying decomposition
[2023-03-10 09:36:55] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8687158318905629468.txt' '-o' '/tmp/graph8687158318905629468.bin' '-w' '/tmp/graph8687158318905629468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8687158318905629468.bin' '-l' '-1' '-v' '-w' '/tmp/graph8687158318905629468.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:36:55] [INFO ] Decomposing Gal with order
[2023-03-10 09:36:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:36:55] [INFO ] Removed a total of 43 redundant transitions.
[2023-03-10 09:36:55] [INFO ] Flatten gal took : 16 ms
[2023-03-10 09:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2023-03-10 09:36:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9954141346406485050.gal : 3 ms
[2023-03-10 09:36:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3498182245356354590.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9954141346406485050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3498182245356354590.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality3498182245356354590.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :359 after 372
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :372 after 390
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :931 after 986
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10434 after 10447
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27112 after 27857
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :109615 after 109628
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2270073076097950828
[2023-03-10 09:37:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2270073076097950828
Running compilation step : cd /tmp/ltsmin2270073076097950828;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin2270073076097950828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2270073076097950828;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 946712 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 946712 steps, saw 473451 distinct states, run finished after 3002 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:37:28] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:37:28] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:37:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:37:28] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-10 09:37:28] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:37:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:37:28] [INFO ] After 20ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:37:29] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 09:37:29] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 92 transition count 89
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 89 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 28 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 995252 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 995252 steps, saw 497733 distinct states, run finished after 3005 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:37:32] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 09:37:32] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:37:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:37:32] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 09:37:32] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:37:32] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:37:32] [INFO ] After 19ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:37:32] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:37:32] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 6 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:37:32] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 09:37:32] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:37:32] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:37:32] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:37:32] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-10 09:37:32] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:37:32] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 09:37:32] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 83/83 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 11 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2023-03-10 09:37:32] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:37:32] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:37:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 09:37:33] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-10 09:37:33] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:37:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:37:33] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:37:33] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 09:37:33] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:37:33] [INFO ] Flatten gal took : 12 ms
[2023-03-10 09:37:33] [INFO ] Flatten gal took : 11 ms
[2023-03-10 09:37:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11990166370581927236.gal : 2 ms
[2023-03-10 09:37:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14300432395728914089.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11990166370581927236.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14300432395728914089.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14300432395728914089.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 51
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :51 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 159
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :159 after 296
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :296 after 642
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :642 after 1526
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1526 after 3424
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3424 after 7205
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7205 after 14688
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :14688 after 29647
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :29647 after 59621
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :59621 after 119462
Detected timeout of ITS tools.
[2023-03-10 09:37:48] [INFO ] Flatten gal took : 12 ms
[2023-03-10 09:37:48] [INFO ] Applying decomposition
[2023-03-10 09:37:48] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14766426291021502907.txt' '-o' '/tmp/graph14766426291021502907.bin' '-w' '/tmp/graph14766426291021502907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14766426291021502907.bin' '-l' '-1' '-v' '-w' '/tmp/graph14766426291021502907.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:37:48] [INFO ] Decomposing Gal with order
[2023-03-10 09:37:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:37:48] [INFO ] Removed a total of 66 redundant transitions.
[2023-03-10 09:37:48] [INFO ] Flatten gal took : 15 ms
[2023-03-10 09:37:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2023-03-10 09:37:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1083373973037894915.gal : 2 ms
[2023-03-10 09:37:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18132895418951435873.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1083373973037894915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18132895418951435873.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality18132895418951435873.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :5115 after 9035
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6233525208488526882
[2023-03-10 09:38:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6233525208488526882
Running compilation step : cd /tmp/ltsmin6233525208488526882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 230 ms.
Running link step : cd /tmp/ltsmin6233525208488526882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6233525208488526882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 967836 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 967836 steps, saw 484013 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:38:21] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-10 09:38:21] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:38:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-10 09:38:21] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-10 09:38:21] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:38:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:38:21] [INFO ] After 24ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:38:21] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 09:38:21] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 92 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 89 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 89 transition count 87
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 24 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 921428 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 921428 steps, saw 460811 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:38:24] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 09:38:24] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:38:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:38:24] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 09:38:24] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:38:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:38:24] [INFO ] After 25ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:38:24] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:38:24] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:38:24] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:38:25] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:38:25] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 09:38:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:38:25] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-10 09:38:25] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:38:25] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:38:25] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 83/83 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 19 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2023-03-10 09:38:25] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:38:25] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:38:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 09:38:25] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-10 09:38:25] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:38:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:38:25] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:38:25] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-10 09:38:25] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:38:25] [INFO ] Flatten gal took : 11 ms
[2023-03-10 09:38:25] [INFO ] Flatten gal took : 11 ms
[2023-03-10 09:38:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16612327500812016374.gal : 2 ms
[2023-03-10 09:38:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8065502199731988195.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16612327500812016374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8065502199731988195.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8065502199731988195.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 51
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :51 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 159
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :159 after 296
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :296 after 642
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :642 after 1526
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1526 after 3424
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3424 after 7205
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7205 after 14688
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :14688 after 29647
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :29647 after 59621
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :59621 after 119462
Detected timeout of ITS tools.
[2023-03-10 09:38:40] [INFO ] Flatten gal took : 11 ms
[2023-03-10 09:38:40] [INFO ] Applying decomposition
[2023-03-10 09:38:40] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17620126897592513082.txt' '-o' '/tmp/graph17620126897592513082.bin' '-w' '/tmp/graph17620126897592513082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17620126897592513082.bin' '-l' '-1' '-v' '-w' '/tmp/graph17620126897592513082.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:38:40] [INFO ] Decomposing Gal with order
[2023-03-10 09:38:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:38:40] [INFO ] Removed a total of 69 redundant transitions.
[2023-03-10 09:38:40] [INFO ] Flatten gal took : 27 ms
[2023-03-10 09:38:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2023-03-10 09:38:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality840850384482052279.gal : 3 ms
[2023-03-10 09:38:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12961677135301532677.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality840850384482052279.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12961677135301532677.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality12961677135301532677.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :387 after 499
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1379 after 1784
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15130 after 19385
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8426583983666536018
[2023-03-10 09:38:55] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8426583983666536018
Running compilation step : cd /tmp/ltsmin8426583983666536018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin8426583983666536018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8426583983666536018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 985431 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 985431 steps, saw 492820 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:39:14] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:39:14] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:39:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:39:14] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 09:39:14] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:39:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:39:14] [INFO ] After 17ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:39:14] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 09:39:14] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 86 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 12 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 991004 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 991004 steps, saw 495608 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:39:17] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:39:17] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:39:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 09:39:17] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 09:39:17] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:39:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:39:17] [INFO ] After 13ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:39:17] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 09:39:17] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:39:17] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:39:17] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:39:17] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:39:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:39:17] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-10 09:39:17] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 83 rows 83 cols
[2023-03-10 09:39:17] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:39:17] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 83/83 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 20 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2023-03-10 09:39:17] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:39:17] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:39:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 09:39:18] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-10 09:39:18] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:39:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:39:18] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:39:18] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:39:18] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:39:18] [INFO ] Flatten gal took : 8 ms
[2023-03-10 09:39:18] [INFO ] Flatten gal took : 7 ms
[2023-03-10 09:39:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1890387750127983829.gal : 1 ms
[2023-03-10 09:39:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10427761031577851071.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1890387750127983829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10427761031577851071.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10427761031577851071.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 51
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :51 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 159
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :159 after 296
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :296 after 642
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :642 after 1526
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1526 after 3424
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3424 after 7205
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7205 after 14688
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :14688 after 29647
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :29647 after 59621
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :59621 after 119462
Detected timeout of ITS tools.
[2023-03-10 09:39:33] [INFO ] Flatten gal took : 5 ms
[2023-03-10 09:39:33] [INFO ] Applying decomposition
[2023-03-10 09:39:33] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17967403746738770996.txt' '-o' '/tmp/graph17967403746738770996.bin' '-w' '/tmp/graph17967403746738770996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17967403746738770996.bin' '-l' '-1' '-v' '-w' '/tmp/graph17967403746738770996.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:39:33] [INFO ] Decomposing Gal with order
[2023-03-10 09:39:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:39:33] [INFO ] Removed a total of 40 redundant transitions.
[2023-03-10 09:39:33] [INFO ] Flatten gal took : 16 ms
[2023-03-10 09:39:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2023-03-10 09:39:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2635871187185902634.gal : 3 ms
[2023-03-10 09:39:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5896582264951152810.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2635871187185902634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5896582264951152810.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality5896582264951152810.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :60735 after 80793
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1176098714206143059
[2023-03-10 09:39:48] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1176098714206143059
Running compilation step : cd /tmp/ltsmin1176098714206143059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin1176098714206143059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1176098714206143059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1472 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 962448 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 962448 steps, saw 481325 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:40:06] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:40:06] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:40:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 09:40:06] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 09:40:06] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:40:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:40:06] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:40:06] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:40:06] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 88 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 83 transition count 83
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 83 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 9 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 930120 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 930120 steps, saw 465155 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:40:09] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:40:09] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:40:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:40:09] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 09:40:09] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:40:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:40:09] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:40:09] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 09:40:09] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:40:09] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:40:09] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:40:09] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:40:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:40:10] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-10 09:40:10] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:40:10] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:40:10] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 5 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-10 09:40:10] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:40:10] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:40:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 09:40:10] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 09:40:10] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:40:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:40:10] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:40:10] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 09:40:10] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:40:10] [INFO ] Flatten gal took : 7 ms
[2023-03-10 09:40:10] [INFO ] Flatten gal took : 8 ms
[2023-03-10 09:40:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1609156322805189648.gal : 1 ms
[2023-03-10 09:40:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1654920512366784509.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1609156322805189648.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1654920512366784509.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1654920512366784509.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 150
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :150 after 245
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :245 after 518
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :518 after 1238
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1238 after 2746
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2746 after 5726
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5726 after 11741
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :11741 after 23702
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :23702 after 47690
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :47690 after 95567
Detected timeout of ITS tools.
[2023-03-10 09:40:25] [INFO ] Flatten gal took : 10 ms
[2023-03-10 09:40:25] [INFO ] Applying decomposition
[2023-03-10 09:40:25] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16827197003555514647.txt' '-o' '/tmp/graph16827197003555514647.bin' '-w' '/tmp/graph16827197003555514647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16827197003555514647.bin' '-l' '-1' '-v' '-w' '/tmp/graph16827197003555514647.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:40:25] [INFO ] Decomposing Gal with order
[2023-03-10 09:40:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:40:25] [INFO ] Removed a total of 45 redundant transitions.
[2023-03-10 09:40:25] [INFO ] Flatten gal took : 18 ms
[2023-03-10 09:40:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2023-03-10 09:40:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality726754372048742893.gal : 3 ms
[2023-03-10 09:40:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15297274804997093064.prop : 5 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality726754372048742893.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15297274804997093064.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality15297274804997093064.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :478 after 481
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3170 after 3179
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :154915 after 154947
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3421380078740878398
[2023-03-10 09:40:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3421380078740878398
Running compilation step : cd /tmp/ltsmin3421380078740878398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 360 ms.
Running link step : cd /tmp/ltsmin3421380078740878398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin3421380078740878398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 944950 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 944950 steps, saw 472569 distinct states, run finished after 3010 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:40:58] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:40:58] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:40:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 09:40:58] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-10 09:40:58] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:40:58] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:40:58] [INFO ] After 13ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:40:58] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 09:40:58] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 86 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 15 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 983946 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 983946 steps, saw 492076 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:41:01] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:41:01] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:41:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 09:41:01] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 09:41:01] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 09:41:01] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-10 09:41:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-10 09:41:02] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 09:41:02] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:41:02] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:41:02] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:41:02] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:41:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 09:41:02] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-10 09:41:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:41:02] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 09:41:02] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 6 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-10 09:41:02] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:41:02] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:41:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 09:41:02] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-10 09:41:02] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:41:02] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:02] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 09:41:02] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:02] [INFO ] Flatten gal took : 6 ms
[2023-03-10 09:41:02] [INFO ] Flatten gal took : 4 ms
[2023-03-10 09:41:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3130438950735098213.gal : 1 ms
[2023-03-10 09:41:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6558173727172056544.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3130438950735098213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6558173727172056544.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6558173727172056544.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 87
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :87 after 162
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :162 after 306
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :306 after 632
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :632 after 1411
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1411 after 3167
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3167 after 6566
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6566 after 13454
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :13454 after 27230
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27230 after 54782
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :54782 after 109861
Detected timeout of ITS tools.
[2023-03-10 09:41:17] [INFO ] Flatten gal took : 5 ms
[2023-03-10 09:41:17] [INFO ] Applying decomposition
[2023-03-10 09:41:17] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2878977327487316242.txt' '-o' '/tmp/graph2878977327487316242.bin' '-w' '/tmp/graph2878977327487316242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2878977327487316242.bin' '-l' '-1' '-v' '-w' '/tmp/graph2878977327487316242.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:41:17] [INFO ] Decomposing Gal with order
[2023-03-10 09:41:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:41:17] [INFO ] Removed a total of 42 redundant transitions.
[2023-03-10 09:41:17] [INFO ] Flatten gal took : 17 ms
[2023-03-10 09:41:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2023-03-10 09:41:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6837463160639354684.gal : 3 ms
[2023-03-10 09:41:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2398519654572548759.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6837463160639354684.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2398519654572548759.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality2398519654572548759.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :399 after 402
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :948 after 984
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :78627 after 78966
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5146637498763066827
[2023-03-10 09:41:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5146637498763066827
Running compilation step : cd /tmp/ltsmin5146637498763066827;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 370 ms.
Running link step : cd /tmp/ltsmin5146637498763066827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5146637498763066827;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1465 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 947970 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 947970 steps, saw 474081 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:41:50] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 09:41:50] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:41:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:41:50] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-10 09:41:50] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:41:51] [INFO ] After 17ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:51] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:41:51] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 85 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 8 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1419 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 894 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1006776 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :{}
Probabilistic random walk after 1006776 steps, saw 503494 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:41:54] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:41:54] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:41:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 09:41:54] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 09:41:54] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:41:54] [INFO ] After 18ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:54] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2023-03-10 09:41:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-10 09:41:54] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:41:54] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:41:54] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:41:54] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:41:54] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:41:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 09:41:54] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-10 09:41:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:41:54] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:41:54] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 5 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-10 09:41:54] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:41:54] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:41:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 09:41:54] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-10 09:41:54] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:41:54] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:54] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-10 09:41:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-10 09:41:54] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 09:41:54] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:41:54] [INFO ] Flatten gal took : 6 ms
[2023-03-10 09:41:54] [INFO ] Flatten gal took : 4 ms
[2023-03-10 09:41:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality257688498049259657.gal : 1 ms
[2023-03-10 09:41:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16845382921407972305.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality257688498049259657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16845382921407972305.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality16845382921407972305.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 152
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :152 after 256
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :256 after 568
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :568 after 1402
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1402 after 3173
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3173 after 6734
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6734 after 13848
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :13848 after 28045
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :28045 after 56429
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :56429 after 113213
Detected timeout of ITS tools.
[2023-03-10 09:42:09] [INFO ] Flatten gal took : 4 ms
[2023-03-10 09:42:09] [INFO ] Applying decomposition
[2023-03-10 09:42:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13414459637613391018.txt' '-o' '/tmp/graph13414459637613391018.bin' '-w' '/tmp/graph13414459637613391018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13414459637613391018.bin' '-l' '-1' '-v' '-w' '/tmp/graph13414459637613391018.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:42:09] [INFO ] Decomposing Gal with order
[2023-03-10 09:42:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:42:09] [INFO ] Removed a total of 64 redundant transitions.
[2023-03-10 09:42:09] [INFO ] Flatten gal took : 10 ms
[2023-03-10 09:42:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2023-03-10 09:42:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9983301904541007031.gal : 2 ms
[2023-03-10 09:42:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7373650587905845808.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9983301904541007031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7373650587905845808.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality7373650587905845808.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2909107341705454832
[2023-03-10 09:42:24] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2909107341705454832
Running compilation step : cd /tmp/ltsmin2909107341705454832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 253 ms.
Running link step : cd /tmp/ltsmin2909107341705454832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2909107341705454832;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 940789 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 940789 steps, saw 470489 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:42:43] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 09:42:43] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:42:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:42:43] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-10 09:42:43] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:42:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:42:43] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:42:43] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:42:43] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 88 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 11 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1434 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 969216 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 969216 steps, saw 484701 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:42:46] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:42:46] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:42:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 09:42:46] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 09:42:46] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:42:46] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 09:42:46] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:42:46] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2023-03-10 09:42:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-10 09:42:46] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 09:42:46] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:42:46] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:42:46] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:42:46] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:42:46] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 09:42:46] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-10 09:42:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:42:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:42:46] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 8 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-10 09:42:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:42:46] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:42:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 09:42:47] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-10 09:42:47] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:42:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:42:47] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:42:47] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 09:42:47] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:42:47] [INFO ] Flatten gal took : 5 ms
[2023-03-10 09:42:47] [INFO ] Flatten gal took : 5 ms
[2023-03-10 09:42:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4241576348114648022.gal : 1 ms
[2023-03-10 09:42:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9002882535490430932.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4241576348114648022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9002882535490430932.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality9002882535490430932.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 150
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :150 after 245
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :245 after 518
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :518 after 1238
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1238 after 2746
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2746 after 5726
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5726 after 11741
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :11741 after 23702
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :23702 after 47690
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :47690 after 95567
Detected timeout of ITS tools.
[2023-03-10 09:43:02] [INFO ] Flatten gal took : 13 ms
[2023-03-10 09:43:02] [INFO ] Applying decomposition
[2023-03-10 09:43:02] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8593422954721159949.txt' '-o' '/tmp/graph8593422954721159949.bin' '-w' '/tmp/graph8593422954721159949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8593422954721159949.bin' '-l' '-1' '-v' '-w' '/tmp/graph8593422954721159949.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:43:02] [INFO ] Decomposing Gal with order
[2023-03-10 09:43:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:43:02] [INFO ] Removed a total of 40 redundant transitions.
[2023-03-10 09:43:02] [INFO ] Flatten gal took : 15 ms
[2023-03-10 09:43:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2023-03-10 09:43:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15894172567727442119.gal : 3 ms
[2023-03-10 09:43:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12456305109938145721.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15894172567727442119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12456305109938145721.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality12456305109938145721.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8811083123456437830
[2023-03-10 09:43:17] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8811083123456437830
Running compilation step : cd /tmp/ltsmin8811083123456437830;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 223 ms.
Running link step : cd /tmp/ltsmin8811083123456437830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8811083123456437830;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 868606 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 868606 steps, saw 434389 distinct states, run finished after 3002 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:43:35] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 09:43:35] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:43:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:43:35] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 09:43:35] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:43:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:43:35] [INFO ] After 12ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:43:35] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:43:35] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 86 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 17 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 895206 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 895206 steps, saw 447700 distinct states, run finished after 3006 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:43:38] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:43:38] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:43:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:43:38] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 09:43:38] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:43:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 09:43:38] [INFO ] After 16ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:43:38] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2023-03-10 09:43:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-10 09:43:38] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 09:43:38] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:43:38] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:43:38] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:43:38] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:43:39] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 09:43:39] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-10 09:43:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:43:39] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:43:39] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 11 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-10 09:43:39] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-10 09:43:39] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:43:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 09:43:39] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-10 09:43:39] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:43:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:43:39] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:43:39] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 09:43:39] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:43:39] [INFO ] Flatten gal took : 4 ms
[2023-03-10 09:43:39] [INFO ] Flatten gal took : 4 ms
[2023-03-10 09:43:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5142126505229488872.gal : 1 ms
[2023-03-10 09:43:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6190314672667643731.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5142126505229488872.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6190314672667643731.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6190314672667643731.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 150
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :150 after 245
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :245 after 518
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :518 after 1238
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1238 after 2746
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2746 after 5726
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5726 after 11741
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :11741 after 23702
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :23702 after 47690
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :47690 after 95567
Detected timeout of ITS tools.
[2023-03-10 09:43:54] [INFO ] Flatten gal took : 4 ms
[2023-03-10 09:43:54] [INFO ] Applying decomposition
[2023-03-10 09:43:54] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17810136274876225726.txt' '-o' '/tmp/graph17810136274876225726.bin' '-w' '/tmp/graph17810136274876225726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17810136274876225726.bin' '-l' '-1' '-v' '-w' '/tmp/graph17810136274876225726.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:43:54] [INFO ] Decomposing Gal with order
[2023-03-10 09:43:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:43:54] [INFO ] Removed a total of 42 redundant transitions.
[2023-03-10 09:43:54] [INFO ] Flatten gal took : 13 ms
[2023-03-10 09:43:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2023-03-10 09:43:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4931960480620254193.gal : 2 ms
[2023-03-10 09:43:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11132379636848518368.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4931960480620254193.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11132379636848518368.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality11132379636848518368.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :188 after 343
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :343 after 707
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :51740 after 63884
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13669614200495944100
[2023-03-10 09:44:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13669614200495944100
Running compilation step : cd /tmp/ltsmin13669614200495944100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 260 ms.
Running link step : cd /tmp/ltsmin13669614200495944100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13669614200495944100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 883801 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 883801 steps, saw 441986 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:44:27] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-10 09:44:27] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:44:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:44:27] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-10 09:44:27] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:44:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:44:27] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:44:27] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:44:27] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 88 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 85 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 9 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 903919 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 903919 steps, saw 452057 distinct states, run finished after 3003 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:44:30] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:44:30] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:44:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:44:30] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 09:44:31] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:44:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 09:44:31] [INFO ] After 23ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:44:31] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-10 09:44:31] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:44:31] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:44:31] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:44:31] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:44:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 09:44:31] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2023-03-10 09:44:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2023-03-10 09:44:31] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 09:44:31] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 8 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-10 09:44:31] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 09:44:31] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:44:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-10 09:44:31] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-10 09:44:31] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:44:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:44:31] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:44:32] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 09:44:32] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:44:32] [INFO ] Flatten gal took : 7 ms
[2023-03-10 09:44:32] [INFO ] Flatten gal took : 6 ms
[2023-03-10 09:44:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1210736968656524829.gal : 2 ms
[2023-03-10 09:44:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2078615410987004935.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1210736968656524829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2078615410987004935.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2078615410987004935.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 150
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :150 after 245
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :245 after 518
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :518 after 1238
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1238 after 2746
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2746 after 5726
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5726 after 11741
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :11741 after 23702
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :23702 after 47690
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :47690 after 95567
Detected timeout of ITS tools.
[2023-03-10 09:44:47] [INFO ] Flatten gal took : 5 ms
[2023-03-10 09:44:47] [INFO ] Applying decomposition
[2023-03-10 09:44:47] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14938248383531233317.txt' '-o' '/tmp/graph14938248383531233317.bin' '-w' '/tmp/graph14938248383531233317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14938248383531233317.bin' '-l' '-1' '-v' '-w' '/tmp/graph14938248383531233317.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:44:47] [INFO ] Decomposing Gal with order
[2023-03-10 09:44:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:44:47] [INFO ] Removed a total of 39 redundant transitions.
[2023-03-10 09:44:47] [INFO ] Flatten gal took : 12 ms
[2023-03-10 09:44:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2023-03-10 09:44:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11855170631278256210.gal : 2 ms
[2023-03-10 09:44:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17638312680225584531.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11855170631278256210.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17638312680225584531.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality17638312680225584531.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :230 after 423
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8425689456811633520
[2023-03-10 09:45:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8425689456811633520
Running compilation step : cd /tmp/ltsmin8425689456811633520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 369 ms.
Running link step : cd /tmp/ltsmin8425689456811633520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8425689456811633520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 932387 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 932387 steps, saw 466292 distinct states, run finished after 3006 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-10 09:45:20] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-10 09:45:20] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:45:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-10 09:45:20] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-10 09:45:20] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:45:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:45:20] [INFO ] After 20ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:45:20] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 09:45:20] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 92 transition count 87
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 84 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 82 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 82 transition count 82
Applied a total of 25 rules in 19 ms. Remains 82 /96 variables (removed 14) and now considering 82/94 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/96 places, 82/94 transitions.
Incomplete random walk after 10000 steps, including 1477 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 919621 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 919621 steps, saw 459913 distinct states, run finished after 3005 ms. (steps per millisecond=306 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 82 cols
[2023-03-10 09:45:23] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:45:23] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:45:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-10 09:45:23] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-10 09:45:23] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:45:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 09:45:23] [INFO ] After 14ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:45:23] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 09:45:23] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
// Phase 1: matrix 82 rows 82 cols
[2023-03-10 09:45:23] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:45:23] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 82 rows 82 cols
[2023-03-10 09:45:23] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:45:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 09:45:24] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-10 09:45:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 82 rows 82 cols
[2023-03-10 09:45:24] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:45:24] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 82/82 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 72 transition count 72
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 70
Applied a total of 24 rules in 12 ms. Remains 70 /82 variables (removed 12) and now considering 70/82 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-10 09:45:24] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 09:45:24] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 09:45:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-10 09:45:24] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-10 09:45:24] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 09:45:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 09:45:24] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:45:24] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-10 09:45:24] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 09:45:24] [INFO ] Flatten gal took : 7 ms
[2023-03-10 09:45:24] [INFO ] Flatten gal took : 6 ms
[2023-03-10 09:45:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12236314100895466679.gal : 2 ms
[2023-03-10 09:45:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9978083682259863673.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12236314100895466679.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9978083682259863673.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality9978083682259863673.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 87
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :87 after 168
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :168 after 316
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :316 after 647
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :647 after 1493
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1493 after 3274
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3274 after 6877
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6877 after 14087
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :14087 after 28406
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :28406 after 57109
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :57109 after 114466
Detected timeout of ITS tools.
[2023-03-10 09:45:39] [INFO ] Flatten gal took : 4 ms
[2023-03-10 09:45:39] [INFO ] Applying decomposition
[2023-03-10 09:45:39] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15894946774237730396.txt' '-o' '/tmp/graph15894946774237730396.bin' '-w' '/tmp/graph15894946774237730396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15894946774237730396.bin' '-l' '-1' '-v' '-w' '/tmp/graph15894946774237730396.weights' '-q' '0' '-e' '0.001'
[2023-03-10 09:45:39] [INFO ] Decomposing Gal with order
[2023-03-10 09:45:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 09:45:39] [INFO ] Removed a total of 43 redundant transitions.
[2023-03-10 09:45:39] [INFO ] Flatten gal took : 9 ms
[2023-03-10 09:45:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2023-03-10 09:45:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2478725505912167058.gal : 2 ms
[2023-03-10 09:45:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1726891249748906493.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16525727463363279957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2478725505912167058.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1726891249748906493.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality1726891249748906493.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :197 after 200
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31361 after 72849

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is DoubleExponent-PT-004, 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 r160-smll-167819446000293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;