Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 9.9K Apr 30 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 30 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 30 05:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 30 05:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 30 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 30 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 5.9M May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654188718681

Running Version 202205111006
[2022-06-02 16:51:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:51:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:52:00] [INFO ] Load time of PNML (sax parser for PT used): 484 ms
[2022-06-02 16:52:00] [INFO ] Transformed 500 places.
[2022-06-02 16:52:00] [INFO ] Transformed 10200 transitions.
[2022-06-02 16:52:00] [INFO ] Found NUPN structural information;
[2022-06-02 16:52:00] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 661 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 963 ms. (steps per millisecond=10 ) properties (out of 16) seen :2
FORMULA Dekker-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2022-06-02 16:52:02] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2022-06-02 16:52:02] [INFO ] Computed 300 place invariants in 20 ms
[2022-06-02 16:52:03] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-02 16:52:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2022-06-02 16:52:03] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 15 ms returned sat
[2022-06-02 16:52:03] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :4
[2022-06-02 16:52:03] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-06-02 16:52:03] [INFO ] After 221ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :10 sat :4
[2022-06-02 16:52:04] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 4 ms to minimize.
[2022-06-02 16:52:04] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 2 ms to minimize.
[2022-06-02 16:52:05] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2022-06-02 16:52:05] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 2 ms to minimize.
[2022-06-02 16:52:05] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2022-06-02 16:52:06] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2022-06-02 16:52:06] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2022-06-02 16:52:06] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2022-06-02 16:52:07] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2022-06-02 16:52:07] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2022-06-02 16:52:07] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2022-06-02 16:52:07] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3595 ms
[2022-06-02 16:52:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3596 ms
[2022-06-02 16:52:08] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2022-06-02 16:52:08] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 0 ms to minimize.
[2022-06-02 16:52:08] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2022-06-02 16:52:08] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2022-06-02 16:52:09] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2022-06-02 16:52:09] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2022-06-02 16:52:09] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2022-06-02 16:52:09] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2022-06-02 16:52:10] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2022-06-02 16:52:10] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2022-06-02 16:52:10] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2022-06-02 16:52:10] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2022-06-02 16:52:11] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2022-06-02 16:52:11] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2022-06-02 16:52:11] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2022-06-02 16:52:11] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2022-06-02 16:52:12] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2022-06-02 16:52:12] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2022-06-02 16:52:12] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2022-06-02 16:52:12] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2022-06-02 16:52:12] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2022-06-02 16:52:13] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2022-06-02 16:52:13] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2022-06-02 16:52:13] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2022-06-02 16:52:13] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2022-06-02 16:52:13] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2022-06-02 16:52:13] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2022-06-02 16:52:14] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2022-06-02 16:52:14] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2022-06-02 16:52:14] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2022-06-02 16:52:14] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2022-06-02 16:52:14] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-06-02 16:52:14] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2022-06-02 16:52:15] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2022-06-02 16:52:15] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2022-06-02 16:52:15] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2022-06-02 16:52:15] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2022-06-02 16:52:15] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2022-06-02 16:52:16] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2022-06-02 16:52:16] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2022-06-02 16:52:16] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2022-06-02 16:52:16] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2022-06-02 16:52:16] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2022-06-02 16:52:16] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-06-02 16:52:17] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2022-06-02 16:52:17] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 3 ms to minimize.
[2022-06-02 16:52:17] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2022-06-02 16:52:17] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2022-06-02 16:52:17] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-06-02 16:52:17] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2022-06-02 16:52:18] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2022-06-02 16:52:18] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2022-06-02 16:52:18] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2022-06-02 16:52:18] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2022-06-02 16:52:18] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2022-06-02 16:52:18] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 3 ms to minimize.
[2022-06-02 16:52:19] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 5 ms to minimize.
[2022-06-02 16:52:19] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2022-06-02 16:52:19] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-06-02 16:52:19] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2022-06-02 16:52:19] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2022-06-02 16:52:19] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2022-06-02 16:52:19] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2022-06-02 16:52:20] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2022-06-02 16:52:20] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2022-06-02 16:52:20] [INFO ] Trap strengthening procedure interrupted after too many repetitions 12432 ms
[2022-06-02 16:52:20] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 12432 ms
[2022-06-02 16:52:20] [INFO ] After 16478ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :4
Attempting to minimize the solution found.
Minimization took 162 ms.
[2022-06-02 16:52:20] [INFO ] After 17309ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :4
FORMULA Dekker-PT-100-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-100-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-100-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-100-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-100-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-100-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-100-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-100-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 43 out of 500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 825 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 10200/10200 transitions.
Interrupted random walk after 666199 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4163 ms. (steps per millisecond=240 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3853 ms. (steps per millisecond=259 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4679 ms. (steps per millisecond=213 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3707 ms. (steps per millisecond=269 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 5089188 steps, run timeout after 138002 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 5089188 steps, saw 4545821 distinct states, run finished after 138004 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-02 16:55:25] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2022-06-02 16:55:25] [INFO ] Computed 300 place invariants in 9 ms
[2022-06-02 16:55:25] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 16:55:25] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2022-06-02 16:55:25] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 13 ms returned sat
[2022-06-02 16:55:26] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 16:55:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-06-02 16:55:26] [INFO ] After 222ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 16:55:27] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 0 ms to minimize.
[2022-06-02 16:55:27] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2022-06-02 16:55:27] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2022-06-02 16:55:28] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2022-06-02 16:55:28] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 0 ms to minimize.
[2022-06-02 16:55:28] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 0 ms to minimize.
[2022-06-02 16:55:28] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2022-06-02 16:55:29] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 1 ms to minimize.
[2022-06-02 16:55:29] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 0 ms to minimize.
[2022-06-02 16:55:29] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 0 ms to minimize.
[2022-06-02 16:55:30] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2022-06-02 16:55:31] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2022-06-02 16:55:32] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2022-06-02 16:55:32] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2022-06-02 16:55:32] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2022-06-02 16:55:32] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5908 ms
[2022-06-02 16:55:32] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5908 ms
[2022-06-02 16:55:32] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2022-06-02 16:55:33] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2022-06-02 16:55:33] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2022-06-02 16:55:33] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2022-06-02 16:55:33] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2022-06-02 16:55:34] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2022-06-02 16:55:34] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2022-06-02 16:55:34] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2022-06-02 16:55:34] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2022-06-02 16:55:35] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2022-06-02 16:55:35] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2022-06-02 16:55:35] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2757 ms
[2022-06-02 16:55:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2757 ms
[2022-06-02 16:55:35] [INFO ] After 9087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-06-02 16:55:35] [INFO ] After 9801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 40 out of 500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 530 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 10200/10200 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 452 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-06-02 16:55:36] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2022-06-02 16:55:36] [INFO ] Computed 300 place invariants in 16 ms
[2022-06-02 16:55:44] [INFO ] Implicit Places using invariants in 7633 ms returned [200, 203, 209, 212, 215, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 290, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 94 places :
Implicit Place search using SMT only with invariants took 7649 ms to find 94 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 406/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 363 ms. Remains 406 /406 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 406/500 places, 10200/10200 transitions.
Interrupted random walk after 643698 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3616 ms. (steps per millisecond=276 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3463 ms. (steps per millisecond=288 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4427 ms. (steps per millisecond=225 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3451 ms. (steps per millisecond=289 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 5262504 steps, run timeout after 133336 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 5262504 steps, saw 4725624 distinct states, run finished after 133337 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-02 16:58:42] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 406 cols
[2022-06-02 16:58:42] [INFO ] Computed 206 place invariants in 5 ms
[2022-06-02 16:58:43] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 16:58:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2022-06-02 16:58:43] [INFO ] [Nat]Absence check using 200 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-02 16:58:43] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 16:58:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-06-02 16:58:43] [INFO ] After 327ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 16:58:44] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2022-06-02 16:58:44] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2022-06-02 16:58:44] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2022-06-02 16:58:45] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 0 ms to minimize.
[2022-06-02 16:58:45] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2022-06-02 16:58:45] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2022-06-02 16:58:46] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2022-06-02 16:58:46] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2022-06-02 16:58:46] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2022-06-02 16:58:46] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2022-06-02 16:58:47] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2022-06-02 16:58:47] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3199 ms
[2022-06-02 16:58:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3199 ms
[2022-06-02 16:58:47] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2022-06-02 16:58:47] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2022-06-02 16:58:48] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2022-06-02 16:58:48] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2022-06-02 16:58:48] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2022-06-02 16:58:48] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2022-06-02 16:58:49] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2022-06-02 16:58:49] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2022-06-02 16:58:49] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2022-06-02 16:58:49] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2022-06-02 16:58:49] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2022-06-02 16:58:50] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2022-06-02 16:58:50] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2022-06-02 16:58:50] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2022-06-02 16:58:50] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3394 ms
[2022-06-02 16:58:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3394 ms
[2022-06-02 16:58:50] [INFO ] After 7110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 148 ms.
[2022-06-02 16:58:50] [INFO ] After 7783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 40 out of 406 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 406/406 places, 10200/10200 transitions.
Applied a total of 0 rules in 423 ms. Remains 406 /406 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 10200/10200 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 406/406 places, 10200/10200 transitions.
Applied a total of 0 rules in 409 ms. Remains 406 /406 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-06-02 16:58:51] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 406 cols
[2022-06-02 16:58:51] [INFO ] Computed 206 place invariants in 9 ms
[2022-06-02 16:58:53] [INFO ] Implicit Places using invariants in 1885 ms returned []
Implicit Place search using SMT only with invariants took 1886 ms to find 0 implicit places.
[2022-06-02 16:58:53] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 406 cols
[2022-06-02 16:58:53] [INFO ] Computed 206 place invariants in 4 ms
[2022-06-02 16:58:57] [INFO ] Dead Transitions using invariants and state equation in 3616 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 10200/10200 transitions.
Interrupted random walk after 651029 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3858 ms. (steps per millisecond=259 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3553 ms. (steps per millisecond=281 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4547 ms. (steps per millisecond=219 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3484 ms. (steps per millisecond=287 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 5212711 steps, run timeout after 135002 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 5212711 steps, saw 4681002 distinct states, run finished after 135002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-02 17:01:57] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 406 cols
[2022-06-02 17:01:57] [INFO ] Computed 206 place invariants in 2 ms
[2022-06-02 17:01:57] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 17:01:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2022-06-02 17:01:57] [INFO ] [Nat]Absence check using 200 positive and 6 generalized place invariants in 1 ms returned sat
[2022-06-02 17:01:58] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 17:01:58] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-06-02 17:01:58] [INFO ] After 367ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 17:01:59] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2022-06-02 17:01:59] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2022-06-02 17:01:59] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 1 ms to minimize.
[2022-06-02 17:01:59] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2022-06-02 17:02:00] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 0 ms to minimize.
[2022-06-02 17:02:00] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
[2022-06-02 17:02:00] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 0 ms to minimize.
[2022-06-02 17:02:01] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2022-06-02 17:02:01] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2022-06-02 17:02:01] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2022-06-02 17:02:02] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 0 ms to minimize.
[2022-06-02 17:02:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3316 ms
[2022-06-02 17:02:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3316 ms
[2022-06-02 17:02:02] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2022-06-02 17:02:02] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2022-06-02 17:02:02] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2022-06-02 17:02:03] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2022-06-02 17:02:03] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2022-06-02 17:02:03] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2022-06-02 17:02:04] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2022-06-02 17:02:04] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 1 ms to minimize.
[2022-06-02 17:02:04] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2022-06-02 17:02:04] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2022-06-02 17:02:04] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2022-06-02 17:02:05] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2022-06-02 17:02:05] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2022-06-02 17:02:05] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2022-06-02 17:02:05] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3521 ms
[2022-06-02 17:02:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3521 ms
[2022-06-02 17:02:05] [INFO ] After 7396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 154 ms.
[2022-06-02 17:02:05] [INFO ] After 8082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 40 out of 406 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 406/406 places, 10200/10200 transitions.
Applied a total of 0 rules in 449 ms. Remains 406 /406 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 10200/10200 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 406/406 places, 10200/10200 transitions.
Applied a total of 0 rules in 410 ms. Remains 406 /406 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-06-02 17:02:06] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 406 cols
[2022-06-02 17:02:06] [INFO ] Computed 206 place invariants in 4 ms
[2022-06-02 17:02:08] [INFO ] Implicit Places using invariants in 1977 ms returned []
Implicit Place search using SMT only with invariants took 1979 ms to find 0 implicit places.
[2022-06-02 17:02:08] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 406 cols
[2022-06-02 17:02:08] [INFO ] Computed 206 place invariants in 2 ms
[2022-06-02 17:02:12] [INFO ] Dead Transitions using invariants and state equation in 3365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 10200/10200 transitions.
Graph (complete) has 630 edges and 406 vertex of which 126 are kept as prefixes of interest. Removing 280 places using SCC suffix rule.7 ms
Discarding 280 places :
Also discarding 7140 output transitions
Drop transitions removed 7140 transitions
Ensure Unique test removed 5 places
Ensure Unique test removed 2940 transitions
Reduce isomorphic transitions removed 2940 transitions.
Iterating post reduction 0 with 2945 rules applied. Total rules applied 2946 place count 121 transition count 120
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 2976 place count 101 transition count 110
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 2986 place count 101 transition count 100
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2996 place count 101 transition count 90
Ensure Unique test removed 10 places
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 3026 place count 81 transition count 80
Applied a total of 3026 rules in 96 ms. Remains 81 /406 variables (removed 325) and now considering 80/10200 (removed 10120) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 80 rows 81 cols
[2022-06-02 17:02:12] [INFO ] Computed 41 place invariants in 0 ms
[2022-06-02 17:02:12] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 17:02:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-06-02 17:02:12] [INFO ] [Nat]Absence check using 40 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-02 17:02:12] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 17:02:12] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-02 17:02:12] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-06-02 17:02:12] [INFO ] Flatten gal took : 28 ms
[2022-06-02 17:02:12] [INFO ] Flatten gal took : 9 ms
[2022-06-02 17:02:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16001455093345090280.gal : 6 ms
[2022-06-02 17:02:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18341680208329803147.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16001455093345090280.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18341680208329803147.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/ReachabilityCardinality18341680208329803147.prop.
Invariant property Dekker-PT-100-ReachabilityCardinality-08 does not hold.
SDD proceeding with computation,3 properties remain. new max is 2
SDD size :1 after 12
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :12 after 72
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :72 after 1728
Invariant property Dekker-PT-100-ReachabilityCardinality-07 does not hold.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1728 after 373248
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :373248 after 1.07495e+08
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.19174e+10,0.326764,4284,2,133,12,1508,8,0,431,408,0
Total reachable state count : 61917364224

Verifying 4 reachability properties.
Invariant property Dekker-PT-100-ReachabilityCardinality-00 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-00,2.34101e+09,0.328191,4284,2,185,12,1508,8,0,446,408,0
Reachability property Dekker-PT-100-ReachabilityCardinality-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-03,5.37477e+07,0.328538,4284,2,120,12,1508,8,0,448,408,0
Invariant property Dekker-PT-100-ReachabilityCardinality-07 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-07,6,0.331091,4284,2,86,12,1508,9,0,513,408,0
Invariant property Dekker-PT-100-ReachabilityCardinality-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-08,2,0.331337,4284,2,83,12,1508,10,0,515,408,0
[2022-06-02 17:02:13] [INFO ] Flatten gal took : 760 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12710320677141338227
[2022-06-02 17:02:14] [INFO ] Too many transitions (10200) to apply POR reductions. Disabling POR matrices.
[2022-06-02 17:02:14] [INFO ] Applying decomposition
[2022-06-02 17:02:14] [INFO ] Built C files in 355ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12710320677141338227
Running compilation step : cd /tmp/ltsmin12710320677141338227;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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'
[2022-06-02 17:02:15] [INFO ] Flatten gal took : 748 ms
[2022-06-02 17:02:15] [INFO ] Flatten gal took : 736 ms
[2022-06-02 17:02:15] [INFO ] Input system was already deterministic with 10200 transitions.
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/graph2144700112182730398.txt' '-o' '/tmp/graph2144700112182730398.bin' '-w' '/tmp/graph2144700112182730398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2144700112182730398.bin' '-l' '-1' '-v' '-w' '/tmp/graph2144700112182730398.weights' '-q' '0' '-e' '0.001'
[2022-06-02 17:02:16] [INFO ] Decomposing Gal with order
[2022-06-02 17:02:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 17:02:18] [INFO ] Removed a total of 29796 redundant transitions.
[2022-06-02 17:02:18] [INFO ] Flatten gal took : 1400 ms
[2022-06-02 17:02:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 255 ms.
[2022-06-02 17:02:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12330503883576167848.gal : 64 ms
[2022-06-02 17:02:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10012883524848333542.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12330503883576167848.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10012883524848333542.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
[2022-06-02 17:02:19] [INFO ] Ran tautology test, simplified 0 / 4 in 4906 ms.
[2022-06-02 17:02:20] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-00(UNSAT) depth K=0 took 4 ms
[2022-06-02 17:02:20] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-03(UNSAT) depth K=0 took 0 ms
[2022-06-02 17:02:20] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-07(UNSAT) depth K=0 took 9 ms
[2022-06-02 17:02:20] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-08(UNSAT) depth K=0 took 1 ms
[2022-06-02 17:02:20] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-00(UNSAT) depth K=1 took 52 ms
[2022-06-02 17:02:20] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-03(UNSAT) depth K=1 took 23 ms
[2022-06-02 17:02:20] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-07(UNSAT) depth K=1 took 148 ms
[2022-06-02 17:02:20] [INFO ] BMC solution for property Dekker-PT-100-ReachabilityCardinality-08(UNSAT) depth K=1 took 35 ms
Loading property file /tmp/ReachabilityCardinality10012883524848333542.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 400 out of 10200 initially.
// Phase 1: matrix 400 rows 406 cols
[2022-06-02 17:02:23] [INFO ] Computed 206 place invariants in 6 ms
[2022-06-02 17:02:23] [INFO ] Computed 206 place invariants in 7 ms
Invariant property Dekker-PT-100-ReachabilityCardinality-08 does not hold.
FORMULA Dekker-PT-100-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property Dekker-PT-100-ReachabilityCardinality-03 is true.
FORMULA Dekker-PT-100-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :4 after 1.26765e+30
Invariant property Dekker-PT-100-ReachabilityCardinality-07 does not hold.
FORMULA Dekker-PT-100-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Dekker-PT-100-ReachabilityCardinality-00 does not hold.
FORMULA Dekker-PT-100-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 5 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.16913e+30,3.78452,39912,228,25,3700,5192,10646,2651,44,5360,0
Total reachable state count : 3169126500570573503741758013440

Verifying 4 reachability properties.
Invariant property Dekker-PT-100-ReachabilityCardinality-00 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-00,1.23794e+28,3.79528,39912,132,16,3700,5192,10697,2651,56,5360,0
Reachability property Dekker-PT-100-ReachabilityCardinality-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-03,1.47574e+20,3.79609,39912,114,14,3700,5192,10702,2651,58,5360,0
Invariant property Dekker-PT-100-ReachabilityCardinality-07 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-07,1.78263e+29,3.81844,39912,170,18,3700,5192,10806,2651,67,5360,0
Invariant property Dekker-PT-100-ReachabilityCardinality-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-ReachabilityCardinality-08,128,3.81896,39912,115,15,3700,5192,10809,2651,69,5360,0
[2022-06-02 17:02:23] [WARNING] Interrupting SMT solver.
Exception in thread "Thread-9" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:117)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 17:02:23] [WARNING] Unexpected error occurred while running SMT. Was verifying Dekker-PT-100-ReachabilityCardinality-00 SMT depth 2
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-02 17:02:23] [INFO ] During BMC, SMT solver timed out at depth 2
[2022-06-02 17:02:23] [INFO ] BMC solving timed out (3600000 secs) at depth 2
[2022-06-02 17:02:23] [INFO ] SMT solved 0/ 4 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 623749 ms.

BK_STOP 1654189343745

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Dekker-PT-100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-tall-165254772300630"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-100.tgz
mv Dekker-PT-100 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;