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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 5.9K Apr 29 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 29 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 18:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 29 18:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 29 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 29 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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 860K 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 ShieldIIPt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654270422717

Running Version 202205111006
[2022-06-03 15:33:43] [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 15:33:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:33:44] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2022-06-03 15:33:44] [INFO ] Transformed 3503 places.
[2022-06-03 15:33:44] [INFO ] Transformed 3253 transitions.
[2022-06-03 15:33:44] [INFO ] Found NUPN structural information;
[2022-06-03 15:33:44] [INFO ] Parsed PT model containing 3503 places and 3253 transitions in 450 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 16) seen :6
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 3253 rows 3503 cols
[2022-06-03 15:33:45] [INFO ] Computed 451 place invariants in 51 ms
[2022-06-03 15:33:47] [INFO ] [Real]Absence check using 451 positive place invariants in 183 ms returned sat
[2022-06-03 15:33:47] [INFO ] After 1529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-03 15:33:48] [INFO ] [Nat]Absence check using 451 positive place invariants in 181 ms returned sat
[2022-06-03 15:34:08] [INFO ] After 19294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-03 15:34:09] [INFO ] Deduced a trap composed of 25 places in 1153 ms of which 8 ms to minimize.
[2022-06-03 15:34:10] [INFO ] Deduced a trap composed of 13 places in 1099 ms of which 4 ms to minimize.
[2022-06-03 15:34:11] [INFO ] Deduced a trap composed of 18 places in 1097 ms of which 3 ms to minimize.
[2022-06-03 15:34:13] [INFO ] Deduced a trap composed of 21 places in 1116 ms of which 3 ms to minimize.
[2022-06-03 15:34:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 15:34:13] [INFO ] After 25939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 65025 ms.
Support contains 164 out of 3503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 712 transitions
Trivial Post-agglo rules discarded 712 transitions
Performed 712 trivial Post agglomeration. Transition count delta: 712
Iterating post reduction 0 with 712 rules applied. Total rules applied 712 place count 3503 transition count 2541
Reduce places removed 712 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 714 rules applied. Total rules applied 1426 place count 2791 transition count 2539
Reduce places removed 1 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 2 with 44 rules applied. Total rules applied 1470 place count 2790 transition count 2496
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1513 place count 2747 transition count 2496
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 215 Pre rules applied. Total rules applied 1513 place count 2747 transition count 2281
Deduced a syphon composed of 215 places in 6 ms
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 4 with 430 rules applied. Total rules applied 1943 place count 2532 transition count 2281
Discarding 327 places :
Symmetric choice reduction at 4 with 327 rule applications. Total rules 2270 place count 2205 transition count 1954
Iterating global reduction 4 with 327 rules applied. Total rules applied 2597 place count 2205 transition count 1954
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 120 Pre rules applied. Total rules applied 2597 place count 2205 transition count 1834
Deduced a syphon composed of 120 places in 14 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 2837 place count 2085 transition count 1834
Performed 784 Post agglomeration using F-continuation condition.Transition count delta: 784
Deduced a syphon composed of 784 places in 2 ms
Reduce places removed 784 places and 0 transitions.
Iterating global reduction 4 with 1568 rules applied. Total rules applied 4405 place count 1301 transition count 1050
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4607 place count 1200 transition count 1098
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 4645 place count 1181 transition count 1108
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4646 place count 1181 transition count 1107
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 4654 place count 1181 transition count 1099
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 4662 place count 1173 transition count 1099
Partial Free-agglomeration rule applied 47 times.
Drop transitions removed 47 transitions
Iterating global reduction 6 with 47 rules applied. Total rules applied 4709 place count 1173 transition count 1099
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 4710 place count 1173 transition count 1099
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4711 place count 1172 transition count 1098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4712 place count 1171 transition count 1098
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4712 place count 1171 transition count 1097
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4714 place count 1170 transition count 1097
Applied a total of 4714 rules in 1243 ms. Remains 1170 /3503 variables (removed 2333) and now considering 1097/3253 (removed 2156) transitions.
Finished structural reductions, in 1 iterations. Remains : 1170/3503 places, 1097/3253 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21732 ms. (steps per millisecond=46 ) properties (out of 10) seen :2
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 715058 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen 0
Interrupted Best-First random walk after 657511 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen 0
Interrupted Best-First random walk after 611547 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=122 ) properties seen 0
Interrupted Best-First random walk after 685469 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen 0
Interrupted Best-First random walk after 705214 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=141 ) properties seen 0
Interrupted Best-First random walk after 699667 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4715 ms. (steps per millisecond=212 ) properties (out of 8) seen :1
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 718894 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen 0
Running SMT prover for 7 properties.
// Phase 1: matrix 1097 rows 1170 cols
[2022-06-03 15:36:20] [INFO ] Computed 450 place invariants in 5 ms
[2022-06-03 15:36:21] [INFO ] [Real]Absence check using 450 positive place invariants in 75 ms returned sat
[2022-06-03 15:36:21] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 15:36:21] [INFO ] [Nat]Absence check using 450 positive place invariants in 75 ms returned sat
[2022-06-03 15:36:22] [INFO ] After 800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-03 15:36:22] [INFO ] State equation strengthened by 266 read => feed constraints.
[2022-06-03 15:36:23] [INFO ] After 932ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-06-03 15:36:23] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2022-06-03 15:36:23] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:36:24] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2022-06-03 15:36:24] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2022-06-03 15:36:24] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2022-06-03 15:36:24] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2022-06-03 15:36:24] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2022-06-03 15:36:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1258 ms
[2022-06-03 15:36:25] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-06-03 15:36:25] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:36:25] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2022-06-03 15:36:25] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2022-06-03 15:36:25] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:36:25] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2022-06-03 15:36:26] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2022-06-03 15:36:26] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2022-06-03 15:36:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1333 ms
[2022-06-03 15:36:26] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2022-06-03 15:36:26] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2022-06-03 15:36:26] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2022-06-03 15:36:27] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2022-06-03 15:36:27] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2022-06-03 15:36:27] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2022-06-03 15:36:27] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2022-06-03 15:36:27] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2022-06-03 15:36:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1329 ms
[2022-06-03 15:36:28] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2022-06-03 15:36:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-06-03 15:36:28] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2022-06-03 15:36:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2022-06-03 15:36:28] [INFO ] After 6133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 775 ms.
[2022-06-03 15:36:29] [INFO ] After 8162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 5185 ms.
Support contains 70 out of 1170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1170/1170 places, 1097/1097 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1170 transition count 1075
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 1148 transition count 1075
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 44 place count 1148 transition count 1053
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 88 place count 1126 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1125 transition count 1052
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1125 transition count 1052
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 204 place count 1068 transition count 995
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 234 place count 1053 transition count 1013
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 1053 transition count 1012
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 236 place count 1052 transition count 1012
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 241 place count 1052 transition count 1012
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 248 place count 1045 transition count 1005
Applied a total of 248 rules in 341 ms. Remains 1045 /1170 variables (removed 125) and now considering 1005/1097 (removed 92) transitions.
Finished structural reductions, in 1 iterations. Remains : 1045/1170 places, 1005/1097 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20881 ms. (steps per millisecond=47 ) properties (out of 7) seen :1
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 727703 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=145 ) properties seen 0
Interrupted Best-First random walk after 667914 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen 0
Interrupted Best-First random walk after 662197 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=132 ) properties seen 0
Interrupted Best-First random walk after 736663 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 0
Interrupted Best-First random walk after 692441 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen 0
Interrupted Best-First random walk after 711320 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen 0
Running SMT prover for 6 properties.
// Phase 1: matrix 1005 rows 1045 cols
[2022-06-03 15:37:25] [INFO ] Computed 450 place invariants in 3 ms
[2022-06-03 15:37:26] [INFO ] [Real]Absence check using 450 positive place invariants in 63 ms returned sat
[2022-06-03 15:37:26] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 15:37:26] [INFO ] [Nat]Absence check using 450 positive place invariants in 63 ms returned sat
[2022-06-03 15:37:27] [INFO ] After 611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 15:37:27] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-03 15:37:27] [INFO ] After 337ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-03 15:37:27] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2022-06-03 15:37:27] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2022-06-03 15:37:27] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2022-06-03 15:37:27] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 5 ms to minimize.
[2022-06-03 15:37:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 574 ms
[2022-06-03 15:37:28] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2022-06-03 15:37:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-06-03 15:37:28] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2022-06-03 15:37:28] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2022-06-03 15:37:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2022-06-03 15:37:28] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2022-06-03 15:37:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-06-03 15:37:29] [INFO ] After 1896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 308 ms.
[2022-06-03 15:37:29] [INFO ] After 3163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 4864 ms.
Support contains 69 out of 1045 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1045/1045 places, 1005/1005 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1045 transition count 1004
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1044 transition count 1004
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1043 transition count 1005
Applied a total of 4 rules in 55 ms. Remains 1043 /1045 variables (removed 2) and now considering 1005/1005 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1045 places, 1005/1005 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20835 ms. (steps per millisecond=47 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 729718 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=145 ) properties seen 0
Interrupted Best-First random walk after 669251 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen 0
Interrupted Best-First random walk after 661162 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=132 ) properties seen 0
Interrupted Best-First random walk after 734821 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=146 ) properties seen 0
Interrupted Best-First random walk after 738422 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 0
Interrupted Best-First random walk after 739510 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 1
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 1005 rows 1043 cols
[2022-06-03 15:38:25] [INFO ] Computed 450 place invariants in 6 ms
[2022-06-03 15:38:25] [INFO ] [Real]Absence check using 450 positive place invariants in 65 ms returned sat
[2022-06-03 15:38:25] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-03 15:38:25] [INFO ] [Nat]Absence check using 450 positive place invariants in 62 ms returned sat
[2022-06-03 15:38:26] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-03 15:38:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-03 15:38:26] [INFO ] After 297ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-03 15:38:26] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2022-06-03 15:38:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-06-03 15:38:26] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2022-06-03 15:38:27] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2022-06-03 15:38:27] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2022-06-03 15:38:27] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2022-06-03 15:38:27] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2022-06-03 15:38:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 635 ms
[2022-06-03 15:38:27] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-06-03 15:38:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-06-03 15:38:27] [INFO ] After 1582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 261 ms.
[2022-06-03 15:38:28] [INFO ] After 2718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 4797 ms.
Support contains 67 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1043/1043 places, 1005/1005 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1043 transition count 1004
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1042 transition count 1004
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1041 transition count 1003
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 1040 transition count 1004
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 1039 transition count 1003
Applied a total of 7 rules in 93 ms. Remains 1039 /1043 variables (removed 4) and now considering 1003/1005 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1039/1043 places, 1003/1005 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20637 ms. (steps per millisecond=48 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 734367 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=146 ) properties seen 0
Interrupted Best-First random walk after 681803 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=136 ) properties seen 0
Interrupted Best-First random walk after 645393 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=129 ) properties seen 0
Interrupted Best-First random walk after 668273 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen 0
Interrupted Best-First random walk after 695745 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen 0
Probabilistic random walk exhausted memory after 4418030 steps, saw 3094713 distinct states, run finished after 126936 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1003 rows 1039 cols
[2022-06-03 15:41:25] [INFO ] Computed 450 place invariants in 7 ms
[2022-06-03 15:41:25] [INFO ] [Real]Absence check using 450 positive place invariants in 61 ms returned sat
[2022-06-03 15:41:25] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-03 15:41:26] [INFO ] [Nat]Absence check using 450 positive place invariants in 65 ms returned sat
[2022-06-03 15:41:26] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-03 15:41:26] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-03 15:41:27] [INFO ] After 280ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-03 15:41:27] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2022-06-03 15:41:27] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2022-06-03 15:41:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2022-06-03 15:41:27] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2022-06-03 15:41:27] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2022-06-03 15:41:27] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2022-06-03 15:41:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 470 ms
[2022-06-03 15:41:28] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-06-03 15:41:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-06-03 15:41:28] [INFO ] After 1486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 258 ms.
[2022-06-03 15:41:28] [INFO ] After 2667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 4087 ms.
Support contains 67 out of 1039 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1039/1039 places, 1003/1003 transitions.
Applied a total of 0 rules in 26 ms. Remains 1039 /1039 variables (removed 0) and now considering 1003/1003 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1039/1039 places, 1003/1003 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1039/1039 places, 1003/1003 transitions.
Applied a total of 0 rules in 27 ms. Remains 1039 /1039 variables (removed 0) and now considering 1003/1003 (removed 0) transitions.
// Phase 1: matrix 1003 rows 1039 cols
[2022-06-03 15:41:32] [INFO ] Computed 450 place invariants in 3 ms
[2022-06-03 15:41:33] [INFO ] Implicit Places using invariants in 504 ms returned [1027]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 506 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1038/1039 places, 1003/1003 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1037 transition count 1002
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1037 transition count 1002
Applied a total of 2 rules in 48 ms. Remains 1037 /1038 variables (removed 1) and now considering 1002/1003 (removed 1) transitions.
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:41:33] [INFO ] Computed 449 place invariants in 2 ms
[2022-06-03 15:41:33] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:41:33] [INFO ] Computed 449 place invariants in 3 ms
[2022-06-03 15:41:34] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-03 15:41:35] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1037/1039 places, 1002/1003 transitions.
Finished structural reductions, in 2 iterations. Remains : 1037/1039 places, 1002/1003 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20894 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 707881 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=141 ) properties seen 0
Interrupted Best-First random walk after 671052 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=134 ) properties seen 0
Interrupted Best-First random walk after 655907 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen 0
Interrupted Best-First random walk after 703712 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=140 ) properties seen 0
Interrupted Best-First random walk after 712372 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen 0
Probabilistic random walk exhausted memory after 4468250 steps, saw 3125874 distinct states, run finished after 128295 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:44:29] [INFO ] Computed 449 place invariants in 3 ms
[2022-06-03 15:44:29] [INFO ] [Real]Absence check using 449 positive place invariants in 64 ms returned sat
[2022-06-03 15:44:29] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-03 15:44:29] [INFO ] [Nat]Absence check using 449 positive place invariants in 64 ms returned sat
[2022-06-03 15:44:30] [INFO ] After 570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-03 15:44:30] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-03 15:44:30] [INFO ] After 274ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-03 15:44:31] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 3 ms to minimize.
[2022-06-03 15:44:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-06-03 15:44:31] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 4 ms to minimize.
[2022-06-03 15:44:31] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2022-06-03 15:44:31] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2022-06-03 15:44:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 427 ms
[2022-06-03 15:44:31] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-06-03 15:44:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-06-03 15:44:31] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2022-06-03 15:44:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-06-03 15:44:32] [INFO ] After 1478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 254 ms.
[2022-06-03 15:44:32] [INFO ] After 2631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 4510 ms.
Support contains 67 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1037/1037 places, 1002/1002 transitions.
Applied a total of 0 rules in 47 ms. Remains 1037 /1037 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1037/1037 places, 1002/1002 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1037/1037 places, 1002/1002 transitions.
Applied a total of 0 rules in 41 ms. Remains 1037 /1037 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:44:36] [INFO ] Computed 449 place invariants in 2 ms
[2022-06-03 15:44:37] [INFO ] Implicit Places using invariants in 484 ms returned []
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:44:37] [INFO ] Computed 449 place invariants in 9 ms
[2022-06-03 15:44:37] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-03 15:44:38] [INFO ] Implicit Places using invariants and state equation in 1465 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
[2022-06-03 15:44:38] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:44:38] [INFO ] Computed 449 place invariants in 6 ms
[2022-06-03 15:44:39] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1037/1037 places, 1002/1002 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21016 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 720026 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen 0
Interrupted Best-First random walk after 670637 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=134 ) properties seen 0
Interrupted Best-First random walk after 659261 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen 0
Interrupted Best-First random walk after 701367 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=140 ) properties seen 0
Interrupted Best-First random walk after 695995 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen 0
Probabilistic random walk exhausted memory after 4468029 steps, saw 3125696 distinct states, run finished after 129282 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:47:34] [INFO ] Computed 449 place invariants in 4 ms
[2022-06-03 15:47:35] [INFO ] [Real]Absence check using 449 positive place invariants in 65 ms returned sat
[2022-06-03 15:47:35] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-03 15:47:35] [INFO ] [Nat]Absence check using 449 positive place invariants in 63 ms returned sat
[2022-06-03 15:47:36] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-03 15:47:36] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-03 15:47:36] [INFO ] After 282ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-03 15:47:36] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2022-06-03 15:47:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-06-03 15:47:36] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2022-06-03 15:47:36] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2022-06-03 15:47:36] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2022-06-03 15:47:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 432 ms
[2022-06-03 15:47:37] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-06-03 15:47:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-06-03 15:47:37] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2022-06-03 15:47:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-06-03 15:47:37] [INFO ] After 1494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 275 ms.
[2022-06-03 15:47:37] [INFO ] After 2688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 4609 ms.
Support contains 67 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1037/1037 places, 1002/1002 transitions.
Applied a total of 0 rules in 28 ms. Remains 1037 /1037 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1037/1037 places, 1002/1002 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1037/1037 places, 1002/1002 transitions.
Applied a total of 0 rules in 28 ms. Remains 1037 /1037 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:47:42] [INFO ] Computed 449 place invariants in 2 ms
[2022-06-03 15:47:42] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:47:43] [INFO ] Computed 449 place invariants in 8 ms
[2022-06-03 15:47:43] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-03 15:47:44] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
[2022-06-03 15:47:44] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:47:44] [INFO ] Computed 449 place invariants in 5 ms
[2022-06-03 15:47:45] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1037/1037 places, 1002/1002 transitions.
Graph (complete) has 2702 edges and 1037 vertex of which 1036 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 0 with 102 rules applied. Total rules applied 103 place count 1036 transition count 1002
Applied a total of 103 rules in 56 ms. Remains 1036 /1037 variables (removed 1) and now considering 1002/1002 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1002 rows 1036 cols
[2022-06-03 15:47:45] [INFO ] Computed 448 place invariants in 4 ms
[2022-06-03 15:47:45] [INFO ] [Real]Absence check using 448 positive place invariants in 65 ms returned sat
[2022-06-03 15:47:45] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-03 15:47:45] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2022-06-03 15:47:46] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-03 15:47:46] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-03 15:47:46] [INFO ] After 377ms SMT Verify possible using 95 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-03 15:47:46] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2022-06-03 15:47:47] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 21 ms to minimize.
[2022-06-03 15:47:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2022-06-03 15:47:47] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2022-06-03 15:47:47] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2022-06-03 15:47:47] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
[2022-06-03 15:47:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 463 ms
[2022-06-03 15:47:47] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2022-06-03 15:47:47] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2022-06-03 15:47:48] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2022-06-03 15:47:48] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-06-03 15:47:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 588 ms
[2022-06-03 15:47:48] [INFO ] After 2117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 298 ms.
[2022-06-03 15:47:48] [INFO ] After 3350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-06-03 15:47:49] [INFO ] Flatten gal took : 131 ms
[2022-06-03 15:47:49] [INFO ] Flatten gal took : 77 ms
[2022-06-03 15:47:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4732900404506167162.gal : 28 ms
[2022-06-03 15:47:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18002563892894135713.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/ReachabilityCardinality4732900404506167162.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18002563892894135713.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality18002563892894135713.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :27 after 108
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :108 after 972
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :972 after 11664
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :11664 after 3.77914e+06
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :3.77914e+06 after 4.83466e+11
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-10 is true.
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-06 is true.
Detected timeout of ITS tools.
[2022-06-03 15:48:04] [INFO ] Flatten gal took : 61 ms
[2022-06-03 15:48:04] [INFO ] Applying decomposition
[2022-06-03 15:48:04] [INFO ] Flatten gal took : 57 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/graph15341578236001946078.txt' '-o' '/tmp/graph15341578236001946078.bin' '-w' '/tmp/graph15341578236001946078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15341578236001946078.bin' '-l' '-1' '-v' '-w' '/tmp/graph15341578236001946078.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:48:04] [INFO ] Decomposing Gal with order
[2022-06-03 15:48:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:48:04] [INFO ] Removed a total of 556 redundant transitions.
[2022-06-03 15:48:04] [INFO ] Flatten gal took : 123 ms
[2022-06-03 15:48:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 31 ms.
[2022-06-03 15:48:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4197714211912961201.gal : 13 ms
[2022-06-03 15:48:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11656956254389137838.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/ReachabilityCardinality4197714211912961201.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11656956254389137838.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/ReachabilityCardinality11656956254389137838.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 9
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :9 after 9
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :9 after 27
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :27 after 27
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :27 after 108
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :108 after 314928
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :6.48855e+14 after 7.02682e+31
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2019792330317270051
[2022-06-03 15:48:20] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2019792330317270051
Running compilation step : cd /tmp/ltsmin2019792330317270051;'/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 1940 ms.
Running link step : cd /tmp/ltsmin2019792330317270051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2019792330317270051;'/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' 'ShieldIIPtPT050BReachabilityFireability00==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 15:48:35] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2970099932726522327
[2022-06-03 15:48:35] [INFO ] Computing symmetric may disable matrix : 1002 transitions.
[2022-06-03 15:48:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:48:35] [INFO ] Computing symmetric may enable matrix : 1002 transitions.
[2022-06-03 15:48:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:48:35] [INFO ] Applying decomposition
[2022-06-03 15:48:35] [INFO ] Flatten gal took : 80 ms
[2022-06-03 15:48:35] [INFO ] Flatten gal took : 192 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/graph7653737318569922725.txt' '-o' '/tmp/graph7653737318569922725.bin' '-w' '/tmp/graph7653737318569922725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7653737318569922725.bin' '-l' '-1' '-v' '-w' '/tmp/graph7653737318569922725.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:48:35] [INFO ] Decomposing Gal with order
[2022-06-03 15:48:35] [INFO ] Input system was already deterministic with 1002 transitions.
[2022-06-03 15:48:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:48:35] [INFO ] Computing Do-Not-Accords matrix : 1002 transitions.
[2022-06-03 15:48:35] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:48:35] [INFO ] Built C files in 454ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2970099932726522327
Running compilation step : cd /tmp/ltsmin2970099932726522327;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' '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 15:48:35] [INFO ] Removed a total of 877 redundant transitions.
[2022-06-03 15:48:35] [INFO ] Flatten gal took : 66 ms
[2022-06-03 15:48:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 12 ms.
[2022-06-03 15:48:35] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4147610207298691146.gal : 8 ms
[2022-06-03 15:48:35] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6573021944895269981.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/ReachabilityFireability4147610207298691146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6573021944895269981.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/ReachabilityFireability6573021944895269981.prop.
[2022-06-03 15:48:36] [INFO ] Ran tautology test, simplified 0 / 5 in 589 ms.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 9
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :9 after 9
[2022-06-03 15:48:36] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-00(UNSAT) depth K=0 took 35 ms
[2022-06-03 15:48:36] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-03(UNSAT) depth K=0 took 1 ms
[2022-06-03 15:48:36] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=0 took 1 ms
[2022-06-03 15:48:36] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-06(UNSAT) depth K=0 took 1 ms
[2022-06-03 15:48:36] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-10(UNSAT) depth K=0 took 1 ms
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :9 after 34992
[2022-06-03 15:48:36] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-00(UNSAT) depth K=1 took 17 ms
[2022-06-03 15:48:36] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-03(UNSAT) depth K=1 took 3 ms
[2022-06-03 15:48:36] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=1 took 10 ms
[2022-06-03 15:48:36] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-06(UNSAT) depth K=1 took 11 ms
[2022-06-03 15:48:36] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-10(UNSAT) depth K=1 took 16 ms
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :7.27233e+14 after 1.5333e+25
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1002 rows 1037 cols
[2022-06-03 15:48:36] [INFO ] Computed 449 place invariants in 2 ms
[2022-06-03 15:48:36] [INFO ] Computed 449 place invariants in 15 ms
[2022-06-03 15:48:37] [INFO ] Proved 1037 variables to be positive in 1370 ms
[2022-06-03 15:48:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-00
[2022-06-03 15:48:38] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-00(SAT) depth K=0 took 278 ms
[2022-06-03 15:48:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-03
[2022-06-03 15:48:38] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-03(SAT) depth K=0 took 265 ms
[2022-06-03 15:48:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-05
[2022-06-03 15:48:38] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-05(SAT) depth K=0 took 265 ms
[2022-06-03 15:48:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-06
[2022-06-03 15:48:38] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-06(SAT) depth K=0 took 171 ms
Compilation finished in 3361 ms.
Running link step : cd /tmp/ltsmin2970099932726522327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin2970099932726522327;'/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' 'ShieldIIPtPT050BReachabilityFireability00==true'
[2022-06-03 15:48:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-10
[2022-06-03 15:48:39] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-10(SAT) depth K=0 took 248 ms
[2022-06-03 15:48:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-00
[2022-06-03 15:48:40] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-00(SAT) depth K=1 took 1380 ms
[2022-06-03 15:48:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-03
[2022-06-03 15:48:41] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-03(SAT) depth K=1 took 1145 ms
[2022-06-03 15:48:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-05
[2022-06-03 15:48:42] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-05(SAT) depth K=1 took 1117 ms
[2022-06-03 15:48:45] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-00(UNSAT) depth K=2 took 8849 ms
[2022-06-03 15:48:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-06
[2022-06-03 15:48:45] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-06(SAT) depth K=1 took 2906 ms
[2022-06-03 15:48:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-10
[2022-06-03 15:48:49] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-10(SAT) depth K=1 took 3367 ms
[2022-06-03 15:49:06] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-03(UNSAT) depth K=2 took 21700 ms
[2022-06-03 15:49:31] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=2 took 24632 ms
[2022-06-03 15:49:57] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-06(UNSAT) depth K=2 took 25882 ms
[2022-06-03 15:50:24] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-10(UNSAT) depth K=2 took 27053 ms
[2022-06-03 15:53:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-00
[2022-06-03 15:53:17] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-00(SAT) depth K=2 took 268425 ms
[2022-06-03 15:58:47] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-00(UNSAT) depth K=3 took 502929 ms
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin2970099932726522327;'/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' 'ShieldIIPtPT050BReachabilityFireability00==true'
Running LTSmin : cd /tmp/ltsmin2970099932726522327;'/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' 'ShieldIIPtPT050BReachabilityFireability03==true'
[2022-06-03 16:04:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-03
[2022-06-03 16:04:59] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-03(SAT) depth K=2 took 701609 ms
[2022-06-03 16:06:13] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-03(UNSAT) depth K=3 took 445909 ms
[2022-06-03 16:08:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-05
[2022-06-03 16:08:39] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-05(SAT) depth K=2 took 220255 ms
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin2970099932726522327;'/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' 'ShieldIIPtPT050BReachabilityFireability03==true'
Running LTSmin : cd /tmp/ltsmin2970099932726522327;'/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' 'ShieldIIPtPT050BReachabilityFireability05==true'
Detected timeout of ITS tools.
[2022-06-03 16:13:34] [INFO ] Applying decomposition
[2022-06-03 16:13:34] [INFO ] Flatten gal took : 163 ms
[2022-06-03 16:13:34] [INFO ] Decomposing Gal with order
[2022-06-03 16:13:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:13:34] [INFO ] Could not find partition element corresponding to p3455 in partition [p50, p52],[p74, p76],[p103, p108],[p71, p73],[p81, p86],[p115, p120],[p61, p63],[p64, p67, p68, p69, p70, p92, p96],[p140, p142],[p150, p155],[p184, p189],[p130, p132],[p133, p134, p136, p137, p138, p139],[p158, p161],[p143, p145],[p169, p172, p175, p177],[p199, p201],[p202, p205, p206],[p207, p208],[p219, p224],[p230, p234],[p238, p241, p243, p246],[p237, p248],[p209, p211],[p250, p253, p256, p258],[p278, p280],[p285, p288, p293],[p322, p327],[p268, p270],[p271, p274, p275],[p276, p277],[p299, p303],[p212, p214],[p281, p283],[p306, p316],[p310, p311],[p307, p315],[p337, p339],[p340, p342, p343, p344, p345, p346, p368, p372],[p350, p352],[p376, p382],[p379, p381, p384],[p347, p349],[p357, p362],[p391, p396],[p416, p418],[p419, p421],[p448, p453],[p460, p465],[p406, p408],[p409, p412, p413, p414, p415, p437, p441],[p426, p431],[p485, p487],[p495, p500],[p529, p534],[p488, p490],[p517, p522],[p557, p559],[p582, p586],[p470, p471],[p475, p477],[p478, p481, p482, p483, p484, p506, p509, p510],[p544, p546],[p547, p550, p551, p552, p553, p575, p579],[p554, p556],[p564, p569],[p598, p603],[p613, p615],[p623, p625],[p633, p638],[p667, p672],[p626, p628],[p655, p660],[p616, p619, p620, p621, p622],[p644, p646, p647, p648],[p692, p694],[p702, p707],[p695, p697],[p724, p729],[p735, p736, p741],[p682, p684],[p685, p688, p689, p690, p691, p713, p717],[p761, p763],[p771, p776],[p805, p810],[p751, p753],[p754, p757, p758, p759, p760, p782, p786],[p764, p766],[p793, p798],[p820, p822],[p823, p826, p827, p828, p829, p851, p855],[p830, p832],[p840, p845],[p874, p879],[p833, p835],[p862, p867],[p889, p891],[p899, p901],[p943, p948],[p909, p914],[p892, p895, p896, p897, p898, p920, p924],[p968, p970],[p902, p904],[p931, p936],[p958, p960],[p1008, p1012, p1016, p1017],[p961, p964, p965],[p975, p978, p980, p983],[p989, p993],[p966, p967],[p996, p1000, p1005],[p1027, p1029],[p1030, p1033, p1034, p1035, p1036, p1055, p1058],[p1037, p1039],[p1040, p1042],[p1078, p1079, p1086],[p971, p973],[p1069, p1074],[p1047, p1052],[p1106, p1108],[p1091, p1092],[p1109, p1111],[p1099, p1102, p1103, p1104, p1105, p1127, p1131],[p1138, p1143],[p1096, p1098, p1150, p1155],[p1207, p1212],[p1116, p1121],[p1157, p1159],[p1168, p1171, p1172, p1173, p1174, p1196, p1200],[p1175, p1177],[p1185, p1190],[p1165, p1167, p1219, p1224],[p1178, p1180],[p1247, p1249],[p1276, p1281],[p1234, p1236],[p1237, p1240, p1241, p1242, p1243, p1265, p1269],[p1244, p1246],[p1254, p1259],[p1288, p1293],[p1303, p1305],[p1306, p1309, p1310, p1311, p1312, p1334, p1338],[p1313, p1315],[p1323, p1328],[p1353, p1357, p1362, p1363],[p1316, p1318],[p1345, p1350],[p1372, p1374],[p1375, p1378, p1379, p1380, p1381, p1400, p1403, p1407],[p1382, p1384],[p1385, p1387],[p1392, p1397],[p1414, p1419],[p1426, p1431],[p1438, p1451, p1453],[p1454, p1455, p1456],[p1461, p1462, p1463, p1466],[p1444, p1447, p1448, p1449, p1450, p1472, p1476],[p1483, p1488],[p1441, p1443, p1495, p1500],[p1520, p1522],[p1530, p1535],[p1510, p1512],[p1523, p1525],[p1513, p1516, p1517, p1518, p1519, p1541, p1545],[p1552, p1553, p1557],[p1564, p1569],[p1579, p1581],[p1582, p1585, p1586, p1587, p1588, p1610, p1614],[p1589, p1591],[p1599, p1604],[p1633, p1638],[p1592, p1594],[p1621, p1626],[p1648, p1650],[p1651, p1654, p1655, p1656, p1657, p1682, p1683],[p1661, p1662, p1663],[p1690, p1695],[p1702, p1707],[p1658, p1660],[p1668, p1672, p1673],[p1709, p1711],[p1720, p1723, p1724, p1725, p1726, p1748, p1752],[p1727, p1729],[p1730, p1731, p1732],[p1737, p1742],[p1759, p1764],[p1717, p1719, p1771, p1776],[p1786, p1788],[p1789, p1792, p1793],[p1794, p1795],[p1814, p1817],[p1799, p1801],[p1824, p1835],[p1825, p1826, p1833],[p1796, p1798],[p1802, p1806, p1811, p1812],[p1840, p1845],[p1865, p1867],[p1875, p1880],[p1909, p1914],[p1868, p1870],[p1897, p1902],[p1855, p1857],[p1858, p1861, p1862, p1863, p1864, p1886, p1890],[p1934, p1936],[p1944, p1949],[p1978, p1983],[p1937, p1939],[p1966, p1971],[p1924, p1926],[p1927, p1930, p1931, p1932, p1933, p1952, p1955],[p2003, p2005],[p2016, p2017, p2018],[p1993, p1995],[p2006, p2008],[p1996, p1999, p2000, p2001, p2002, p2024, p2028],[p2035, p2040],[p2047, p2052],[p2075, p2077],[p2104, p2109],[p2062, p2064],[p2072, p2074],[p2082, p2087],[p2065, p2068, p2069, p2070, p2071, p2093, p2095, p2096, p2097],[p2116, p2121],[p2144, p2146],[p2173, p2178],[p2141, p2143],[p2151, p2156],[p2185, p2190],[p2131, p2133],[p2134, p2137, p2138, p2139, p2140, p2162, p2166],[p2200, p2202],[p2203, p2206, p2207, p2208, p2209, p2228, p2231, p2235],[p2213, p2215],[p2242, p2247],[p2210, p2212],[p2220, p2225],[p2254, p2259],[p2279, p2281],[p2285, p2289],[p2282, p2284],[p2311, p2316],[p2323, p2328],[p2269, p2271],[p2272, p2275, p2276, p2277, p2278, p2303, p2304],[p2341, p2343, p2344, p2345, p2346, p2347],[p2369, p2371, p2372, p2373],[p2338, p2340],[p2348, p2350],[p2358, p2363],[p2392, p2397],[p2351, p2353],[p2376, p2380, p2385],[p2407, p2409],[p2410, p2413, p2414, p2415, p2416, p2438, p2442],[p2417, p2419],[p2427, p2432],[p2461, p2466],[p2420, p2422],[p2449, p2454],[p2476, p2478],[p2486, p2488],[p2496, p2501],[p2530, p2535],[p2504, p2513],[p2479, p2482, p2483, p2484, p2485, p2507, p2511],[p2489, p2491],[p2518, p2523],[p2545, p2547],[p2548, p2551, p2552, p2553, p2554, p2577, p2580],[p2555, p2557],[p2558, p2560],[p2587, p2592],[p2599, p2604],[p2606, p2607],[p2614, p2616],[p2617, p2620, p2621, p2622, p2623, p2642, p2645, p2649],[p2565, p2570],[p2624, p2626],[p2634, p2639],[p2668, p2673],[p2683, p2685],[p2689, p2690],[p2686, p2691, p2692],[p2711, p2714, p2718, p2720],[p2627, p2629],[p2652, p2656, p2661, p2663],[p2696, p2698],[p2725, p2730],[p2693, p2695],[p2700, p2703, p2708],[p2737, p2742],[p2762, p2764],[p2769, p2777],[p2765, p2767],[p2790, p2794, p2799, p2800],[p2806, p2811],[p2863, p2868],[p2752, p2754],[p2755, p2758, p2759, p2760, p2761, p2783, p2787],[p2821, p2823],[p2831, p2833],[p2834, p2836],[p2872, p2875, p2878, p2880],[p2893, p2895, p2898, p2899],[p2896, p2897],[p2918, p2921, p2925, p2926],[p2841, p2846],[p2824, p2827, p2828, p2829, p2830, p2852, p2854, p2855, p2856],[p2900, p2902],[p2906, p2910, p2915],[p2890, p2892],[p2903, p2905],[p2932, p2937],[p2944, p2949],[p2959, p2961],[p2969, p2971],[p2972, p2974],[p2979, p2984],[p2962, p2965, p2966, p2967, p2968, p2990, p2994],[p2999, p3001, p3006],[p3009, p3013, p3018],[p3028, p3030],[p3044, p3048],[p3031, p3034, p3035, p3036, p3037, p3056, p3059, p3063],[p3070, p3075],[p3038, p3040],[p3041, p3043],[p3082, p3083],[p3085, p3086, p3087],[p3097, p3099],[p3100, p3103, p3104, p3105, p3106, p3128, p3132],[p3107, p3109],[p3118, p3122],[p3151, p3156],[p3110, p3112],[p3139, p3144],[p3166, p3168],[p3169, p3172, p3173],[p3174, p3175],[p3197, p3201],[p3179, p3181],[p3205, p3213],[p3176, p3178],[p3186, p3191],[p3220, p3225],[p3235, p3237],[p3238, p3241, p3242, p3243, p3244, p3265, p3267, p3270],[p3245, p3247],[p3248, p3250],[p3255, p3260],[p3277, p3282],[p3289, p3294],[p3314, p3316],[p3325, p3329],[p3358, p3363],[p3304, p3306],[p3307, p3310, p3311],[p3312, p3313],[p3334, p3335, p3339],[p3317, p3319],[p3343, p3351],[p3373, p3375],[p3376, p3379, p3380, p3381, p3382, p3402, p3407, p3408],[p3383, p3385],[p3393, p3398, p3452, p3454],[p3427, p3432],[p3386, p3388],[p3415, p3420],[p3439, p3440],[p3445, p3450, p3473, p3477],[p3484, p3489],[p3442, p3444, p3496, p3501],

[2022-06-03 16:13:34] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: Index -1 out of bounds for length 446
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:564)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:231)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:116)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-03 16:13:34] [INFO ] Flatten gal took : 125 ms
[2022-06-03 16:13:34] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13130782310009435853.gal : 16 ms
[2022-06-03 16:13:34] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1289150641120073341.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/ReachabilityFireability13130782310009435853.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1289150641120073341.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability1289150641120073341.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :18 after 27
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :27 after 324
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :324 after 11664
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :11664 after 3.77914e+06
Reachability property ShieldIIPt-PT-050B-ReachabilityFireability-10 is true.
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
[2022-06-03 16:15:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-06
[2022-06-03 16:15:11] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-06(SAT) depth K=2 took 391845 ms
[2022-06-03 16:15:14] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=3 took 541089 ms
[2022-06-03 16:20:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-00
[2022-06-03 16:20:45] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-00(SAT) depth K=3 took 333659 ms
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin2970099932726522327;'/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' 'ShieldIIPtPT050BReachabilityFireability05==true'
Running LTSmin : cd /tmp/ltsmin2970099932726522327;'/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' 'ShieldIIPtPT050BReachabilityFireability06==true'
[2022-06-03 16:27:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-03
[2022-06-03 16:27:39] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-03(SAT) depth K=3 took 414518 ms
[2022-06-03 16:31:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-050B-ReachabilityFireability-05
[2022-06-03 16:31:22] [INFO ] KInduction solution for property ShieldIIPt-PT-050B-ReachabilityFireability-05(SAT) depth K=3 took 223161 ms
[2022-06-03 16:33:33] [INFO ] BMC solution for property ShieldIIPt-PT-050B-ReachabilityFireability-06(UNSAT) depth K=3 took 1098825 ms

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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldIIPt-PT-050B"
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 ShieldIIPt-PT-050B, 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-165286025100335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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