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.r222-tall-165286024800127.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 ShieldIIPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Apr 29 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 29 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 29 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 29 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 503K 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 ShieldIIPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654265069710

Running Version 202205111006
[2022-06-03 14:04:30] [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 14:04:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:04:31] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2022-06-03 14:04:31] [INFO ] Transformed 1803 places.
[2022-06-03 14:04:31] [INFO ] Transformed 1773 transitions.
[2022-06-03 14:04:31] [INFO ] Found NUPN structural information;
[2022-06-03 14:04:31] [INFO ] Parsed PT model containing 1803 places and 1773 transitions in 338 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=14 ) properties (out of 16) seen :8
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1773 rows 1803 cols
[2022-06-03 14:04:32] [INFO ] Computed 271 place invariants in 35 ms
[2022-06-03 14:04:33] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 14:04:34] [INFO ] [Nat]Absence check using 271 positive place invariants in 112 ms returned sat
[2022-06-03 14:04:39] [INFO ] After 4165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-03 14:04:40] [INFO ] Deduced a trap composed of 20 places in 507 ms of which 5 ms to minimize.
[2022-06-03 14:04:41] [INFO ] Deduced a trap composed of 14 places in 702 ms of which 2 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 16 places in 562 ms of which 2 ms to minimize.
[2022-06-03 14:04:42] [INFO ] Deduced a trap composed of 23 places in 755 ms of which 3 ms to minimize.
[2022-06-03 14:04:43] [INFO ] Deduced a trap composed of 32 places in 558 ms of which 10 ms to minimize.
[2022-06-03 14:04:44] [INFO ] Deduced a trap composed of 32 places in 633 ms of which 2 ms to minimize.
[2022-06-03 14:04:44] [INFO ] Deduced a trap composed of 25 places in 364 ms of which 1 ms to minimize.
[2022-06-03 14:04:45] [INFO ] Deduced a trap composed of 22 places in 386 ms of which 2 ms to minimize.
[2022-06-03 14:04:45] [INFO ] Deduced a trap composed of 27 places in 410 ms of which 1 ms to minimize.
[2022-06-03 14:04:46] [INFO ] Deduced a trap composed of 24 places in 362 ms of which 1 ms to minimize.
[2022-06-03 14:04:46] [INFO ] Deduced a trap composed of 26 places in 404 ms of which 1 ms to minimize.
[2022-06-03 14:04:47] [INFO ] Deduced a trap composed of 26 places in 373 ms of which 1 ms to minimize.
[2022-06-03 14:04:47] [INFO ] Deduced a trap composed of 22 places in 381 ms of which 1 ms to minimize.
[2022-06-03 14:04:48] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 1 ms to minimize.
[2022-06-03 14:04:48] [INFO ] Deduced a trap composed of 25 places in 364 ms of which 1 ms to minimize.
[2022-06-03 14:04:49] [INFO ] Deduced a trap composed of 29 places in 359 ms of which 1 ms to minimize.
[2022-06-03 14:04:49] [INFO ] Deduced a trap composed of 28 places in 379 ms of which 2 ms to minimize.
[2022-06-03 14:04:50] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 1 ms to minimize.
[2022-06-03 14:04:50] [INFO ] Deduced a trap composed of 21 places in 348 ms of which 1 ms to minimize.
[2022-06-03 14:04:50] [INFO ] Deduced a trap composed of 20 places in 329 ms of which 1 ms to minimize.
[2022-06-03 14:04:51] [INFO ] Deduced a trap composed of 28 places in 361 ms of which 1 ms to minimize.
[2022-06-03 14:04:51] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 1 ms to minimize.
[2022-06-03 14:04:52] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 1 ms to minimize.
[2022-06-03 14:04:52] [INFO ] Deduced a trap composed of 21 places in 320 ms of which 1 ms to minimize.
[2022-06-03 14:04:52] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 1 ms to minimize.
[2022-06-03 14:04:53] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 1 ms to minimize.
[2022-06-03 14:04:53] [INFO ] Deduced a trap composed of 35 places in 276 ms of which 0 ms to minimize.
[2022-06-03 14:04:54] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 1 ms to minimize.
[2022-06-03 14:04:54] [INFO ] Deduced a trap composed of 37 places in 395 ms of which 0 ms to minimize.
[2022-06-03 14:04:56] [INFO ] Deduced a trap composed of 10 places in 443 ms of which 1 ms to minimize.
[2022-06-03 14:04:56] [INFO ] Deduced a trap composed of 19 places in 426 ms of which 1 ms to minimize.
[2022-06-03 14:04:57] [INFO ] Deduced a trap composed of 21 places in 442 ms of which 2 ms to minimize.
[2022-06-03 14:04:57] [INFO ] Deduced a trap composed of 23 places in 502 ms of which 1 ms to minimize.
[2022-06-03 14:04:58] [INFO ] Deduced a trap composed of 23 places in 442 ms of which 11 ms to minimize.
[2022-06-03 14:04:59] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 1 ms to minimize.
[2022-06-03 14:04:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 14:04:59] [INFO ] After 25409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 36095 ms.
Support contains 294 out of 1803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 1803 transition count 1669
Reduce places removed 104 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 114 rules applied. Total rules applied 218 place count 1699 transition count 1659
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 228 place count 1689 transition count 1659
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 228 place count 1689 transition count 1533
Deduced a syphon composed of 126 places in 5 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 480 place count 1563 transition count 1533
Discarding 162 places :
Symmetric choice reduction at 3 with 162 rule applications. Total rules 642 place count 1401 transition count 1371
Iterating global reduction 3 with 162 rules applied. Total rules applied 804 place count 1401 transition count 1371
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 804 place count 1401 transition count 1332
Deduced a syphon composed of 39 places in 8 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 882 place count 1362 transition count 1332
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 5 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 3 with 690 rules applied. Total rules applied 1572 place count 1017 transition count 987
Partial Free-agglomeration rule applied 122 times.
Drop transitions removed 122 transitions
Iterating global reduction 3 with 122 rules applied. Total rules applied 1694 place count 1017 transition count 987
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1695 place count 1016 transition count 986
Applied a total of 1695 rules in 750 ms. Remains 1016 /1803 variables (removed 787) and now considering 986/1773 (removed 787) transitions.
Finished structural reductions, in 1 iterations. Remains : 1016/1803 places, 986/1773 transitions.
Interrupted random walk after 999602 steps, including 401 resets, run timeout after 30001 ms. (steps per millisecond=33 ) properties seen 3
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 636544 steps, including 14 resets, run timeout after 5001 ms. (steps per millisecond=127 ) properties seen 0
Interrupted Best-First random walk after 744304 steps, including 18 resets, run timeout after 5001 ms. (steps per millisecond=148 ) properties seen 0
Interrupted Best-First random walk after 969517 steps, including 19 resets, run timeout after 5001 ms. (steps per millisecond=193 ) properties seen 0
Interrupted Best-First random walk after 830016 steps, including 18 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Interrupted Best-First random walk after 768596 steps, including 16 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen 1
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 986 rows 1016 cols
[2022-06-03 14:06:30] [INFO ] Computed 271 place invariants in 5 ms
[2022-06-03 14:06:31] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 14:06:31] [INFO ] [Nat]Absence check using 271 positive place invariants in 70 ms returned sat
[2022-06-03 14:06:32] [INFO ] After 1243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 14:06:33] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2022-06-03 14:06:33] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2022-06-03 14:06:33] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-06-03 14:06:34] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2022-06-03 14:06:34] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2022-06-03 14:06:34] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2022-06-03 14:06:34] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2022-06-03 14:06:34] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2022-06-03 14:06:35] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2022-06-03 14:06:35] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2022-06-03 14:06:35] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2022-06-03 14:06:35] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2022-06-03 14:06:36] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2022-06-03 14:06:36] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2022-06-03 14:06:36] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2022-06-03 14:06:36] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 13 ms to minimize.
[2022-06-03 14:06:36] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2022-06-03 14:06:37] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:06:37] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2022-06-03 14:06:37] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2022-06-03 14:06:37] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 4 ms to minimize.
[2022-06-03 14:06:37] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2022-06-03 14:06:37] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2022-06-03 14:06:38] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2022-06-03 14:06:38] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2022-06-03 14:06:38] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2022-06-03 14:06:38] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5303 ms
[2022-06-03 14:06:39] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2022-06-03 14:06:39] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2022-06-03 14:06:39] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 2 ms to minimize.
[2022-06-03 14:06:39] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2022-06-03 14:06:39] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2022-06-03 14:06:40] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 4 ms to minimize.
[2022-06-03 14:06:40] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2022-06-03 14:06:40] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2022-06-03 14:06:40] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 2 ms to minimize.
[2022-06-03 14:06:40] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2022-06-03 14:06:41] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2022-06-03 14:06:41] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2022-06-03 14:06:41] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-06-03 14:06:41] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 0 ms to minimize.
[2022-06-03 14:06:41] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2022-06-03 14:06:41] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2892 ms
[2022-06-03 14:06:42] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2022-06-03 14:06:42] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 0 ms to minimize.
[2022-06-03 14:06:42] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2022-06-03 14:06:42] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 0 ms to minimize.
[2022-06-03 14:06:42] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2022-06-03 14:06:43] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2022-06-03 14:06:43] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 0 ms to minimize.
[2022-06-03 14:06:43] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2022-06-03 14:06:43] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 0 ms to minimize.
[2022-06-03 14:06:43] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2022-06-03 14:06:44] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 0 ms to minimize.
[2022-06-03 14:06:44] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 0 ms to minimize.
[2022-06-03 14:06:44] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2022-06-03 14:06:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2695 ms
[2022-06-03 14:06:45] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 0 ms to minimize.
[2022-06-03 14:06:45] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 0 ms to minimize.
[2022-06-03 14:06:45] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2022-06-03 14:06:45] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2022-06-03 14:06:45] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 0 ms to minimize.
[2022-06-03 14:06:46] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 1 ms to minimize.
[2022-06-03 14:06:46] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2022-06-03 14:06:46] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2022-06-03 14:06:46] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2022-06-03 14:06:46] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2022-06-03 14:06:47] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2022-06-03 14:06:47] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2022-06-03 14:06:47] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2022-06-03 14:06:47] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2022-06-03 14:06:47] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2022-06-03 14:06:48] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2022-06-03 14:06:48] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2022-06-03 14:06:48] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2022-06-03 14:06:48] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2022-06-03 14:06:48] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2022-06-03 14:06:49] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2022-06-03 14:06:49] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2022-06-03 14:06:49] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2022-06-03 14:06:49] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2022-06-03 14:06:49] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 0 ms to minimize.
[2022-06-03 14:06:50] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 0 ms to minimize.
[2022-06-03 14:06:50] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2022-06-03 14:06:50] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 0 ms to minimize.
[2022-06-03 14:06:50] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2022-06-03 14:06:50] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2022-06-03 14:06:50] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6029 ms
[2022-06-03 14:06:50] [INFO ] After 19314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1796 ms.
[2022-06-03 14:06:52] [INFO ] After 21445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8645 ms.
Support contains 190 out of 1016 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1016/1016 places, 986/986 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1016 transition count 979
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 1009 transition count 977
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 1007 transition count 977
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 18 place count 1007 transition count 961
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 50 place count 991 transition count 961
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 988 transition count 958
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 988 transition count 958
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 174 place count 929 transition count 899
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 214 place count 929 transition count 899
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 928 transition count 898
Applied a total of 215 rules in 212 ms. Remains 928 /1016 variables (removed 88) and now considering 898/986 (removed 88) transitions.
Finished structural reductions, in 1 iterations. Remains : 928/1016 places, 898/986 transitions.
Interrupted random walk after 970314 steps, including 390 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 0
Interrupted Best-First random walk after 615281 steps, including 15 resets, run timeout after 5001 ms. (steps per millisecond=123 ) properties seen 0
Interrupted Best-First random walk after 720109 steps, including 19 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 4874 ms. (steps per millisecond=205 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 894882 steps, including 20 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen 0
Interrupted probabilistic random walk after 7524571 steps, run timeout after 147001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 7524571 steps, saw 1307547 distinct states, run finished after 147004 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 898 rows 928 cols
[2022-06-03 14:10:18] [INFO ] Computed 271 place invariants in 21 ms
[2022-06-03 14:10:18] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 14:10:18] [INFO ] [Nat]Absence check using 263 positive place invariants in 50 ms returned sat
[2022-06-03 14:10:18] [INFO ] [Nat]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-03 14:10:20] [INFO ] After 1499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 14:10:21] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2022-06-03 14:10:21] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2022-06-03 14:10:22] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2022-06-03 14:10:22] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2022-06-03 14:10:22] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2022-06-03 14:10:22] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2022-06-03 14:10:22] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2022-06-03 14:10:23] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2022-06-03 14:10:23] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2022-06-03 14:10:23] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2022-06-03 14:10:23] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2022-06-03 14:10:23] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-06-03 14:10:24] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2022-06-03 14:10:24] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2022-06-03 14:10:24] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2022-06-03 14:10:24] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2022-06-03 14:10:25] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2022-06-03 14:10:25] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:10:25] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2022-06-03 14:10:25] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2022-06-03 14:10:25] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2022-06-03 14:10:25] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2022-06-03 14:10:26] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2022-06-03 14:10:26] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2022-06-03 14:10:26] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-06-03 14:10:26] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2022-06-03 14:10:27] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2022-06-03 14:10:27] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-06-03 14:10:27] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2022-06-03 14:10:27] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2022-06-03 14:10:27] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-06-03 14:10:27] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2022-06-03 14:10:27] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2022-06-03 14:10:28] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2022-06-03 14:10:28] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-06-03 14:10:28] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2022-06-03 14:10:28] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2022-06-03 14:10:28] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-06-03 14:10:28] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2022-06-03 14:10:28] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7436 ms
[2022-06-03 14:10:29] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2022-06-03 14:10:29] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2022-06-03 14:10:29] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2022-06-03 14:10:29] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2022-06-03 14:10:30] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2022-06-03 14:10:30] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2022-06-03 14:10:30] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 0 ms to minimize.
[2022-06-03 14:10:30] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2022-06-03 14:10:30] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-06-03 14:10:30] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2022-06-03 14:10:31] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2022-06-03 14:10:31] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2022-06-03 14:10:31] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2022-06-03 14:10:31] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2022-06-03 14:10:31] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-06-03 14:10:31] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2022-06-03 14:10:31] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2022-06-03 14:10:32] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2022-06-03 14:10:32] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2022-06-03 14:10:32] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-06-03 14:10:32] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3217 ms
[2022-06-03 14:10:32] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-06-03 14:10:32] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:10:32] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 0 ms to minimize.
[2022-06-03 14:10:33] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2022-06-03 14:10:33] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2022-06-03 14:10:33] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2022-06-03 14:10:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 945 ms
[2022-06-03 14:10:33] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2022-06-03 14:10:33] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2022-06-03 14:10:34] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2022-06-03 14:10:34] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2022-06-03 14:10:34] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2022-06-03 14:10:34] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2022-06-03 14:10:34] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2022-06-03 14:10:34] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2022-06-03 14:10:35] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2022-06-03 14:10:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1630 ms
[2022-06-03 14:10:35] [INFO ] After 16275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2430 ms.
[2022-06-03 14:10:37] [INFO ] After 18992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 5535 ms.
Support contains 190 out of 928 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 928/928 places, 898/898 transitions.
Applied a total of 0 rules in 32 ms. Remains 928 /928 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 928/928 places, 898/898 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 928/928 places, 898/898 transitions.
Applied a total of 0 rules in 32 ms. Remains 928 /928 variables (removed 0) and now considering 898/898 (removed 0) transitions.
// Phase 1: matrix 898 rows 928 cols
[2022-06-03 14:10:43] [INFO ] Computed 271 place invariants in 12 ms
[2022-06-03 14:10:44] [INFO ] Implicit Places using invariants in 815 ms returned []
// Phase 1: matrix 898 rows 928 cols
[2022-06-03 14:10:44] [INFO ] Computed 271 place invariants in 6 ms
[2022-06-03 14:10:45] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
[2022-06-03 14:10:45] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 898 rows 928 cols
[2022-06-03 14:10:45] [INFO ] Computed 271 place invariants in 4 ms
[2022-06-03 14:10:45] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 928/928 places, 898/898 transitions.
Interrupted random walk after 880996 steps, including 350 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Interrupted Best-First random walk after 642322 steps, including 16 resets, run timeout after 5001 ms. (steps per millisecond=128 ) properties seen 0
Interrupted Best-First random walk after 759364 steps, including 21 resets, run timeout after 5001 ms. (steps per millisecond=151 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 22 resets, run finished after 4949 ms. (steps per millisecond=202 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 854414 steps, including 18 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted probabilistic random walk after 7481843 steps, run timeout after 147001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 7481843 steps, saw 1300876 distinct states, run finished after 147001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 898 rows 928 cols
[2022-06-03 14:14:02] [INFO ] Computed 271 place invariants in 4 ms
[2022-06-03 14:14:02] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 14:14:02] [INFO ] [Nat]Absence check using 263 positive place invariants in 48 ms returned sat
[2022-06-03 14:14:02] [INFO ] [Nat]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-03 14:14:04] [INFO ] After 1506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 14:14:05] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 0 ms to minimize.
[2022-06-03 14:14:06] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2022-06-03 14:14:06] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2022-06-03 14:14:06] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2022-06-03 14:14:06] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2022-06-03 14:14:06] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2022-06-03 14:14:07] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2022-06-03 14:14:07] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2022-06-03 14:14:07] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2022-06-03 14:14:07] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2022-06-03 14:14:08] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2022-06-03 14:14:08] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2022-06-03 14:14:08] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-06-03 14:14:08] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2022-06-03 14:14:08] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2022-06-03 14:14:09] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 8 ms to minimize.
[2022-06-03 14:14:09] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2022-06-03 14:14:09] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2022-06-03 14:14:09] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2022-06-03 14:14:09] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2022-06-03 14:14:10] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2022-06-03 14:14:10] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2022-06-03 14:14:10] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2022-06-03 14:14:10] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2022-06-03 14:14:10] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2022-06-03 14:14:11] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2022-06-03 14:14:11] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2022-06-03 14:14:11] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2022-06-03 14:14:11] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-06-03 14:14:11] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 0 ms to minimize.
[2022-06-03 14:14:12] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-06-03 14:14:12] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2022-06-03 14:14:12] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2022-06-03 14:14:12] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2022-06-03 14:14:12] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2022-06-03 14:14:12] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2022-06-03 14:14:12] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2022-06-03 14:14:13] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2022-06-03 14:14:13] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2022-06-03 14:14:13] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7724 ms
[2022-06-03 14:14:13] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2022-06-03 14:14:13] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 1 ms to minimize.
[2022-06-03 14:14:14] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2022-06-03 14:14:14] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2022-06-03 14:14:14] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2022-06-03 14:14:14] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2022-06-03 14:14:15] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2022-06-03 14:14:15] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2022-06-03 14:14:15] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:14:15] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-06-03 14:14:15] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2022-06-03 14:14:15] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2022-06-03 14:14:16] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2022-06-03 14:14:16] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2022-06-03 14:14:16] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2022-06-03 14:14:16] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2022-06-03 14:14:16] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2022-06-03 14:14:16] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2022-06-03 14:14:17] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2022-06-03 14:14:17] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2022-06-03 14:14:17] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3715 ms
[2022-06-03 14:14:17] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2022-06-03 14:14:17] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 3 ms to minimize.
[2022-06-03 14:14:17] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2022-06-03 14:14:17] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2022-06-03 14:14:18] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2022-06-03 14:14:18] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2022-06-03 14:14:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 971 ms
[2022-06-03 14:14:18] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2022-06-03 14:14:18] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2022-06-03 14:14:19] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2022-06-03 14:14:19] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2022-06-03 14:14:19] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2022-06-03 14:14:19] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2022-06-03 14:14:19] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-06-03 14:14:19] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-06-03 14:14:20] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2022-06-03 14:14:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1721 ms
[2022-06-03 14:14:20] [INFO ] After 17165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2416 ms.
[2022-06-03 14:14:22] [INFO ] After 19854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 5135 ms.
Support contains 190 out of 928 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 928/928 places, 898/898 transitions.
Applied a total of 0 rules in 22 ms. Remains 928 /928 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 928/928 places, 898/898 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 928/928 places, 898/898 transitions.
Applied a total of 0 rules in 21 ms. Remains 928 /928 variables (removed 0) and now considering 898/898 (removed 0) transitions.
// Phase 1: matrix 898 rows 928 cols
[2022-06-03 14:14:27] [INFO ] Computed 271 place invariants in 20 ms
[2022-06-03 14:14:28] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 898 rows 928 cols
[2022-06-03 14:14:28] [INFO ] Computed 271 place invariants in 7 ms
[2022-06-03 14:14:29] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
[2022-06-03 14:14:29] [INFO ] Redundant transitions in 99 ms returned []
// Phase 1: matrix 898 rows 928 cols
[2022-06-03 14:14:29] [INFO ] Computed 271 place invariants in 9 ms
[2022-06-03 14:14:29] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 928/928 places, 898/898 transitions.
Applied a total of 0 rules in 22 ms. Remains 928 /928 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 898 rows 928 cols
[2022-06-03 14:14:29] [INFO ] Computed 271 place invariants in 3 ms
[2022-06-03 14:14:30] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 14:14:30] [INFO ] [Nat]Absence check using 263 positive place invariants in 47 ms returned sat
[2022-06-03 14:14:30] [INFO ] [Nat]Absence check using 263 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-03 14:14:32] [INFO ] After 1530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-03 14:14:33] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2022-06-03 14:14:33] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2022-06-03 14:14:33] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2022-06-03 14:14:33] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2022-06-03 14:14:34] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2022-06-03 14:14:34] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2022-06-03 14:14:34] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2022-06-03 14:14:34] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2022-06-03 14:14:35] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2022-06-03 14:14:35] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2022-06-03 14:14:35] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2022-06-03 14:14:35] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2022-06-03 14:14:35] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2022-06-03 14:14:36] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2022-06-03 14:14:36] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2022-06-03 14:14:36] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2022-06-03 14:14:36] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2022-06-03 14:14:36] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2022-06-03 14:14:37] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2022-06-03 14:14:37] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2022-06-03 14:14:37] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2022-06-03 14:14:37] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2022-06-03 14:14:37] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2022-06-03 14:14:38] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-06-03 14:14:38] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2022-06-03 14:14:38] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2022-06-03 14:14:38] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2022-06-03 14:14:38] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2022-06-03 14:14:39] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-06-03 14:14:39] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2022-06-03 14:14:39] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2022-06-03 14:14:39] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2022-06-03 14:14:39] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2022-06-03 14:14:39] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-06-03 14:14:39] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-06-03 14:14:40] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2022-06-03 14:14:40] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2022-06-03 14:14:40] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-06-03 14:14:40] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2022-06-03 14:14:40] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7517 ms
[2022-06-03 14:14:41] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-06-03 14:14:41] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2022-06-03 14:14:41] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2022-06-03 14:14:41] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2022-06-03 14:14:41] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2022-06-03 14:14:42] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2022-06-03 14:14:42] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2022-06-03 14:14:42] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2022-06-03 14:14:42] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2022-06-03 14:14:42] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2022-06-03 14:14:42] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2022-06-03 14:14:43] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2022-06-03 14:14:43] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2022-06-03 14:14:43] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2022-06-03 14:14:43] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2022-06-03 14:14:43] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2022-06-03 14:14:43] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2022-06-03 14:14:43] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2022-06-03 14:14:44] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2022-06-03 14:14:44] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2022-06-03 14:14:44] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3449 ms
[2022-06-03 14:14:44] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2022-06-03 14:14:44] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2022-06-03 14:14:44] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2022-06-03 14:14:44] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2022-06-03 14:14:45] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2022-06-03 14:14:45] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 0 ms to minimize.
[2022-06-03 14:14:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 960 ms
[2022-06-03 14:14:45] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2022-06-03 14:14:45] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2022-06-03 14:14:46] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2022-06-03 14:14:46] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2022-06-03 14:14:46] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2022-06-03 14:14:46] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 0 ms to minimize.
[2022-06-03 14:14:46] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2022-06-03 14:14:46] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2022-06-03 14:14:47] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2022-06-03 14:14:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1645 ms
[2022-06-03 14:14:47] [INFO ] After 16640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2476 ms.
[2022-06-03 14:14:49] [INFO ] After 19400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-06-03 14:14:50] [INFO ] Flatten gal took : 239 ms
[2022-06-03 14:14:50] [INFO ] Flatten gal took : 72 ms
[2022-06-03 14:14:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14752172746470731401.gal : 47 ms
[2022-06-03 14:14:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11390526095654786653.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/ReachabilityCardinality14752172746470731401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11390526095654786653.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/ReachabilityCardinality11390526095654786653.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :10 after 22
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :22 after 80
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :80 after 377
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :377 after 3592
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3592 after 198940
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :198940 after 1.65237e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.65237e+06 after 2.40807e+10
Detected timeout of ITS tools.
[2022-06-03 14:15:05] [INFO ] Flatten gal took : 96 ms
[2022-06-03 14:15:05] [INFO ] Applying decomposition
[2022-06-03 14:15:05] [INFO ] Flatten gal took : 100 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12307309335445604367.txt' '-o' '/tmp/graph12307309335445604367.bin' '-w' '/tmp/graph12307309335445604367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12307309335445604367.bin' '-l' '-1' '-v' '-w' '/tmp/graph12307309335445604367.weights' '-q' '0' '-e' '0.001'
[2022-06-03 14:15:05] [INFO ] Decomposing Gal with order
[2022-06-03 14:15:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:15:06] [INFO ] Removed a total of 645 redundant transitions.
[2022-06-03 14:15:06] [INFO ] Flatten gal took : 197 ms
[2022-06-03 14:15:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 473 labels/synchronizations in 126 ms.
[2022-06-03 14:15:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6720372989799308664.gal : 33 ms
[2022-06-03 14:15:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7938907007368297578.prop : 24 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/ReachabilityCardinality6720372989799308664.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7938907007368297578.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality7938907007368297578.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1102
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1102 after 4.30013e+08
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :4.30013e+08 after 6.44978e+15
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :9.81247e+24 after 2.68559e+29
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9772709326204237643
[2022-06-03 14:15:21] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9772709326204237643
Running compilation step : cd /tmp/ltsmin9772709326204237643;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1765 ms.
Running link step : cd /tmp/ltsmin9772709326204237643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9772709326204237643;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldIIPsPT030BReachabilityFireability00==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 14:15:36] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1393991418471383877
[2022-06-03 14:15:36] [INFO ] Computing symmetric may disable matrix : 898 transitions.
[2022-06-03 14:15:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:15:36] [INFO ] Computing symmetric may enable matrix : 898 transitions.
[2022-06-03 14:15:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:15:36] [INFO ] Applying decomposition
[2022-06-03 14:15:36] [INFO ] Flatten gal took : 77 ms
[2022-06-03 14:15:37] [INFO ] Flatten gal took : 100 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8811069358458291924.txt' '-o' '/tmp/graph8811069358458291924.bin' '-w' '/tmp/graph8811069358458291924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8811069358458291924.bin' '-l' '-1' '-v' '-w' '/tmp/graph8811069358458291924.weights' '-q' '0' '-e' '0.001'
[2022-06-03 14:15:37] [INFO ] Decomposing Gal with order
[2022-06-03 14:15:37] [INFO ] Input system was already deterministic with 898 transitions.
[2022-06-03 14:15:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:15:37] [INFO ] Computing Do-Not-Accords matrix : 898 transitions.
[2022-06-03 14:15:37] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:15:37] [INFO ] Built C files in 528ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1393991418471383877
Running compilation step : cd /tmp/ltsmin1393991418471383877;'/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-03 14:15:37] [INFO ] Removed a total of 658 redundant transitions.
[2022-06-03 14:15:37] [INFO ] Flatten gal took : 204 ms
[2022-06-03 14:15:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 418 labels/synchronizations in 68 ms.
[2022-06-03 14:15:37] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7277291715369225186.gal : 9 ms
[2022-06-03 14:15:37] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7572880405547968682.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability7277291715369225186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7572880405547968682.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability7572880405547968682.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 2722
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2722 after 1.19448e+08
[2022-06-03 14:15:38] [INFO ] Ran tautology test, simplified 0 / 4 in 1321 ms.
[2022-06-03 14:15:38] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=0 took 93 ms
[2022-06-03 14:15:38] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(UNSAT) depth K=0 took 1 ms
[2022-06-03 14:15:38] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-03(UNSAT) depth K=0 took 0 ms
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.19448e+08 after 2.61216e+18
[2022-06-03 14:15:38] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-04(UNSAT) depth K=0 took 1 ms
[2022-06-03 14:15:38] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=1 took 71 ms
[2022-06-03 14:15:38] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(UNSAT) depth K=1 took 93 ms
[2022-06-03 14:15:38] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-03(UNSAT) depth K=1 took 16 ms
[2022-06-03 14:15:38] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-04(UNSAT) depth K=1 took 2 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 898 rows 928 cols
[2022-06-03 14:15:39] [INFO ] Computed 271 place invariants in 19 ms
[2022-06-03 14:15:39] [INFO ] Computed 271 place invariants in 20 ms
[2022-06-03 14:15:41] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=2 took 2767 ms
[2022-06-03 14:15:42] [INFO ] Proved 928 variables to be positive in 2979 ms
Compilation finished in 5290 ms.
Running link step : cd /tmp/ltsmin1393991418471383877;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1393991418471383877;'/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' 'ShieldIIPsPT030BReachabilityFireability00==true'
[2022-06-03 14:15:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2022-06-03 14:15:43] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=0 took 1023 ms
[2022-06-03 14:15:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-01
[2022-06-03 14:15:44] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(SAT) depth K=0 took 510 ms
[2022-06-03 14:15:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-03
[2022-06-03 14:15:45] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-03(SAT) depth K=0 took 920 ms
[2022-06-03 14:15:45] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(UNSAT) depth K=2 took 3636 ms
[2022-06-03 14:15:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-04
[2022-06-03 14:15:45] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-04(SAT) depth K=0 took 843 ms
[2022-06-03 14:15:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2022-06-03 14:15:48] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=1 took 2794 ms
[2022-06-03 14:15:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-01
[2022-06-03 14:15:50] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(SAT) depth K=1 took 1946 ms
[2022-06-03 14:15:51] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-03(UNSAT) depth K=2 took 6619 ms
[2022-06-03 14:15:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-03
[2022-06-03 14:15:51] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-03(SAT) depth K=1 took 1217 ms
[2022-06-03 14:15:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-04
[2022-06-03 14:15:53] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-04(SAT) depth K=1 took 1662 ms
[2022-06-03 14:15:54] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-04(UNSAT) depth K=2 took 2511 ms
[2022-06-03 14:16:21] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=3 took 26969 ms
[2022-06-03 14:16:59] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(UNSAT) depth K=3 took 38398 ms
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :9.81247e+24 after 6.06703e+37
[2022-06-03 14:20:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2022-06-03 14:20:49] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=2 took 296072 ms
[2022-06-03 14:21:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-01
[2022-06-03 14:21:16] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(SAT) depth K=2 took 26953 ms
[2022-06-03 14:22:14] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-03(UNSAT) depth K=3 took 315073 ms
[2022-06-03 14:22:46] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-04(UNSAT) depth K=3 took 31502 ms
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1393991418471383877;'/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' 'ShieldIIPsPT030BReachabilityFireability00==true'
Running LTSmin : cd /tmp/ltsmin1393991418471383877;'/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' 'ShieldIIPsPT030BReachabilityFireability01==true'
[2022-06-03 14:37:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-03
[2022-06-03 14:37:09] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-03(SAT) depth K=2 took 953136 ms
Detected timeout of ITS tools.
[2022-06-03 14:39:20] [INFO ] Applying decomposition
[2022-06-03 14:39:20] [INFO ] Flatten gal took : 315 ms
[2022-06-03 14:39:20] [INFO ] Decomposing Gal with order
[2022-06-03 14:39:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:39:20] [INFO ] Removed a total of 645 redundant transitions.
[2022-06-03 14:39:21] [INFO ] Flatten gal took : 285 ms
[2022-06-03 14:39:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 473 labels/synchronizations in 128 ms.
[2022-06-03 14:39:21] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7912885655459542026.gal : 29 ms
[2022-06-03 14:39:21] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9511314318057141158.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/ReachabilityFireability7912885655459542026.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9511314318057141158.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability9511314318057141158.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1099
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1099 after 4.30013e+08
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :4.30013e+08 after 6.44978e+15
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :9.81247e+24 after 4.80547e+28
[2022-06-03 14:43:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-04
[2022-06-03 14:43:16] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-04(SAT) depth K=2 took 367002 ms
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1393991418471383877;'/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' 'ShieldIIPsPT030BReachabilityFireability01==true'
Running LTSmin : cd /tmp/ltsmin1393991418471383877;'/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' 'ShieldIIPsPT030BReachabilityFireability03==true'
[2022-06-03 14:59:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2022-06-03 14:59:04] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=3 took 947379 ms
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1393991418471383877;'/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' 'ShieldIIPsPT030BReachabilityFireability03==true'
Running LTSmin : cd /tmp/ltsmin1393991418471383877;'/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' 'ShieldIIPsPT030BReachabilityFireability04==true'
Detected timeout of ITS tools.
[2022-06-03 15:03:03] [INFO ] Flatten gal took : 138 ms
[2022-06-03 15:03:03] [INFO ] Input system was already deterministic with 898 transitions.
[2022-06-03 15:03:03] [INFO ] Transformed 928 places.
[2022-06-03 15:03:04] [INFO ] Transformed 898 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 15:03:04] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2316865949150648876.gal : 5 ms
[2022-06-03 15:03:04] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12654043263339858669.prop : 10 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/ReachabilityFireability2316865949150648876.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12654043263339858669.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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...365
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability12654043263339858669.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 11
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :11 after 26
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :26 after 78
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :78 after 474
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :474 after 5251
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :5251 after 29686
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :29686 after 137449
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :137449 after 140870
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :140870 after 2.33088e+06
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2.33088e+06 after 1.75904e+08
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.75904e+08 after 2.3134e+08
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2.3134e+08 after 7.09849e+09
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :7.09849e+09 after 8.70393e+10
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :8.70393e+10 after 1.54045e+12
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :1.54045e+12 after 7.40816e+14

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="ShieldIIPs-PT-030B"
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 ShieldIIPs-PT-030B, 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 r222-tall-165286024800127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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