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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.3K Apr 30 06:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 06:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 06:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 30 06:37 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.9K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 30 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 30 06:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 06:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 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 498K 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 ShieldRVs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654280607900

Running Version 202205111006
[2022-06-03 18:23:29] [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 18:23:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 18:23:29] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2022-06-03 18:23:29] [INFO ] Transformed 1603 places.
[2022-06-03 18:23:29] [INFO ] Transformed 1803 transitions.
[2022-06-03 18:23:29] [INFO ] Found NUPN structural information;
[2022-06-03 18:23:29] [INFO ] Parsed PT model containing 1603 places and 1803 transitions in 346 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 16) seen :9
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1803 rows 1603 cols
[2022-06-03 18:23:30] [INFO ] Computed 161 place invariants in 41 ms
[2022-06-03 18:23:31] [INFO ] [Real]Absence check using 161 positive place invariants in 64 ms returned sat
[2022-06-03 18:23:31] [INFO ] After 775ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 18:23:32] [INFO ] [Nat]Absence check using 161 positive place invariants in 62 ms returned sat
[2022-06-03 18:23:35] [INFO ] After 3219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-03 18:23:35] [INFO ] Deduced a trap composed of 37 places in 426 ms of which 6 ms to minimize.
[2022-06-03 18:23:36] [INFO ] Deduced a trap composed of 21 places in 658 ms of which 2 ms to minimize.
[2022-06-03 18:23:37] [INFO ] Deduced a trap composed of 23 places in 644 ms of which 2 ms to minimize.
[2022-06-03 18:23:38] [INFO ] Deduced a trap composed of 43 places in 618 ms of which 2 ms to minimize.
[2022-06-03 18:23:38] [INFO ] Deduced a trap composed of 25 places in 623 ms of which 1 ms to minimize.
[2022-06-03 18:23:39] [INFO ] Deduced a trap composed of 24 places in 691 ms of which 1 ms to minimize.
[2022-06-03 18:23:40] [INFO ] Deduced a trap composed of 29 places in 582 ms of which 2 ms to minimize.
[2022-06-03 18:23:41] [INFO ] Deduced a trap composed of 34 places in 587 ms of which 2 ms to minimize.
[2022-06-03 18:23:41] [INFO ] Deduced a trap composed of 23 places in 548 ms of which 2 ms to minimize.
[2022-06-03 18:23:42] [INFO ] Deduced a trap composed of 33 places in 538 ms of which 1 ms to minimize.
[2022-06-03 18:23:42] [INFO ] Deduced a trap composed of 41 places in 525 ms of which 2 ms to minimize.
[2022-06-03 18:23:43] [INFO ] Deduced a trap composed of 30 places in 529 ms of which 1 ms to minimize.
[2022-06-03 18:23:44] [INFO ] Deduced a trap composed of 47 places in 526 ms of which 1 ms to minimize.
[2022-06-03 18:23:44] [INFO ] Deduced a trap composed of 41 places in 570 ms of which 2 ms to minimize.
[2022-06-03 18:23:45] [INFO ] Deduced a trap composed of 37 places in 573 ms of which 1 ms to minimize.
[2022-06-03 18:23:46] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 1 ms to minimize.
[2022-06-03 18:23:46] [INFO ] Deduced a trap composed of 33 places in 467 ms of which 2 ms to minimize.
[2022-06-03 18:23:47] [INFO ] Deduced a trap composed of 33 places in 469 ms of which 1 ms to minimize.
[2022-06-03 18:23:47] [INFO ] Deduced a trap composed of 24 places in 448 ms of which 1 ms to minimize.
[2022-06-03 18:23:48] [INFO ] Deduced a trap composed of 20 places in 416 ms of which 1 ms to minimize.
[2022-06-03 18:23:48] [INFO ] Deduced a trap composed of 21 places in 425 ms of which 1 ms to minimize.
[2022-06-03 18:23:49] [INFO ] Deduced a trap composed of 30 places in 417 ms of which 1 ms to minimize.
[2022-06-03 18:23:49] [INFO ] Deduced a trap composed of 52 places in 412 ms of which 1 ms to minimize.
[2022-06-03 18:23:50] [INFO ] Deduced a trap composed of 27 places in 389 ms of which 1 ms to minimize.
[2022-06-03 18:23:50] [INFO ] Deduced a trap composed of 35 places in 389 ms of which 1 ms to minimize.
[2022-06-03 18:23:50] [INFO ] Deduced a trap composed of 35 places in 393 ms of which 1 ms to minimize.
[2022-06-03 18:23:51] [INFO ] Deduced a trap composed of 30 places in 417 ms of which 1 ms to minimize.
[2022-06-03 18:23:51] [INFO ] Deduced a trap composed of 55 places in 389 ms of which 1 ms to minimize.
[2022-06-03 18:23:52] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 0 ms to minimize.
[2022-06-03 18:23:52] [INFO ] Deduced a trap composed of 35 places in 385 ms of which 1 ms to minimize.
[2022-06-03 18:23:53] [INFO ] Deduced a trap composed of 37 places in 375 ms of which 1 ms to minimize.
[2022-06-03 18:23:53] [INFO ] Deduced a trap composed of 35 places in 372 ms of which 1 ms to minimize.
[2022-06-03 18:23:54] [INFO ] Deduced a trap composed of 45 places in 369 ms of which 1 ms to minimize.
[2022-06-03 18:23:54] [INFO ] Deduced a trap composed of 31 places in 381 ms of which 2 ms to minimize.
[2022-06-03 18:23:55] [INFO ] Deduced a trap composed of 29 places in 357 ms of which 1 ms to minimize.
[2022-06-03 18:23:55] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 1 ms to minimize.
[2022-06-03 18:23:55] [INFO ] Deduced a trap composed of 36 places in 368 ms of which 1 ms to minimize.
[2022-06-03 18:23:56] [INFO ] Deduced a trap composed of 39 places in 370 ms of which 1 ms to minimize.
[2022-06-03 18:23:56] [INFO ] Deduced a trap composed of 38 places in 354 ms of which 0 ms to minimize.
[2022-06-03 18:23:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 18:23:56] [INFO ] After 25233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 20344 ms.
Support contains 113 out of 1603 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 1603 transition count 1656
Reduce places removed 147 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 149 rules applied. Total rules applied 296 place count 1456 transition count 1654
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 298 place count 1454 transition count 1654
Performed 194 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 194 Pre rules applied. Total rules applied 298 place count 1454 transition count 1460
Deduced a syphon composed of 194 places in 7 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 3 with 388 rules applied. Total rules applied 686 place count 1260 transition count 1460
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 940 place count 1006 transition count 1206
Iterating global reduction 3 with 254 rules applied. Total rules applied 1194 place count 1006 transition count 1206
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 1194 place count 1006 transition count 1116
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 1374 place count 916 transition count 1116
Performed 264 Post agglomeration using F-continuation condition.Transition count delta: 264
Deduced a syphon composed of 264 places in 4 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 3 with 528 rules applied. Total rules applied 1902 place count 652 transition count 852
Partial Free-agglomeration rule applied 67 times.
Drop transitions removed 67 transitions
Iterating global reduction 3 with 67 rules applied. Total rules applied 1969 place count 652 transition count 852
Applied a total of 1969 rules in 491 ms. Remains 652 /1603 variables (removed 951) and now considering 852/1803 (removed 951) transitions.
Finished structural reductions, in 1 iterations. Remains : 652/1603 places, 852/1803 transitions.
Incomplete random walk after 1000000 steps, including 1649 resets, run finished after 12560 ms. (steps per millisecond=79 ) properties (out of 6) seen :4
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 154 resets, run finished after 3615 ms. (steps per millisecond=276 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 144 resets, run finished after 4536 ms. (steps per millisecond=220 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 852 rows 652 cols
[2022-06-03 18:24:38] [INFO ] Computed 161 place invariants in 6 ms
[2022-06-03 18:24:38] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:24:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 29 ms returned sat
[2022-06-03 18:24:39] [INFO ] After 659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:24:39] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2022-06-03 18:24:39] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2022-06-03 18:24:39] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2022-06-03 18:24:39] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2022-06-03 18:24:39] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2022-06-03 18:24:40] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2022-06-03 18:24:40] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:24:40] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2022-06-03 18:24:40] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-06-03 18:24:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1187 ms
[2022-06-03 18:24:40] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2022-06-03 18:24:40] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2022-06-03 18:24:40] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2022-06-03 18:24:41] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:24:41] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2022-06-03 18:24:41] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2022-06-03 18:24:41] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2022-06-03 18:24:41] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2022-06-03 18:24:41] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-06-03 18:24:41] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2022-06-03 18:24:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1067 ms
[2022-06-03 18:24:41] [INFO ] After 3138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 291 ms.
[2022-06-03 18:24:41] [INFO ] After 3578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1577 ms.
Support contains 69 out of 652 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 652/652 places, 852/852 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 652 transition count 849
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 649 transition count 849
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 649 transition count 842
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 642 transition count 842
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 641 transition count 841
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 641 transition count 841
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 60 place count 622 transition count 822
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 622 transition count 822
Applied a total of 67 rules in 101 ms. Remains 622 /652 variables (removed 30) and now considering 822/852 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 622/652 places, 822/852 transitions.
Incomplete random walk after 1000000 steps, including 1767 resets, run finished after 10481 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 172 resets, run finished after 3638 ms. (steps per millisecond=274 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 157 resets, run finished after 4573 ms. (steps per millisecond=218 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3735106 steps, run timeout after 54001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 3735106 steps, saw 707103 distinct states, run finished after 54003 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 822 rows 622 cols
[2022-06-03 18:25:56] [INFO ] Computed 161 place invariants in 10 ms
[2022-06-03 18:25:56] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:25:56] [INFO ] [Nat]Absence check using 161 positive place invariants in 23 ms returned sat
[2022-06-03 18:25:57] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:25:57] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2022-06-03 18:25:57] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2022-06-03 18:25:57] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2022-06-03 18:25:57] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2022-06-03 18:25:57] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2022-06-03 18:25:57] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2022-06-03 18:25:57] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2022-06-03 18:25:57] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2022-06-03 18:25:58] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2022-06-03 18:25:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 872 ms
[2022-06-03 18:25:58] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2022-06-03 18:25:58] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2022-06-03 18:25:58] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2022-06-03 18:25:59] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2022-06-03 18:25:59] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2022-06-03 18:25:59] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2022-06-03 18:25:59] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2022-06-03 18:25:59] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2022-06-03 18:25:59] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2022-06-03 18:25:59] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2022-06-03 18:25:59] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2022-06-03 18:26:00] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2022-06-03 18:26:00] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2022-06-03 18:26:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1929 ms
[2022-06-03 18:26:00] [INFO ] After 3662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 222 ms.
[2022-06-03 18:26:00] [INFO ] After 4021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1264 ms.
Support contains 69 out of 622 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 622/622 places, 822/822 transitions.
Applied a total of 0 rules in 33 ms. Remains 622 /622 variables (removed 0) and now considering 822/822 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 622/622 places, 822/822 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 622/622 places, 822/822 transitions.
Applied a total of 0 rules in 21 ms. Remains 622 /622 variables (removed 0) and now considering 822/822 (removed 0) transitions.
// Phase 1: matrix 822 rows 622 cols
[2022-06-03 18:26:01] [INFO ] Computed 161 place invariants in 12 ms
[2022-06-03 18:26:02] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 822 rows 622 cols
[2022-06-03 18:26:02] [INFO ] Computed 161 place invariants in 7 ms
[2022-06-03 18:26:02] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2022-06-03 18:26:02] [INFO ] Redundant transitions in 97 ms returned [689]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:26:02] [INFO ] Computed 161 place invariants in 4 ms
[2022-06-03 18:26:03] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 622/622 places, 821/822 transitions.
Applied a total of 0 rules in 22 ms. Remains 622 /622 variables (removed 0) and now considering 821/821 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 622/622 places, 821/822 transitions.
Incomplete random walk after 1000000 steps, including 1767 resets, run finished after 11013 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 173 resets, run finished after 3641 ms. (steps per millisecond=274 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 159 resets, run finished after 4591 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3930816 steps, run timeout after 57001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 3930816 steps, saw 740357 distinct states, run finished after 57001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:27:19] [INFO ] Computed 161 place invariants in 13 ms
[2022-06-03 18:27:19] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:27:19] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2022-06-03 18:27:20] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:27:20] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2022-06-03 18:27:20] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2022-06-03 18:27:20] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:27:20] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2022-06-03 18:27:20] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2022-06-03 18:27:21] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2022-06-03 18:27:21] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-06-03 18:27:21] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2022-06-03 18:27:21] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2022-06-03 18:27:21] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2022-06-03 18:27:21] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2022-06-03 18:27:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1293 ms
[2022-06-03 18:27:22] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-06-03 18:27:22] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2022-06-03 18:27:22] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2022-06-03 18:27:22] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2022-06-03 18:27:22] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2022-06-03 18:27:22] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2022-06-03 18:27:22] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2022-06-03 18:27:22] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2022-06-03 18:27:22] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2022-06-03 18:27:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1112 ms
[2022-06-03 18:27:23] [INFO ] After 3248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 330 ms.
[2022-06-03 18:27:23] [INFO ] After 3715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1170 ms.
Support contains 69 out of 622 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 622/622 places, 821/821 transitions.
Applied a total of 0 rules in 21 ms. Remains 622 /622 variables (removed 0) and now considering 821/821 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 622/622 places, 821/821 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 622/622 places, 821/821 transitions.
Applied a total of 0 rules in 20 ms. Remains 622 /622 variables (removed 0) and now considering 821/821 (removed 0) transitions.
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:27:24] [INFO ] Computed 161 place invariants in 4 ms
[2022-06-03 18:27:24] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:27:24] [INFO ] Computed 161 place invariants in 5 ms
[2022-06-03 18:27:25] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2022-06-03 18:27:25] [INFO ] Redundant transitions in 57 ms returned []
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:27:25] [INFO ] Computed 161 place invariants in 6 ms
[2022-06-03 18:27:26] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 622/622 places, 821/821 transitions.
Incomplete random walk after 1000000 steps, including 1766 resets, run finished after 10115 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 171 resets, run finished after 3625 ms. (steps per millisecond=275 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 158 resets, run finished after 4511 ms. (steps per millisecond=221 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3764129 steps, run timeout after 54001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 3764129 steps, saw 711960 distinct states, run finished after 54002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:28:38] [INFO ] Computed 161 place invariants in 13 ms
[2022-06-03 18:28:38] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:28:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2022-06-03 18:28:39] [INFO ] After 527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:28:39] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-06-03 18:28:39] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-06-03 18:28:39] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2022-06-03 18:28:39] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2022-06-03 18:28:39] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2022-06-03 18:28:39] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2022-06-03 18:28:39] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-06-03 18:28:40] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-06-03 18:28:40] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2022-06-03 18:28:40] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2022-06-03 18:28:40] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2022-06-03 18:28:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1185 ms
[2022-06-03 18:28:40] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-06-03 18:28:40] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:28:40] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2022-06-03 18:28:41] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2022-06-03 18:28:41] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2022-06-03 18:28:41] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2022-06-03 18:28:41] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2022-06-03 18:28:41] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2022-06-03 18:28:41] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2022-06-03 18:28:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1014 ms
[2022-06-03 18:28:41] [INFO ] After 3057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 331 ms.
[2022-06-03 18:28:41] [INFO ] After 3527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1214 ms.
Support contains 69 out of 622 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 622/622 places, 821/821 transitions.
Applied a total of 0 rules in 21 ms. Remains 622 /622 variables (removed 0) and now considering 821/821 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 622/622 places, 821/821 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 622/622 places, 821/821 transitions.
Applied a total of 0 rules in 24 ms. Remains 622 /622 variables (removed 0) and now considering 821/821 (removed 0) transitions.
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:28:43] [INFO ] Computed 161 place invariants in 4 ms
[2022-06-03 18:28:43] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:28:43] [INFO ] Computed 161 place invariants in 3 ms
[2022-06-03 18:28:44] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2022-06-03 18:28:44] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:28:44] [INFO ] Computed 161 place invariants in 3 ms
[2022-06-03 18:28:44] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 622/622 places, 821/821 transitions.
Applied a total of 0 rules in 19 ms. Remains 622 /622 variables (removed 0) and now considering 821/821 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:28:44] [INFO ] Computed 161 place invariants in 5 ms
[2022-06-03 18:28:44] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:28:44] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2022-06-03 18:28:45] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:28:45] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-06-03 18:28:45] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:28:45] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2022-06-03 18:28:45] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2022-06-03 18:28:46] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2022-06-03 18:28:46] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2022-06-03 18:28:46] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2022-06-03 18:28:46] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:28:46] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-06-03 18:28:46] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-06-03 18:28:46] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2022-06-03 18:28:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1244 ms
[2022-06-03 18:28:47] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:28:47] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2022-06-03 18:28:47] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2022-06-03 18:28:47] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2022-06-03 18:28:47] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-06-03 18:28:47] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-06-03 18:28:47] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2022-06-03 18:28:47] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2022-06-03 18:28:47] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2022-06-03 18:28:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1015 ms
[2022-06-03 18:28:48] [INFO ] After 3108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 313 ms.
[2022-06-03 18:28:48] [INFO ] After 3569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 18:28:48] [INFO ] Flatten gal took : 126 ms
[2022-06-03 18:28:48] [INFO ] Flatten gal took : 79 ms
[2022-06-03 18:28:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13816978010323009650.gal : 38 ms
[2022-06-03 18:28:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17996107451001675201.prop : 0 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/ReachabilityCardinality13816978010323009650.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17996107451001675201.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/ReachabilityCardinality17996107451001675201.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 110
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :110 after 326
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :326 after 2918
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2918 after 559874
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.30607e+10 after 2.21816e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.21816e+10 after 2.21816e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.21816e+10 after 2.21817e+10
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.21817e+10 after 2.21979e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.21979e+10 after 2.36161e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.36161e+10 after 1.62213e+11
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.62213e+11 after 1.26808e+13
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.26808e+13 after 4.8396e+16
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.8396e+16 after 6.81002e+20
Detected timeout of ITS tools.
[2022-06-03 18:29:03] [INFO ] Flatten gal took : 68 ms
[2022-06-03 18:29:03] [INFO ] Applying decomposition
[2022-06-03 18:29:03] [INFO ] Flatten gal took : 61 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/graph3791639741251647392.txt' '-o' '/tmp/graph3791639741251647392.bin' '-w' '/tmp/graph3791639741251647392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3791639741251647392.bin' '-l' '-1' '-v' '-w' '/tmp/graph3791639741251647392.weights' '-q' '0' '-e' '0.001'
[2022-06-03 18:29:04] [INFO ] Decomposing Gal with order
[2022-06-03 18:29:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:29:04] [INFO ] Removed a total of 998 redundant transitions.
[2022-06-03 18:29:04] [INFO ] Flatten gal took : 145 ms
[2022-06-03 18:29:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 798 labels/synchronizations in 52 ms.
[2022-06-03 18:29:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13463463712406538132.gal : 14 ms
[2022-06-03 18:29:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7127039593387195010.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/ReachabilityCardinality13463463712406538132.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7127039593387195010.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality7127039593387195010.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 57
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :57 after 7785
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :7785 after 6.71847e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7.21854e+13 after 1.19941e+15
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.19941e+15 after 1.15967e+38
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9220681674244483581
[2022-06-03 18:29:19] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9220681674244483581
Running compilation step : cd /tmp/ltsmin9220681674244483581;'/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 1574 ms.
Running link step : cd /tmp/ltsmin9220681674244483581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9220681674244483581;'/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' 'ShieldRVsPT040BReachabilityFireability02==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 18:29:34] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6301651158263914536
[2022-06-03 18:29:34] [INFO ] Computing symmetric may disable matrix : 821 transitions.
[2022-06-03 18:29:34] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:29:34] [INFO ] Computing symmetric may enable matrix : 821 transitions.
[2022-06-03 18:29:34] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:29:34] [INFO ] Applying decomposition
[2022-06-03 18:29:34] [INFO ] Flatten gal took : 121 ms
[2022-06-03 18:29:35] [INFO ] Flatten gal took : 137 ms
[2022-06-03 18:29:35] [INFO ] Input system was already deterministic with 821 transitions.
[2022-06-03 18:29:35] [INFO ] Computing Do-Not-Accords matrix : 821 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14900050026623822834.txt' '-o' '/tmp/graph14900050026623822834.bin' '-w' '/tmp/graph14900050026623822834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14900050026623822834.bin' '-l' '-1' '-v' '-w' '/tmp/graph14900050026623822834.weights' '-q' '0' '-e' '0.001'
[2022-06-03 18:29:35] [INFO ] Decomposing Gal with order
[2022-06-03 18:29:35] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:29:35] [INFO ] Built C files in 376ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6301651158263914536
Running compilation step : cd /tmp/ltsmin6301651158263914536;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-03 18:29:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:29:35] [INFO ] Removed a total of 1000 redundant transitions.
[2022-06-03 18:29:35] [INFO ] Flatten gal took : 122 ms
[2022-06-03 18:29:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 775 labels/synchronizations in 51 ms.
[2022-06-03 18:29:35] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5884877592808711389.gal : 14 ms
[2022-06-03 18:29:35] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6918328877623314025.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/ReachabilityFireability5884877592808711389.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6918328877623314025.prop' '--nowitness'
[2022-06-03 18:29:35] [INFO ] Ran tautology test, simplified 0 / 2 in 553 ms.

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
[2022-06-03 18:29:35] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=0 took 20 ms
[2022-06-03 18:29:35] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=0 took 2 ms
Loading property file /tmp/ReachabilityFireability6918328877623314025.prop.
[2022-06-03 18:29:35] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=1 took 12 ms
[2022-06-03 18:29:35] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=1 took 3 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 157
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :157 after 47961
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :47961 after 143865
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :143865 after 8.28611e+07
[2022-06-03 18:29:35] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=2 took 223 ms
[2022-06-03 18:29:35] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=2 took 12 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 821 rows 622 cols
[2022-06-03 18:29:36] [INFO ] Computed 161 place invariants in 15 ms
[2022-06-03 18:29:36] [INFO ] Computed 161 place invariants in 16 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :7.21854e+13 after 3.22065e+26
[2022-06-03 18:29:37] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=3 took 1196 ms
[2022-06-03 18:29:37] [INFO ] Proved 622 variables to be positive in 1564 ms
[2022-06-03 18:29:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-02
[2022-06-03 18:29:37] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(SAT) depth K=0 took 112 ms
[2022-06-03 18:29:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-10
[2022-06-03 18:29:37] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(SAT) depth K=0 took 55 ms
[2022-06-03 18:29:37] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=3 took 796 ms
Compilation finished in 3205 ms.
Running link step : cd /tmp/ltsmin6301651158263914536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6301651158263914536;'/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' 'ShieldRVsPT040BReachabilityFireability02==true'
[2022-06-03 18:29:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-02
[2022-06-03 18:29:38] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(SAT) depth K=1 took 920 ms
[2022-06-03 18:29:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-10
[2022-06-03 18:29:39] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(SAT) depth K=1 took 789 ms
[2022-06-03 18:30:08] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(UNSAT) depth K=4 took 30515 ms
[2022-06-03 18:30:35] [INFO ] BMC solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(UNSAT) depth K=4 took 27322 ms
[2022-06-03 18:44:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-02
[2022-06-03 18:44:57] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(SAT) depth K=2 took 917933 ms
[2022-06-03 18:49:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-10
[2022-06-03 18:49:35] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(SAT) depth K=2 took 278521 ms
Detected timeout of ITS tools.
[2022-06-03 18:51:37] [INFO ] Applying decomposition
[2022-06-03 18:51:37] [INFO ] Flatten gal took : 129 ms
[2022-06-03 18:51:37] [INFO ] Decomposing Gal with order
[2022-06-03 18:51:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:51:38] [INFO ] Removed a total of 998 redundant transitions.
[2022-06-03 18:51:38] [INFO ] Flatten gal took : 215 ms
[2022-06-03 18:51:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 798 labels/synchronizations in 104 ms.
[2022-06-03 18:51:38] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16746666461382254114.gal : 17 ms
[2022-06-03 18:51:38] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13351738713288754327.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/ReachabilityFireability16746666461382254114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13351738713288754327.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityFireability13351738713288754327.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 57
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :57 after 7785
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :7785 after 6.71847e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7.21854e+13 after 1.19941e+15
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.19941e+15 after 1.15967e+38
[2022-06-03 18:52:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-02
[2022-06-03 18:52:41] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-02(SAT) depth K=3 took 184965 ms
[2022-06-03 18:54:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-040B-ReachabilityFireability-10
[2022-06-03 18:54:01] [INFO ] KInduction solution for property ShieldRVs-PT-040B-ReachabilityFireability-10(SAT) depth K=3 took 80318 ms
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin6301651158263914536;'/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' 'ShieldRVsPT040BReachabilityFireability02==true'
Running LTSmin : cd /tmp/ltsmin6301651158263914536;'/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' 'ShieldRVsPT040BReachabilityFireability10==true'
Detected timeout of ITS tools.
[2022-06-03 19:13:40] [INFO ] Flatten gal took : 126 ms
[2022-06-03 19:13:40] [INFO ] Input system was already deterministic with 821 transitions.
[2022-06-03 19:13:40] [INFO ] Transformed 622 places.
[2022-06-03 19:13:40] [INFO ] Transformed 821 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 19:13:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7495817445584023177.gal : 27 ms
[2022-06-03 19:13:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4787408173442113475.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/ReachabilityFireability7495817445584023177.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4787408173442113475.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...364
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability4787408173442113475.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 137
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :137 after 585
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :585 after 9225
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9225 after 331785
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :331785 after 2.44532e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.44532e+06 after 2.613e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.613e+06 after 2.92558e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.92558e+06 after 3.42836e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.42836e+06 after 4.53428e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.53428e+06 after 1.28993e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.28993e+07 after 2.63386e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.63386e+09 after 4.30628e+09
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :4.30628e+09 after 5.07623e+09
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :5.07623e+09 after 1.23868e+12
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.23868e+12 after 2.2016e+12

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="ShieldRVs-PT-040B"
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 ShieldRVs-PT-040B, 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-165286025900847"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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