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.r132-tall-165271821200695.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 MultiCrashLeafsetExtension-PT-S16C07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821200695
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 13K Apr 29 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 29 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 29 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 29 16:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 16:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 5.7M May 10 09:34 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 MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654242082774

Running Version 202205111006
[2022-06-03 07:41:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-03 07:41:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 07:41:24] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2022-06-03 07:41:24] [INFO ] Transformed 6222 places.
[2022-06-03 07:41:24] [INFO ] Transformed 8685 transitions.
[2022-06-03 07:41:24] [INFO ] Parsed PT model containing 6222 places and 8685 transitions in 584 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 138 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 16) seen :4
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-03 07:41:26] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2022-06-03 07:41:27] [INFO ] Computed 611 place invariants in 591 ms
[2022-06-03 07:41:28] [INFO ] [Real]Absence check using 52 positive place invariants in 37 ms returned sat
[2022-06-03 07:41:29] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 280 ms returned sat
[2022-06-03 07:41:29] [INFO ] After 2142ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2022-06-03 07:41:30] [INFO ] [Nat]Absence check using 52 positive place invariants in 27 ms returned sat
[2022-06-03 07:41:31] [INFO ] [Nat]Absence check using 52 positive and 559 generalized place invariants in 245 ms returned sat
[2022-06-03 07:41:42] [INFO ] After 10571ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2022-06-03 07:41:42] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-06-03 07:41:54] [INFO ] After 12456ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :6 sat :3
[2022-06-03 07:41:54] [INFO ] After 12457ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-03 07:41:54] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 42 out of 6222 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.27 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions removed 1870 transitions
Trivial Post-agglo rules discarded 1870 transitions
Performed 1870 trivial Post agglomeration. Transition count delta: 1870
Iterating post reduction 0 with 1870 rules applied. Total rules applied 1871 place count 6188 transition count 6815
Reduce places removed 1870 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 1902 rules applied. Total rules applied 3773 place count 4318 transition count 6783
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 3805 place count 4286 transition count 6783
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 3805 place count 4286 transition count 6549
Deduced a syphon composed of 234 places in 6 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 468 rules applied. Total rules applied 4273 place count 4052 transition count 6549
Discarding 1660 places :
Symmetric choice reduction at 3 with 1660 rule applications. Total rules 5933 place count 2392 transition count 4889
Iterating global reduction 3 with 1660 rules applied. Total rules applied 7593 place count 2392 transition count 4889
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 7593 place count 2392 transition count 4879
Deduced a syphon composed of 10 places in 9 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 7613 place count 2382 transition count 4879
Discarding 229 places :
Symmetric choice reduction at 3 with 229 rule applications. Total rules 7842 place count 2153 transition count 3276
Iterating global reduction 3 with 229 rules applied. Total rules applied 8071 place count 2153 transition count 3276
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 8101 place count 2138 transition count 3261
Free-agglomeration rule (complex) applied 102 times.
Iterating global reduction 3 with 102 rules applied. Total rules applied 8203 place count 2138 transition count 3159
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 3 with 102 rules applied. Total rules applied 8305 place count 2036 transition count 3159
Partial Free-agglomeration rule applied 64 times.
Drop transitions removed 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 8369 place count 2036 transition count 3159
Applied a total of 8369 rules in 1801 ms. Remains 2036 /6222 variables (removed 4186) and now considering 3159/8685 (removed 5526) transitions.
Finished structural reductions, in 1 iterations. Remains : 2036/6222 places, 3159/8685 transitions.
Incomplete random walk after 1000000 steps, including 19574 resets, run finished after 13109 ms. (steps per millisecond=76 ) properties (out of 4) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4164 resets, run finished after 3262 ms. (steps per millisecond=306 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4163 resets, run finished after 4220 ms. (steps per millisecond=236 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-03 07:42:16] [INFO ] Flow matrix only has 2785 transitions (discarded 374 similar events)
// Phase 1: matrix 2785 rows 2036 cols
[2022-06-03 07:42:17] [INFO ] Computed 577 place invariants in 34 ms
[2022-06-03 07:42:17] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2022-06-03 07:42:17] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 108 ms returned sat
[2022-06-03 07:42:18] [INFO ] After 1008ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-03 07:42:18] [INFO ] State equation strengthened by 1076 read => feed constraints.
[2022-06-03 07:42:18] [INFO ] After 187ms SMT Verify possible using 1076 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 07:42:18] [INFO ] After 1669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 07:42:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2022-06-03 07:42:19] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 111 ms returned sat
[2022-06-03 07:42:20] [INFO ] After 1628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 07:42:24] [INFO ] After 3236ms SMT Verify possible using 1076 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 07:42:25] [INFO ] Deduced a trap composed of 254 places in 1168 ms of which 8 ms to minimize.
[2022-06-03 07:42:26] [INFO ] Deduced a trap composed of 222 places in 1212 ms of which 3 ms to minimize.
[2022-06-03 07:42:28] [INFO ] Deduced a trap composed of 223 places in 1161 ms of which 3 ms to minimize.
[2022-06-03 07:42:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4041 ms
[2022-06-03 07:42:29] [INFO ] After 8517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1184 ms.
[2022-06-03 07:42:30] [INFO ] After 11788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 38 out of 2036 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2036/2036 places, 3159/3159 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2036 transition count 3158
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 2 place count 2035 transition count 3158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2034 transition count 3157
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2034 transition count 3157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 2033 transition count 3150
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 2033 transition count 3150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 2033 transition count 3150
Applied a total of 7 rules in 306 ms. Remains 2033 /2036 variables (removed 3) and now considering 3150/3159 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 2033/2036 places, 3150/3159 transitions.
Incomplete random walk after 1000000 steps, including 19566 resets, run finished after 12085 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4165 resets, run finished after 3741 ms. (steps per millisecond=267 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4163 resets, run finished after 4739 ms. (steps per millisecond=211 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1278171 steps, run timeout after 60001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 1278171 steps, saw 567024 distinct states, run finished after 60002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-03 07:43:51] [INFO ] Flow matrix only has 2776 transitions (discarded 374 similar events)
// Phase 1: matrix 2776 rows 2033 cols
[2022-06-03 07:43:51] [INFO ] Computed 577 place invariants in 56 ms
[2022-06-03 07:43:51] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2022-06-03 07:43:51] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 118 ms returned sat
[2022-06-03 07:43:53] [INFO ] After 1557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 07:43:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2022-06-03 07:43:53] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 111 ms returned sat
[2022-06-03 07:43:55] [INFO ] After 2217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 07:43:55] [INFO ] State equation strengthened by 1070 read => feed constraints.
[2022-06-03 07:44:00] [INFO ] After 5062ms SMT Verify possible using 1070 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 07:44:02] [INFO ] Deduced a trap composed of 417 places in 1179 ms of which 3 ms to minimize.
[2022-06-03 07:44:04] [INFO ] Deduced a trap composed of 357 places in 1110 ms of which 2 ms to minimize.
[2022-06-03 07:44:05] [INFO ] Deduced a trap composed of 388 places in 1162 ms of which 1 ms to minimize.
[2022-06-03 07:44:07] [INFO ] Deduced a trap composed of 378 places in 1150 ms of which 2 ms to minimize.
[2022-06-03 07:44:08] [INFO ] Deduced a trap composed of 332 places in 1180 ms of which 1 ms to minimize.
[2022-06-03 07:44:10] [INFO ] Deduced a trap composed of 406 places in 1197 ms of which 2 ms to minimize.
[2022-06-03 07:44:12] [INFO ] Deduced a trap composed of 417 places in 1191 ms of which 2 ms to minimize.
[2022-06-03 07:44:14] [INFO ] Deduced a trap composed of 307 places in 1146 ms of which 2 ms to minimize.
[2022-06-03 07:44:15] [INFO ] Deduced a trap composed of 399 places in 1169 ms of which 2 ms to minimize.
[2022-06-03 07:44:16] [INFO ] Deduced a trap composed of 413 places in 1146 ms of which 2 ms to minimize.
[2022-06-03 07:44:18] [INFO ] Deduced a trap composed of 330 places in 1174 ms of which 2 ms to minimize.
[2022-06-03 07:44:19] [INFO ] Deduced a trap composed of 388 places in 1135 ms of which 2 ms to minimize.
[2022-06-03 07:44:21] [INFO ] Deduced a trap composed of 371 places in 1177 ms of which 2 ms to minimize.
[2022-06-03 07:44:22] [INFO ] Deduced a trap composed of 424 places in 1184 ms of which 2 ms to minimize.
[2022-06-03 07:44:23] [INFO ] Deduced a trap composed of 363 places in 1196 ms of which 2 ms to minimize.
[2022-06-03 07:44:29] [INFO ] Deduced a trap composed of 373 places in 1185 ms of which 2 ms to minimize.
[2022-06-03 07:44:31] [INFO ] Deduced a trap composed of 291 places in 1197 ms of which 1 ms to minimize.
[2022-06-03 07:44:32] [INFO ] Deduced a trap composed of 303 places in 1221 ms of which 2 ms to minimize.
[2022-06-03 07:44:34] [INFO ] Deduced a trap composed of 319 places in 1223 ms of which 1 ms to minimize.
[2022-06-03 07:44:35] [INFO ] Deduced a trap composed of 234 places in 1209 ms of which 2 ms to minimize.
[2022-06-03 07:44:37] [INFO ] Deduced a trap composed of 329 places in 1236 ms of which 2 ms to minimize.
[2022-06-03 07:44:38] [INFO ] Deduced a trap composed of 302 places in 1198 ms of which 2 ms to minimize.
[2022-06-03 07:44:39] [INFO ] Deduced a trap composed of 424 places in 1158 ms of which 2 ms to minimize.
[2022-06-03 07:44:41] [INFO ] Deduced a trap composed of 252 places in 1161 ms of which 2 ms to minimize.
[2022-06-03 07:44:43] [INFO ] Deduced a trap composed of 280 places in 1164 ms of which 2 ms to minimize.
[2022-06-03 07:44:45] [INFO ] Deduced a trap composed of 329 places in 1187 ms of which 2 ms to minimize.
[2022-06-03 07:44:46] [INFO ] Deduced a trap composed of 350 places in 1180 ms of which 2 ms to minimize.
[2022-06-03 07:44:47] [INFO ] Deduced a trap composed of 211 places in 1219 ms of which 2 ms to minimize.
[2022-06-03 07:44:48] [INFO ] Deduced a trap composed of 245 places in 1194 ms of which 3 ms to minimize.
[2022-06-03 07:44:50] [INFO ] Deduced a trap composed of 302 places in 1136 ms of which 2 ms to minimize.
[2022-06-03 07:44:51] [INFO ] Deduced a trap composed of 326 places in 1195 ms of which 2 ms to minimize.
[2022-06-03 07:44:52] [INFO ] Deduced a trap composed of 206 places in 1160 ms of which 2 ms to minimize.
[2022-06-03 07:44:54] [INFO ] Deduced a trap composed of 284 places in 1177 ms of which 2 ms to minimize.
[2022-06-03 07:44:55] [INFO ] Deduced a trap composed of 192 places in 1189 ms of which 1 ms to minimize.
[2022-06-03 07:44:57] [INFO ] Deduced a trap composed of 327 places in 1195 ms of which 2 ms to minimize.
[2022-06-03 07:44:58] [INFO ] Deduced a trap composed of 170 places in 1204 ms of which 2 ms to minimize.
[2022-06-03 07:45:00] [INFO ] Deduced a trap composed of 191 places in 1183 ms of which 2 ms to minimize.
[2022-06-03 07:45:01] [INFO ] Deduced a trap composed of 170 places in 1108 ms of which 2 ms to minimize.
[2022-06-03 07:45:02] [INFO ] Deduced a trap composed of 232 places in 1203 ms of which 2 ms to minimize.
[2022-06-03 07:45:04] [INFO ] Deduced a trap composed of 374 places in 1176 ms of which 2 ms to minimize.
[2022-06-03 07:45:05] [INFO ] Deduced a trap composed of 214 places in 1207 ms of which 2 ms to minimize.
[2022-06-03 07:45:07] [INFO ] Deduced a trap composed of 272 places in 1204 ms of which 2 ms to minimize.
[2022-06-03 07:45:09] [INFO ] Deduced a trap composed of 410 places in 1215 ms of which 2 ms to minimize.
[2022-06-03 07:45:10] [INFO ] Deduced a trap composed of 348 places in 1185 ms of which 2 ms to minimize.
[2022-06-03 07:45:12] [INFO ] Deduced a trap composed of 358 places in 1197 ms of which 2 ms to minimize.
[2022-06-03 07:45:13] [INFO ] Deduced a trap composed of 297 places in 1207 ms of which 2 ms to minimize.
[2022-06-03 07:45:14] [INFO ] Deduced a trap composed of 349 places in 1227 ms of which 3 ms to minimize.
[2022-06-03 07:45:16] [INFO ] Deduced a trap composed of 365 places in 1213 ms of which 2 ms to minimize.
[2022-06-03 07:45:17] [INFO ] Deduced a trap composed of 303 places in 1222 ms of which 2 ms to minimize.
[2022-06-03 07:45:18] [INFO ] Deduced a trap composed of 304 places in 1235 ms of which 2 ms to minimize.
[2022-06-03 07:45:20] [INFO ] Deduced a trap composed of 398 places in 1207 ms of which 2 ms to minimize.
[2022-06-03 07:45:21] [INFO ] Deduced a trap composed of 293 places in 1206 ms of which 2 ms to minimize.
[2022-06-03 07:45:23] [INFO ] Deduced a trap composed of 281 places in 1236 ms of which 2 ms to minimize.
[2022-06-03 07:45:24] [INFO ] Deduced a trap composed of 265 places in 1198 ms of which 2 ms to minimize.
[2022-06-03 07:45:26] [INFO ] Deduced a trap composed of 270 places in 1204 ms of which 2 ms to minimize.
[2022-06-03 07:45:27] [INFO ] Deduced a trap composed of 320 places in 1215 ms of which 2 ms to minimize.
[2022-06-03 07:45:28] [INFO ] Deduced a trap composed of 220 places in 1199 ms of which 1 ms to minimize.
[2022-06-03 07:45:30] [INFO ] Deduced a trap composed of 217 places in 1190 ms of which 3 ms to minimize.
[2022-06-03 07:45:33] [INFO ] Deduced a trap composed of 264 places in 1213 ms of which 2 ms to minimize.
[2022-06-03 07:45:34] [INFO ] Deduced a trap composed of 320 places in 1187 ms of which 2 ms to minimize.
[2022-06-03 07:45:35] [INFO ] Deduced a trap composed of 258 places in 1205 ms of which 2 ms to minimize.
[2022-06-03 07:45:37] [INFO ] Deduced a trap composed of 268 places in 1239 ms of which 2 ms to minimize.
[2022-06-03 07:45:38] [INFO ] Deduced a trap composed of 295 places in 1258 ms of which 4 ms to minimize.
[2022-06-03 07:45:42] [INFO ] Deduced a trap composed of 291 places in 1233 ms of which 2 ms to minimize.
[2022-06-03 07:45:43] [INFO ] Deduced a trap composed of 252 places in 1241 ms of which 2 ms to minimize.
[2022-06-03 07:45:45] [INFO ] Deduced a trap composed of 264 places in 1212 ms of which 2 ms to minimize.
[2022-06-03 07:45:46] [INFO ] Deduced a trap composed of 308 places in 1187 ms of which 2 ms to minimize.
[2022-06-03 07:45:48] [INFO ] Deduced a trap composed of 351 places in 1216 ms of which 2 ms to minimize.
[2022-06-03 07:45:50] [INFO ] Deduced a trap composed of 250 places in 1299 ms of which 2 ms to minimize.
[2022-06-03 07:45:54] [INFO ] Deduced a trap composed of 356 places in 1231 ms of which 2 ms to minimize.
[2022-06-03 07:45:56] [INFO ] Deduced a trap composed of 426 places in 1249 ms of which 2 ms to minimize.
[2022-06-03 07:45:58] [INFO ] Deduced a trap composed of 364 places in 1251 ms of which 3 ms to minimize.
[2022-06-03 07:46:00] [INFO ] Deduced a trap composed of 365 places in 1233 ms of which 3 ms to minimize.
[2022-06-03 07:46:06] [INFO ] Deduced a trap composed of 369 places in 1233 ms of which 2 ms to minimize.
[2022-06-03 07:46:07] [INFO ] Deduced a trap composed of 351 places in 1242 ms of which 2 ms to minimize.
[2022-06-03 07:46:08] [INFO ] Deduced a trap composed of 318 places in 1238 ms of which 2 ms to minimize.
[2022-06-03 07:46:10] [INFO ] Deduced a trap composed of 281 places in 1235 ms of which 2 ms to minimize.
[2022-06-03 07:46:12] [INFO ] Deduced a trap composed of 340 places in 1247 ms of which 2 ms to minimize.
[2022-06-03 07:46:13] [INFO ] Deduced a trap composed of 286 places in 1234 ms of which 2 ms to minimize.
[2022-06-03 07:46:14] [INFO ] Deduced a trap composed of 249 places in 1205 ms of which 2 ms to minimize.
[2022-06-03 07:46:16] [INFO ] Deduced a trap composed of 228 places in 1232 ms of which 2 ms to minimize.
[2022-06-03 07:46:17] [INFO ] Deduced a trap composed of 283 places in 1202 ms of which 2 ms to minimize.
[2022-06-03 07:46:19] [INFO ] Deduced a trap composed of 231 places in 1285 ms of which 2 ms to minimize.
[2022-06-03 07:46:20] [INFO ] Deduced a trap composed of 226 places in 1193 ms of which 2 ms to minimize.
[2022-06-03 07:46:23] [INFO ] Deduced a trap composed of 238 places in 1293 ms of which 4 ms to minimize.
[2022-06-03 07:46:24] [INFO ] Deduced a trap composed of 240 places in 1252 ms of which 2 ms to minimize.
[2022-06-03 07:46:27] [INFO ] Deduced a trap composed of 278 places in 1286 ms of which 3 ms to minimize.
[2022-06-03 07:46:28] [INFO ] Deduced a trap composed of 243 places in 1134 ms of which 1 ms to minimize.
[2022-06-03 07:46:29] [INFO ] Deduced a trap composed of 347 places in 1181 ms of which 2 ms to minimize.
[2022-06-03 07:46:31] [INFO ] Deduced a trap composed of 298 places in 1243 ms of which 2 ms to minimize.
[2022-06-03 07:46:32] [INFO ] Deduced a trap composed of 333 places in 1215 ms of which 3 ms to minimize.
[2022-06-03 07:46:34] [INFO ] Deduced a trap composed of 431 places in 1217 ms of which 2 ms to minimize.
[2022-06-03 07:46:35] [INFO ] Deduced a trap composed of 356 places in 1249 ms of which 2 ms to minimize.
[2022-06-03 07:46:37] [INFO ] Deduced a trap composed of 342 places in 1255 ms of which 2 ms to minimize.
[2022-06-03 07:46:38] [INFO ] Deduced a trap composed of 295 places in 1278 ms of which 2 ms to minimize.
[2022-06-03 07:46:40] [INFO ] Deduced a trap composed of 353 places in 1275 ms of which 2 ms to minimize.
[2022-06-03 07:46:41] [INFO ] Deduced a trap composed of 390 places in 1224 ms of which 2 ms to minimize.
[2022-06-03 07:46:43] [INFO ] Deduced a trap composed of 345 places in 1241 ms of which 2 ms to minimize.
[2022-06-03 07:46:44] [INFO ] Deduced a trap composed of 408 places in 1302 ms of which 2 ms to minimize.
[2022-06-03 07:46:46] [INFO ] Deduced a trap composed of 353 places in 1222 ms of which 2 ms to minimize.
[2022-06-03 07:46:50] [INFO ] Deduced a trap composed of 396 places in 1256 ms of which 2 ms to minimize.
[2022-06-03 07:46:51] [INFO ] Deduced a trap composed of 401 places in 1244 ms of which 2 ms to minimize.
[2022-06-03 07:46:53] [INFO ] Deduced a trap composed of 423 places in 1245 ms of which 1 ms to minimize.
[2022-06-03 07:46:55] [INFO ] Deduced a trap composed of 396 places in 1207 ms of which 2 ms to minimize.
[2022-06-03 07:46:56] [INFO ] Deduced a trap composed of 312 places in 1221 ms of which 2 ms to minimize.
[2022-06-03 07:46:58] [INFO ] Deduced a trap composed of 360 places in 1263 ms of which 2 ms to minimize.
[2022-06-03 07:47:04] [INFO ] Deduced a trap composed of 332 places in 1254 ms of which 2 ms to minimize.
[2022-06-03 07:47:07] [INFO ] Deduced a trap composed of 246 places in 1291 ms of which 2 ms to minimize.
[2022-06-03 07:47:08] [INFO ] Deduced a trap composed of 237 places in 1318 ms of which 2 ms to minimize.
[2022-06-03 07:47:10] [INFO ] Deduced a trap composed of 232 places in 1280 ms of which 2 ms to minimize.
[2022-06-03 07:47:11] [INFO ] Deduced a trap composed of 231 places in 1242 ms of which 2 ms to minimize.
[2022-06-03 07:47:12] [INFO ] Deduced a trap composed of 333 places in 1287 ms of which 2 ms to minimize.
[2022-06-03 07:47:15] [INFO ] Deduced a trap composed of 295 places in 1193 ms of which 2 ms to minimize.
[2022-06-03 07:47:16] [INFO ] Deduced a trap composed of 322 places in 1267 ms of which 2 ms to minimize.
[2022-06-03 07:47:21] [INFO ] Deduced a trap composed of 373 places in 1240 ms of which 3 ms to minimize.
[2022-06-03 07:47:24] [INFO ] Deduced a trap composed of 335 places in 1284 ms of which 2 ms to minimize.
[2022-06-03 07:47:25] [INFO ] Deduced a trap composed of 363 places in 1264 ms of which 2 ms to minimize.
[2022-06-03 07:47:27] [INFO ] Deduced a trap composed of 205 places in 1260 ms of which 2 ms to minimize.
[2022-06-03 07:47:30] [INFO ] Deduced a trap composed of 282 places in 1231 ms of which 2 ms to minimize.
[2022-06-03 07:47:31] [INFO ] Trap strengthening (SAT) tested/added 120/119 trap constraints in 209849 ms
[2022-06-03 07:47:34] [INFO ] Deduced a trap composed of 276 places in 1216 ms of which 1 ms to minimize.
[2022-06-03 07:47:36] [INFO ] Deduced a trap composed of 273 places in 1312 ms of which 2 ms to minimize.
[2022-06-03 07:47:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4136 ms
[2022-06-03 07:47:37] [INFO ] After 221372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 975 ms.
[2022-06-03 07:47:38] [INFO ] After 225038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 38 out of 2033 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2033/2033 places, 3150/3150 transitions.
Applied a total of 0 rules in 94 ms. Remains 2033 /2033 variables (removed 0) and now considering 3150/3150 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2033/2033 places, 3150/3150 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2033/2033 places, 3150/3150 transitions.
Applied a total of 0 rules in 93 ms. Remains 2033 /2033 variables (removed 0) and now considering 3150/3150 (removed 0) transitions.
[2022-06-03 07:47:38] [INFO ] Flow matrix only has 2776 transitions (discarded 374 similar events)
// Phase 1: matrix 2776 rows 2033 cols
[2022-06-03 07:47:38] [INFO ] Computed 577 place invariants in 77 ms
[2022-06-03 07:47:40] [INFO ] Implicit Places using invariants in 2547 ms returned [4, 7, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 46, 58, 72, 87, 103, 104, 105, 106, 107, 108, 109, 110, 122, 132, 140, 146, 150, 152, 169, 175, 178, 179, 180, 181, 182, 183, 184, 185, 187, 191, 197, 206, 216, 228, 241, 255, 257, 258, 259, 260, 261, 262, 272, 280, 287, 294, 296, 298, 315, 321, 324, 325, 326, 327, 328, 329, 330, 331, 333, 335, 339, 346, 354, 364, 375, 387, 388, 389, 390, 391, 392, 393, 394, 402, 408, 412, 414, 416, 418, 435, 441, 444, 445, 446, 447, 448, 449, 450, 451, 453, 455, 457, 462, 468, 476, 485, 495, 496, 497, 498, 499, 500, 501, 502, 508, 512, 514, 516, 518, 520, 537, 543, 546, 547, 548, 549, 550, 551, 552, 553, 555, 557, 559, 562, 566, 572, 579, 587, 588, 589, 590, 591, 593, 594, 599, 604, 606, 608, 610, 612, 629, 636, 639, 640, 641, 642, 643, 644, 645, 646, 648, 650, 652, 654, 656, 660, 665, 671, 672, 673, 674, 675, 676, 677, 678, 680, 682, 684, 686, 688, 690, 707, 713, 716, 717, 718, 720, 721, 722, 723, 725, 727, 729, 731, 733, 737, 740, 744, 745, 746, 747, 748, 749, 750, 751, 753, 755, 757, 759, 761, 763, 781, 787, 790, 791, 792, 793, 794, 795, 796, 797, 799, 801, 803, 805, 807, 809, 811, 814, 815, 816, 817, 818, 819, 820, 821, 823, 825, 827, 829, 831, 833, 850, 852, 855, 858, 859, 860, 861, 862, 864, 865, 867, 869, 871, 873, 875, 877, 881, 884, 886, 887, 888, 889, 890, 891, 893, 895, 897, 899, 901, 905, 924, 931, 934, 935, 936, 937, 938, 939, 940, 941, 943, 945, 947, 949, 951, 953, 955, 958, 959, 960, 961, 962, 963, 964, 965, 967, 969, 971, 973, 975, 977, 994, 1000, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 1010, 1012, 1014, 1016, 1018, 1020, 1022, 1024, 1028, 1029, 1030, 1031, 1032, 1033, 1034, 1035, 1038, 1040, 1042, 1044, 1046, 1048, 1065, 1071, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1083, 1085, 1087, 1089, 1091, 1093, 1097, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1115, 1117, 1121, 1123, 1125, 1142, 1148, 1151, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1160, 1162, 1164, 1166, 1169, 1173, 1179, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1201, 1205, 1207, 1209, 1211, 1213, 1230, 1236, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1249, 1251, 1253, 1255, 1260, 1266, 1274, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1300, 1306, 1310, 1312, 1314, 1316, 1339, 1342, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1351, 1353, 1355, 1359, 1366, 1374, 1384, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1403, 1414, 1422, 1428, 1432, 1434, 1436, 1453, 1459, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1471, 1473, 1477, 1483, 1492, 1502, 1514, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1548, 1558, 1566, 1572, 1576, 1578, 1595, 1597, 1600, 1603, 1604, 1605, 1606, 1607, 1608, 1609, 1610, 1612, 1616, 1622, 1630, 1641, 1653, 1667, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1705, 1717, 1727, 1735, 1741, 1745, 1762]
Discarding 523 places :
Implicit Place search using SMT only with invariants took 2556 ms to find 523 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1510/2033 places, 3150/3150 transitions.
Discarding 219 places :
Symmetric choice reduction at 0 with 219 rule applications. Total rules 219 place count 1291 transition count 2931
Iterating global reduction 0 with 219 rules applied. Total rules applied 438 place count 1291 transition count 2931
Discarding 219 places :
Symmetric choice reduction at 0 with 219 rule applications. Total rules 657 place count 1072 transition count 2712
Iterating global reduction 0 with 219 rules applied. Total rules applied 876 place count 1072 transition count 2712
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 903 place count 1045 transition count 2523
Iterating global reduction 0 with 27 rules applied. Total rules applied 930 place count 1045 transition count 2523
Applied a total of 930 rules in 151 ms. Remains 1045 /1510 variables (removed 465) and now considering 2523/3150 (removed 627) transitions.
[2022-06-03 07:47:40] [INFO ] Flow matrix only has 2149 transitions (discarded 374 similar events)
// Phase 1: matrix 2149 rows 1045 cols
[2022-06-03 07:47:40] [INFO ] Computed 54 place invariants in 25 ms
[2022-06-03 07:47:41] [INFO ] Implicit Places using invariants in 830 ms returned []
[2022-06-03 07:47:41] [INFO ] Flow matrix only has 2149 transitions (discarded 374 similar events)
// Phase 1: matrix 2149 rows 1045 cols
[2022-06-03 07:47:41] [INFO ] Computed 54 place invariants in 26 ms
[2022-06-03 07:47:42] [INFO ] State equation strengthened by 908 read => feed constraints.
[2022-06-03 07:47:53] [INFO ] Implicit Places using invariants and state equation in 11645 ms returned []
Implicit Place search using SMT with State Equation took 12478 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1045/2033 places, 2523/3150 transitions.
Finished structural reductions, in 2 iterations. Remains : 1045/2033 places, 2523/3150 transitions.
Incomplete random walk after 1000000 steps, including 19572 resets, run finished after 11467 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4164 resets, run finished after 3019 ms. (steps per millisecond=331 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4164 resets, run finished after 3952 ms. (steps per millisecond=253 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1388162 steps, run timeout after 54001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 1388162 steps, saw 582764 distinct states, run finished after 54001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-03 07:49:05] [INFO ] Flow matrix only has 2149 transitions (discarded 374 similar events)
// Phase 1: matrix 2149 rows 1045 cols
[2022-06-03 07:49:05] [INFO ] Computed 54 place invariants in 38 ms
[2022-06-03 07:49:06] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-06-03 07:49:06] [INFO ] [Real]Absence check using 31 positive and 23 generalized place invariants in 25 ms returned sat
[2022-06-03 07:49:06] [INFO ] After 987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 07:49:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-06-03 07:49:07] [INFO ] [Nat]Absence check using 31 positive and 23 generalized place invariants in 25 ms returned sat
[2022-06-03 07:49:08] [INFO ] After 994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 07:49:08] [INFO ] State equation strengthened by 908 read => feed constraints.
[2022-06-03 07:49:08] [INFO ] After 772ms SMT Verify possible using 908 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 07:49:09] [INFO ] Deduced a trap composed of 109 places in 462 ms of which 1 ms to minimize.
[2022-06-03 07:49:10] [INFO ] Deduced a trap composed of 250 places in 411 ms of which 1 ms to minimize.
[2022-06-03 07:49:10] [INFO ] Deduced a trap composed of 112 places in 439 ms of which 1 ms to minimize.
[2022-06-03 07:49:11] [INFO ] Deduced a trap composed of 107 places in 436 ms of which 1 ms to minimize.
[2022-06-03 07:49:11] [INFO ] Deduced a trap composed of 97 places in 448 ms of which 1 ms to minimize.
[2022-06-03 07:49:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2868 ms
[2022-06-03 07:49:12] [INFO ] After 4598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1244 ms.
[2022-06-03 07:49:14] [INFO ] After 7072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 181 ms.
Support contains 38 out of 1045 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1045/1045 places, 2523/2523 transitions.
Applied a total of 0 rules in 103 ms. Remains 1045 /1045 variables (removed 0) and now considering 2523/2523 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1045/1045 places, 2523/2523 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1045/1045 places, 2523/2523 transitions.
Applied a total of 0 rules in 98 ms. Remains 1045 /1045 variables (removed 0) and now considering 2523/2523 (removed 0) transitions.
[2022-06-03 07:49:14] [INFO ] Flow matrix only has 2149 transitions (discarded 374 similar events)
// Phase 1: matrix 2149 rows 1045 cols
[2022-06-03 07:49:14] [INFO ] Computed 54 place invariants in 23 ms
[2022-06-03 07:49:15] [INFO ] Implicit Places using invariants in 783 ms returned []
[2022-06-03 07:49:15] [INFO ] Flow matrix only has 2149 transitions (discarded 374 similar events)
// Phase 1: matrix 2149 rows 1045 cols
[2022-06-03 07:49:15] [INFO ] Computed 54 place invariants in 22 ms
[2022-06-03 07:49:15] [INFO ] State equation strengthened by 908 read => feed constraints.
[2022-06-03 07:49:26] [INFO ] Implicit Places using invariants and state equation in 11775 ms returned []
Implicit Place search using SMT with State Equation took 12560 ms to find 0 implicit places.
[2022-06-03 07:49:27] [INFO ] Redundant transitions in 146 ms returned []
[2022-06-03 07:49:27] [INFO ] Flow matrix only has 2149 transitions (discarded 374 similar events)
// Phase 1: matrix 2149 rows 1045 cols
[2022-06-03 07:49:27] [INFO ] Computed 54 place invariants in 29 ms
[2022-06-03 07:49:28] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1045/1045 places, 2523/2523 transitions.
Incomplete random walk after 1000000 steps, including 19562 resets, run finished after 12805 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4164 resets, run finished after 3023 ms. (steps per millisecond=330 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4163 resets, run finished after 3924 ms. (steps per millisecond=254 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1512304 steps, run timeout after 57001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 1512304 steps, saw 634882 distinct states, run finished after 57001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-03 07:50:44] [INFO ] Flow matrix only has 2149 transitions (discarded 374 similar events)
// Phase 1: matrix 2149 rows 1045 cols
[2022-06-03 07:50:44] [INFO ] Computed 54 place invariants in 26 ms
[2022-06-03 07:50:45] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-06-03 07:50:45] [INFO ] [Real]Absence check using 31 positive and 23 generalized place invariants in 27 ms returned sat
[2022-06-03 07:50:45] [INFO ] After 985ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 07:50:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-06-03 07:50:46] [INFO ] [Nat]Absence check using 31 positive and 23 generalized place invariants in 24 ms returned sat
[2022-06-03 07:50:47] [INFO ] After 996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 07:50:47] [INFO ] State equation strengthened by 908 read => feed constraints.
[2022-06-03 07:50:47] [INFO ] After 769ms SMT Verify possible using 908 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 07:50:48] [INFO ] Deduced a trap composed of 109 places in 448 ms of which 1 ms to minimize.
[2022-06-03 07:50:49] [INFO ] Deduced a trap composed of 250 places in 423 ms of which 1 ms to minimize.
[2022-06-03 07:50:49] [INFO ] Deduced a trap composed of 112 places in 450 ms of which 1 ms to minimize.
[2022-06-03 07:50:50] [INFO ] Deduced a trap composed of 107 places in 465 ms of which 1 ms to minimize.
[2022-06-03 07:50:50] [INFO ] Deduced a trap composed of 97 places in 456 ms of which 1 ms to minimize.
[2022-06-03 07:50:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2919 ms
[2022-06-03 07:50:51] [INFO ] After 4641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1223 ms.
[2022-06-03 07:50:53] [INFO ] After 7099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 134 ms.
Support contains 38 out of 1045 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1045/1045 places, 2523/2523 transitions.
Applied a total of 0 rules in 64 ms. Remains 1045 /1045 variables (removed 0) and now considering 2523/2523 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1045/1045 places, 2523/2523 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1045/1045 places, 2523/2523 transitions.
Applied a total of 0 rules in 60 ms. Remains 1045 /1045 variables (removed 0) and now considering 2523/2523 (removed 0) transitions.
[2022-06-03 07:50:53] [INFO ] Flow matrix only has 2149 transitions (discarded 374 similar events)
// Phase 1: matrix 2149 rows 1045 cols
[2022-06-03 07:50:53] [INFO ] Computed 54 place invariants in 29 ms
[2022-06-03 07:50:54] [INFO ] Implicit Places using invariants in 816 ms returned []
[2022-06-03 07:50:54] [INFO ] Flow matrix only has 2149 transitions (discarded 374 similar events)
// Phase 1: matrix 2149 rows 1045 cols
[2022-06-03 07:50:54] [INFO ] Computed 54 place invariants in 28 ms
[2022-06-03 07:50:54] [INFO ] State equation strengthened by 908 read => feed constraints.
[2022-06-03 07:51:05] [INFO ] Implicit Places using invariants and state equation in 11837 ms returned []
Implicit Place search using SMT with State Equation took 12657 ms to find 0 implicit places.
[2022-06-03 07:51:06] [INFO ] Redundant transitions in 121 ms returned []
[2022-06-03 07:51:06] [INFO ] Flow matrix only has 2149 transitions (discarded 374 similar events)
// Phase 1: matrix 2149 rows 1045 cols
[2022-06-03 07:51:06] [INFO ] Computed 54 place invariants in 26 ms
[2022-06-03 07:51:07] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1045/1045 places, 2523/2523 transitions.
Graph (trivial) has 821 edges and 1045 vertex of which 15 / 1045 are part of one of the 1 SCC in 6 ms
Free SCC test removed 14 places
Drop transitions removed 205 transitions
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 632 transitions.
Graph (complete) has 3055 edges and 1031 vertex of which 1018 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node7IsNotRespondingToNode10ToReplaceNode8.Node10IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 89 rules applied. Total rules applied 91 place count 1002 transition count 1802
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 1 with 250 rules applied. Total rules applied 341 place count 915 transition count 1639
Reduce places removed 81 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 2 with 215 rules applied. Total rules applied 556 place count 834 transition count 1505
Reduce places removed 58 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 163 rules applied. Total rules applied 719 place count 776 transition count 1400
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 4 with 135 rules applied. Total rules applied 854 place count 724 transition count 1317
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 5 with 98 rules applied. Total rules applied 952 place count 688 transition count 1255
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 6 with 75 rules applied. Total rules applied 1027 place count 657 transition count 1211
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 7 with 46 rules applied. Total rules applied 1073 place count 639 transition count 1183
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 28 rules applied. Total rules applied 1101 place count 625 transition count 1169
Reduce places removed 5 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 9 with 19 rules applied. Total rules applied 1120 place count 620 transition count 1155
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 1136 place count 606 transition count 1153
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 19 Pre rules applied. Total rules applied 1136 place count 606 transition count 1134
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 38 rules applied. Total rules applied 1174 place count 587 transition count 1134
Discarding 207 places :
Symmetric choice reduction at 11 with 207 rule applications. Total rules 1381 place count 380 transition count 920
Iterating global reduction 11 with 207 rules applied. Total rules applied 1588 place count 380 transition count 920
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 11 with 148 rules applied. Total rules applied 1736 place count 380 transition count 772
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1739 place count 377 transition count 761
Iterating global reduction 12 with 3 rules applied. Total rules applied 1742 place count 377 transition count 761
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 12 with 346 rules applied. Total rules applied 2088 place count 204 transition count 588
Drop transitions removed 112 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 12 with 150 rules applied. Total rules applied 2238 place count 204 transition count 438
Discarding 37 places :
Symmetric choice reduction at 13 with 37 rule applications. Total rules 2275 place count 167 transition count 355
Iterating global reduction 13 with 37 rules applied. Total rules applied 2312 place count 167 transition count 355
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 13 with 32 rules applied. Total rules applied 2344 place count 167 transition count 323
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2352 place count 163 transition count 355
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 14 with 34 rules applied. Total rules applied 2386 place count 163 transition count 321
Discarding 20 places :
Symmetric choice reduction at 14 with 20 rule applications. Total rules 2406 place count 143 transition count 283
Iterating global reduction 14 with 20 rules applied. Total rules applied 2426 place count 143 transition count 283
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 14 with 21 rules applied. Total rules applied 2447 place count 143 transition count 262
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2448 place count 142 transition count 257
Iterating global reduction 15 with 1 rules applied. Total rules applied 2449 place count 142 transition count 257
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 2453 place count 140 transition count 285
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2455 place count 140 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 2457 place count 138 transition count 283
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2458 place count 138 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2459 place count 137 transition count 282
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 17 with 18 rules applied. Total rules applied 2477 place count 137 transition count 282
Partial Post-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 17 with 22 rules applied. Total rules applied 2499 place count 137 transition count 282
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 2502 place count 134 transition count 279
Iterating global reduction 17 with 3 rules applied. Total rules applied 2505 place count 134 transition count 279
Applied a total of 2505 rules in 465 ms. Remains 134 /1045 variables (removed 911) and now considering 279/2523 (removed 2244) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 279 rows 134 cols
[2022-06-03 07:51:07] [INFO ] Computed 26 place invariants in 2 ms
[2022-06-03 07:51:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-03 07:51:07] [INFO ] [Real]Absence check using 4 positive and 22 generalized place invariants in 3 ms returned sat
[2022-06-03 07:51:07] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-03 07:51:07] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 07:51:07] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 07:51:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-06-03 07:51:07] [INFO ] [Nat]Absence check using 4 positive and 22 generalized place invariants in 3 ms returned sat
[2022-06-03 07:51:07] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 07:51:07] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 0 ms to minimize.
[2022-06-03 07:51:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2022-06-03 07:51:08] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 0 ms to minimize.
[2022-06-03 07:51:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2022-06-03 07:51:08] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-06-03 07:51:08] [INFO ] After 465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 07:51:08] [INFO ] Flatten gal took : 56 ms
[2022-06-03 07:51:08] [INFO ] Flatten gal took : 22 ms
[2022-06-03 07:51:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15026631713475497519.gal : 12 ms
[2022-06-03 07:51:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5908542271294945950.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/ReachabilityCardinality15026631713475497519.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5908542271294945950.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/ReachabilityCardinality5908542271294945950.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 35
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :35 after 67
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :67 after 259
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :259 after 583
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :583 after 3146
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3146 after 16552
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :16552 after 228017
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :228017 after 1.86148e+06
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,1.05919e+07,2.04861,67468,2,16128,15,174667,8,0,818,183951,0
Total reachable state count : 10591905

Verifying 2 reachability properties.
Reachability property MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-01 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
MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-01,19837,2.05019,67468,2,1469,15,174667,8,0,821,183951,0
Reachability property MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-07 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
MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-07,26844,2.06458,67468,2,1487,15,174667,8,0,835,183951,0
[2022-06-03 07:51:10] [INFO ] Flatten gal took : 136 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin65951887622174881
[2022-06-03 07:51:10] [INFO ] Too many transitions (2523) to apply POR reductions. Disabling POR matrices.
[2022-06-03 07:51:10] [INFO ] Applying decomposition
[2022-06-03 07:51:11] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin65951887622174881
Running compilation step : cd /tmp/ltsmin65951887622174881;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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-03 07:51:11] [INFO ] Flatten gal took : 148 ms
[2022-06-03 07:51:11] [INFO ] Flatten gal took : 284 ms
Compilation finished in 5725 ms.
Running link step : cd /tmp/ltsmin65951887622174881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin65951887622174881;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'MultiCrashLeafsetExtensionPTS16C07ReachabilityFireability01==true'
LTSmin run took 1289686 ms.
Invariant validated
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin65951887622174881;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'MultiCrashLeafsetExtensionPTS16C07ReachabilityFireability07==true'
LTSmin run took 1426743 ms.
Invariant validated
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT

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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="MultiCrashLeafsetExtension-PT-S16C07"
export BK_EXAMINATION="ReachabilityFireability"
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 MultiCrashLeafsetExtension-PT-S16C07, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821200695"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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