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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.0K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 29 18:28 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.8K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 6.9K Apr 29 18:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 29 18:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 29 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 29 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 686K 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654269466705

Running Version 202205111006
[2022-06-03 15:17:47] [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:17:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:17:48] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2022-06-03 15:17:48] [INFO ] Transformed 2803 places.
[2022-06-03 15:17:48] [INFO ] Transformed 2603 transitions.
[2022-06-03 15:17:48] [INFO ] Found NUPN structural information;
[2022-06-03 15:17:48] [INFO ] Parsed PT model containing 2803 places and 2603 transitions in 373 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 16) seen :6
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) 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 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) 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 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2603 rows 2803 cols
[2022-06-03 15:17:49] [INFO ] Computed 361 place invariants in 70 ms
[2022-06-03 15:17:50] [INFO ] [Real]Absence check using 361 positive place invariants in 137 ms returned sat
[2022-06-03 15:17:50] [INFO ] After 1254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-03 15:17:51] [INFO ] [Nat]Absence check using 361 positive place invariants in 138 ms returned sat
[2022-06-03 15:17:57] [INFO ] After 5021ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2022-06-03 15:17:57] [INFO ] Deduced a trap composed of 18 places in 795 ms of which 9 ms to minimize.
[2022-06-03 15:17:58] [INFO ] Deduced a trap composed of 40 places in 750 ms of which 3 ms to minimize.
[2022-06-03 15:18:00] [INFO ] Deduced a trap composed of 19 places in 857 ms of which 2 ms to minimize.
[2022-06-03 15:18:00] [INFO ] Deduced a trap composed of 17 places in 867 ms of which 2 ms to minimize.
[2022-06-03 15:18:01] [INFO ] Deduced a trap composed of 30 places in 805 ms of which 2 ms to minimize.
[2022-06-03 15:18:02] [INFO ] Deduced a trap composed of 24 places in 873 ms of which 2 ms to minimize.
[2022-06-03 15:18:03] [INFO ] Deduced a trap composed of 22 places in 821 ms of which 2 ms to minimize.
[2022-06-03 15:18:06] [INFO ] Deduced a trap composed of 37 places in 860 ms of which 2 ms to minimize.
[2022-06-03 15:18:07] [INFO ] Deduced a trap composed of 16 places in 880 ms of which 2 ms to minimize.
[2022-06-03 15:18:08] [INFO ] Deduced a trap composed of 19 places in 873 ms of which 2 ms to minimize.
[2022-06-03 15:18:08] [INFO ] Deduced a trap composed of 16 places in 764 ms of which 1 ms to minimize.
[2022-06-03 15:18:09] [INFO ] Deduced a trap composed of 29 places in 815 ms of which 2 ms to minimize.
[2022-06-03 15:18:10] [INFO ] Deduced a trap composed of 24 places in 824 ms of which 2 ms to minimize.
[2022-06-03 15:18:11] [INFO ] Deduced a trap composed of 33 places in 794 ms of which 1 ms to minimize.
[2022-06-03 15:18:12] [INFO ] Deduced a trap composed of 26 places in 779 ms of which 3 ms to minimize.
[2022-06-03 15:18:13] [INFO ] Deduced a trap composed of 27 places in 786 ms of which 2 ms to minimize.
[2022-06-03 15:18:14] [INFO ] Deduced a trap composed of 22 places in 798 ms of which 1 ms to minimize.
[2022-06-03 15:18:15] [INFO ] Deduced a trap composed of 19 places in 847 ms of which 8 ms to minimize.
[2022-06-03 15:18:16] [INFO ] Deduced a trap composed of 48 places in 781 ms of which 2 ms to minimize.
[2022-06-03 15:18:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 15:18:16] [INFO ] After 25396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 36428 ms.
Support contains 146 out of 2803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 582 rules applied. Total rules applied 582 place count 2803 transition count 2021
Reduce places removed 582 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 584 rules applied. Total rules applied 1166 place count 2221 transition count 2019
Reduce places removed 1 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 2 with 41 rules applied. Total rules applied 1207 place count 2220 transition count 1979
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 1247 place count 2180 transition count 1979
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 168 Pre rules applied. Total rules applied 1247 place count 2180 transition count 1811
Deduced a syphon composed of 168 places in 4 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 1583 place count 2012 transition count 1811
Discarding 247 places :
Symmetric choice reduction at 4 with 247 rule applications. Total rules 1830 place count 1765 transition count 1564
Iterating global reduction 4 with 247 rules applied. Total rules applied 2077 place count 1765 transition count 1564
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 2077 place count 1765 transition count 1470
Deduced a syphon composed of 94 places in 9 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 2265 place count 1671 transition count 1470
Performed 613 Post agglomeration using F-continuation condition.Transition count delta: 613
Deduced a syphon composed of 613 places in 2 ms
Reduce places removed 613 places and 0 transitions.
Iterating global reduction 4 with 1226 rules applied. Total rules applied 3491 place count 1058 transition count 857
Renaming transitions due to excessive name length > 1024 char.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 99 places in 2 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 3689 place count 959 transition count 909
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3693 place count 959 transition count 905
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 3697 place count 955 transition count 905
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 3728 place count 955 transition count 905
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3729 place count 954 transition count 904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3730 place count 953 transition count 904
Applied a total of 3730 rules in 908 ms. Remains 953 /2803 variables (removed 1850) and now considering 904/2603 (removed 1699) transitions.
Finished structural reductions, in 1 iterations. Remains : 953/2803 places, 904/2603 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 19522 ms. (steps per millisecond=51 ) properties (out of 8) seen :1
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 875765 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen 0
Interrupted Best-First random walk after 618442 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=123 ) properties seen 0
Interrupted Best-First random walk after 866894 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen 0
Interrupted Best-First random walk after 838914 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
Interrupted Best-First random walk after 750566 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
Interrupted Best-First random walk after 860262 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen 0
Interrupted Best-First random walk after 721995 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
Running SMT prover for 7 properties.
// Phase 1: matrix 904 rows 953 cols
[2022-06-03 15:19:47] [INFO ] Computed 360 place invariants in 5 ms
[2022-06-03 15:19:48] [INFO ] [Real]Absence check using 360 positive place invariants in 54 ms returned sat
[2022-06-03 15:19:48] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 15:19:48] [INFO ] [Nat]Absence check using 360 positive place invariants in 56 ms returned sat
[2022-06-03 15:19:49] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-03 15:19:49] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-03 15:19:50] [INFO ] After 900ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-06-03 15:19:50] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2022-06-03 15:19:50] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2022-06-03 15:19:50] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2022-06-03 15:19:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 525 ms
[2022-06-03 15:19:51] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:19:51] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2022-06-03 15:19:51] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2022-06-03 15:19:51] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2022-06-03 15:19:51] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2022-06-03 15:19:52] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2022-06-03 15:19:52] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2022-06-03 15:19:52] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2022-06-03 15:19:52] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2022-06-03 15:19:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-06-03 15:19:52] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2022-06-03 15:19:53] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 4 ms to minimize.
[2022-06-03 15:19:53] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2022-06-03 15:19:53] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2022-06-03 15:19:53] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2022-06-03 15:19:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2274 ms
[2022-06-03 15:19:53] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2022-06-03 15:19:54] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2022-06-03 15:19:54] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:19:54] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-06-03 15:19:54] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2022-06-03 15:19:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 789 ms
[2022-06-03 15:19:54] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2022-06-03 15:19:54] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2022-06-03 15:19:55] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-06-03 15:19:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 473 ms
[2022-06-03 15:19:55] [INFO ] After 5874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1344 ms.
[2022-06-03 15:19:56] [INFO ] After 8345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 4303 ms.
Support contains 145 out of 953 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 953/953 places, 904/904 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 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 952 transition count 903
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 2 with 2 rules applied. Total rules applied 4 place count 951 transition count 904
Applied a total of 4 rules in 82 ms. Remains 951 /953 variables (removed 2) and now considering 904/904 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/953 places, 904/904 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20287 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Interrupted Best-First random walk after 856149 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
Interrupted Best-First random walk after 612241 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=122 ) properties seen 0
Interrupted Best-First random walk after 847608 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen 1
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 875100 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=174 ) properties seen 0
Interrupted Best-First random walk after 756570 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=151 ) properties seen 0
Interrupted Best-First random walk after 844590 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=168 ) properties seen 0
Interrupted Best-First random walk after 720494 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
Running SMT prover for 6 properties.
// Phase 1: matrix 904 rows 951 cols
[2022-06-03 15:20:56] [INFO ] Computed 360 place invariants in 3 ms
[2022-06-03 15:20:56] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 15:20:56] [INFO ] [Nat]Absence check using 360 positive place invariants in 52 ms returned sat
[2022-06-03 15:20:57] [INFO ] After 759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 15:20:57] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-03 15:20:58] [INFO ] After 673ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-03 15:20:58] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2022-06-03 15:20:58] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2022-06-03 15:20:58] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 7 ms to minimize.
[2022-06-03 15:20:59] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-06-03 15:20:59] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2022-06-03 15:20:59] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2022-06-03 15:20:59] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2022-06-03 15:20:59] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2022-06-03 15:20:59] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2022-06-03 15:20:59] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 5 ms to minimize.
[2022-06-03 15:21:00] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2022-06-03 15:21:00] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2022-06-03 15:21:00] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2022-06-03 15:21:00] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2022-06-03 15:21:00] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2036 ms
[2022-06-03 15:21:00] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2022-06-03 15:21:01] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2022-06-03 15:21:01] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:21:01] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2022-06-03 15:21:01] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2022-06-03 15:21:01] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2022-06-03 15:21:01] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2022-06-03 15:21:01] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2022-06-03 15:21:02] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 5 ms to minimize.
[2022-06-03 15:21:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1390 ms
[2022-06-03 15:21:02] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2022-06-03 15:21:02] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2022-06-03 15:21:02] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2022-06-03 15:21:02] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2022-06-03 15:21:03] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2022-06-03 15:21:03] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2022-06-03 15:21:03] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2022-06-03 15:21:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1044 ms
[2022-06-03 15:21:03] [INFO ] After 5798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 979 ms.
[2022-06-03 15:21:04] [INFO ] After 7875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 4264 ms.
Support contains 144 out of 951 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 951/951 places, 904/904 transitions.
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 2 place count 950 transition count 903
Applied a total of 2 rules in 51 ms. Remains 950 /951 variables (removed 1) and now considering 903/904 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/951 places, 903/904 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 19661 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 625147 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen 0
Interrupted Best-First random walk after 839606 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
Interrupted Best-First random walk after 808247 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen 0
Interrupted Best-First random walk after 748389 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=149 ) properties seen 0
Interrupted Best-First random walk after 842532 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=168 ) properties seen 0
Interrupted Best-First random walk after 730336 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=146 ) properties seen 0
Probabilistic random walk exhausted memory after 5291166 steps, saw 3854139 distinct states, run finished after 149527 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 903 rows 950 cols
[2022-06-03 15:24:28] [INFO ] Computed 360 place invariants in 4 ms
[2022-06-03 15:24:28] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 15:24:28] [INFO ] [Nat]Absence check using 360 positive place invariants in 52 ms returned sat
[2022-06-03 15:24:29] [INFO ] After 805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 15:24:29] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-03 15:24:30] [INFO ] After 712ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-03 15:24:30] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2022-06-03 15:24:30] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2022-06-03 15:24:30] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2022-06-03 15:24:31] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2022-06-03 15:24:31] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2022-06-03 15:24:31] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2022-06-03 15:24:31] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2022-06-03 15:24:31] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2022-06-03 15:24:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1332 ms
[2022-06-03 15:24:31] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2022-06-03 15:24:32] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2022-06-03 15:24:32] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 1 ms to minimize.
[2022-06-03 15:24:32] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 0 ms to minimize.
[2022-06-03 15:24:32] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 0 ms to minimize.
[2022-06-03 15:24:32] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2022-06-03 15:24:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1004 ms
[2022-06-03 15:24:32] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2022-06-03 15:24:33] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2022-06-03 15:24:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2022-06-03 15:24:33] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2022-06-03 15:24:33] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2022-06-03 15:24:33] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2022-06-03 15:24:33] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2022-06-03 15:24:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 596 ms
[2022-06-03 15:24:34] [INFO ] After 4793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2140 ms.
[2022-06-03 15:24:36] [INFO ] After 8077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 6670 ms.
Support contains 144 out of 950 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 903/903 transitions.
Applied a total of 0 rules in 26 ms. Remains 950 /950 variables (removed 0) and now considering 903/903 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 903/903 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 903/903 transitions.
Applied a total of 0 rules in 36 ms. Remains 950 /950 variables (removed 0) and now considering 903/903 (removed 0) transitions.
// Phase 1: matrix 903 rows 950 cols
[2022-06-03 15:24:43] [INFO ] Computed 360 place invariants in 2 ms
[2022-06-03 15:24:43] [INFO ] Implicit Places using invariants in 411 ms returned []
// Phase 1: matrix 903 rows 950 cols
[2022-06-03 15:24:43] [INFO ] Computed 360 place invariants in 3 ms
[2022-06-03 15:24:43] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-03 15:24:45] [INFO ] Implicit Places using invariants and state equation in 1901 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
[2022-06-03 15:24:45] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 903 rows 950 cols
[2022-06-03 15:24:45] [INFO ] Computed 360 place invariants in 6 ms
[2022-06-03 15:24:45] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 903/903 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20275 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 589243 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=117 ) properties seen 0
Interrupted Best-First random walk after 832816 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 0
Interrupted Best-First random walk after 852199 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted Best-First random walk after 724744 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
Interrupted Best-First random walk after 852154 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted Best-First random walk after 719770 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen 0
Probabilistic random walk exhausted memory after 5290747 steps, saw 3853873 distinct states, run finished after 149124 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 903 rows 950 cols
[2022-06-03 15:28:05] [INFO ] Computed 360 place invariants in 4 ms
[2022-06-03 15:28:05] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 15:28:05] [INFO ] [Nat]Absence check using 360 positive place invariants in 54 ms returned sat
[2022-06-03 15:28:06] [INFO ] After 796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 15:28:06] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-03 15:28:07] [INFO ] After 687ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-03 15:28:07] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2022-06-03 15:28:08] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2022-06-03 15:28:08] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:28:08] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2022-06-03 15:28:08] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2022-06-03 15:28:08] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-06-03 15:28:08] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2022-06-03 15:28:08] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2022-06-03 15:28:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1319 ms
[2022-06-03 15:28:09] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2022-06-03 15:28:09] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2022-06-03 15:28:09] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2022-06-03 15:28:09] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2022-06-03 15:28:09] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2022-06-03 15:28:10] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2022-06-03 15:28:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 976 ms
[2022-06-03 15:28:10] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2022-06-03 15:28:10] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2022-06-03 15:28:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2022-06-03 15:28:10] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2022-06-03 15:28:10] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2022-06-03 15:28:11] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2022-06-03 15:28:11] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2022-06-03 15:28:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 573 ms
[2022-06-03 15:28:11] [INFO ] After 4688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2219 ms.
[2022-06-03 15:28:13] [INFO ] After 8050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 6763 ms.
Support contains 144 out of 950 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 903/903 transitions.
Applied a total of 0 rules in 31 ms. Remains 950 /950 variables (removed 0) and now considering 903/903 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 903/903 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 950/950 places, 903/903 transitions.
Applied a total of 0 rules in 23 ms. Remains 950 /950 variables (removed 0) and now considering 903/903 (removed 0) transitions.
// Phase 1: matrix 903 rows 950 cols
[2022-06-03 15:28:20] [INFO ] Computed 360 place invariants in 2 ms
[2022-06-03 15:28:20] [INFO ] Implicit Places using invariants in 425 ms returned []
// Phase 1: matrix 903 rows 950 cols
[2022-06-03 15:28:20] [INFO ] Computed 360 place invariants in 4 ms
[2022-06-03 15:28:21] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-03 15:28:22] [INFO ] Implicit Places using invariants and state equation in 1939 ms returned []
Implicit Place search using SMT with State Equation took 2366 ms to find 0 implicit places.
[2022-06-03 15:28:22] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 903 rows 950 cols
[2022-06-03 15:28:22] [INFO ] Computed 360 place invariants in 9 ms
[2022-06-03 15:28:23] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 903/903 transitions.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 0 with 102 rules applied. Total rules applied 102 place count 950 transition count 903
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 103 place count 950 transition count 902
Applied a total of 103 rules in 68 ms. Remains 950 /950 variables (removed 0) and now considering 902/903 (removed 1) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 902 rows 950 cols
[2022-06-03 15:28:23] [INFO ] Computed 360 place invariants in 2 ms
[2022-06-03 15:28:23] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 15:28:23] [INFO ] [Nat]Absence check using 360 positive place invariants in 50 ms returned sat
[2022-06-03 15:28:24] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 15:28:24] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-03 15:28:25] [INFO ] After 582ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-03 15:28:25] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2022-06-03 15:28:25] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2022-06-03 15:28:25] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-06-03 15:28:25] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2022-06-03 15:28:26] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2022-06-03 15:28:26] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2022-06-03 15:28:26] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2022-06-03 15:28:26] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2022-06-03 15:28:26] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2022-06-03 15:28:26] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2022-06-03 15:28:27] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2022-06-03 15:28:27] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2022-06-03 15:28:27] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:28:27] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2022-06-03 15:28:27] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2022-06-03 15:28:27] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2022-06-03 15:28:27] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2371 ms
[2022-06-03 15:28:27] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2022-06-03 15:28:28] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2022-06-03 15:28:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2022-06-03 15:28:28] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2022-06-03 15:28:28] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2022-06-03 15:28:28] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2022-06-03 15:28:28] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2022-06-03 15:28:29] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2022-06-03 15:28:29] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2022-06-03 15:28:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1090 ms
[2022-06-03 15:28:29] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2022-06-03 15:28:29] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2022-06-03 15:28:29] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2022-06-03 15:28:29] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2022-06-03 15:28:30] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2022-06-03 15:28:30] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:28:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 982 ms
[2022-06-03 15:28:30] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2022-06-03 15:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-06-03 15:28:30] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2022-06-03 15:28:30] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2022-06-03 15:28:31] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2022-06-03 15:28:31] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:28:31] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2022-06-03 15:28:31] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2022-06-03 15:28:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 973 ms
[2022-06-03 15:28:31] [INFO ] After 7019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 716 ms.
[2022-06-03 15:28:32] [INFO ] After 8754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-06-03 15:28:32] [INFO ] Flatten gal took : 116 ms
[2022-06-03 15:28:32] [INFO ] Flatten gal took : 81 ms
[2022-06-03 15:28:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7562580587840542671.gal : 25 ms
[2022-06-03 15:28:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10432433042205640390.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7562580587840542671.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10432433042205640390.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/ReachabilityCardinality10432433042205640390.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 13
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :13 after 37
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :37 after 649
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :649 after 972005
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :972005 after 3.06112e+14
Detected timeout of ITS tools.
[2022-06-03 15:28:47] [INFO ] Flatten gal took : 56 ms
[2022-06-03 15:28:47] [INFO ] Applying decomposition
[2022-06-03 15:28:47] [INFO ] Flatten gal took : 59 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/graph7485719338896569258.txt' '-o' '/tmp/graph7485719338896569258.bin' '-w' '/tmp/graph7485719338896569258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7485719338896569258.bin' '-l' '-1' '-v' '-w' '/tmp/graph7485719338896569258.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:28:48] [INFO ] Decomposing Gal with order
[2022-06-03 15:28:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:28:48] [INFO ] Removed a total of 434 redundant transitions.
[2022-06-03 15:28:48] [INFO ] Flatten gal took : 117 ms
[2022-06-03 15:28:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 21 ms.
[2022-06-03 15:28:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14672846202877879201.gal : 12 ms
[2022-06-03 15:28:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1940642364341134761.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/ReachabilityCardinality14672846202877879201.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1940642364341134761.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/ReachabilityCardinality1940642364341134761.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :13 after 37
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :37 after 217
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :217 after 217
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :217 after 217
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :217 after 972005
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :972005 after 7.08592e+09
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :7.37537e+23 after 8.24591e+27
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5618354039501042108
[2022-06-03 15:29:03] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5618354039501042108
Running compilation step : cd /tmp/ltsmin5618354039501042108;'/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 1810 ms.
Running link step : cd /tmp/ltsmin5618354039501042108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5618354039501042108;'/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' 'ShieldIIPtPT040BReachabilityFireability01==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 15:29:18] [INFO ] Flatten gal took : 55 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17996166195959852421
[2022-06-03 15:29:18] [INFO ] Computing symmetric may disable matrix : 903 transitions.
[2022-06-03 15:29:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:29:18] [INFO ] Computing symmetric may enable matrix : 903 transitions.
[2022-06-03 15:29:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:29:18] [INFO ] Applying decomposition
[2022-06-03 15:29:18] [INFO ] Flatten gal took : 99 ms
[2022-06-03 15:29:18] [INFO ] Flatten gal took : 59 ms
[2022-06-03 15:29:18] [INFO ] Input system was already deterministic with 903 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2162111390186266959.txt' '-o' '/tmp/graph2162111390186266959.bin' '-w' '/tmp/graph2162111390186266959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2162111390186266959.bin' '-l' '-1' '-v' '-w' '/tmp/graph2162111390186266959.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:29:19] [INFO ] Decomposing Gal with order
[2022-06-03 15:29:19] [INFO ] Computing Do-Not-Accords matrix : 903 transitions.
[2022-06-03 15:29:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:29:19] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:29:19] [INFO ] Built C files in 424ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17996166195959852421
Running compilation step : cd /tmp/ltsmin17996166195959852421;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '120' '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:29:19] [INFO ] Removed a total of 608 redundant transitions.
[2022-06-03 15:29:19] [INFO ] Flatten gal took : 71 ms
[2022-06-03 15:29:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 18 ms.
[2022-06-03 15:29:19] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12101889854020204608.gal : 8 ms
[2022-06-03 15:29:19] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16972094407627507289.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/ReachabilityFireability12101889854020204608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16972094407627507289.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityFireability16972094407627507289.prop.
[2022-06-03 15:29:19] [INFO ] Ran tautology test, simplified 0 / 6 in 621 ms.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 37
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :37 after 217
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :217 after 217
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(UNSAT) depth K=0 took 29 ms
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-03(UNSAT) depth K=0 took 1 ms
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-06(UNSAT) depth K=0 took 0 ms
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(UNSAT) depth K=0 took 2 ms
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(UNSAT) depth K=0 took 0 ms
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-11(UNSAT) depth K=0 took 1 ms
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :217 after 97201
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(UNSAT) depth K=1 took 29 ms
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-03(UNSAT) depth K=1 took 14 ms
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-06(UNSAT) depth K=1 took 5 ms
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(UNSAT) depth K=1 took 4 ms
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(UNSAT) depth K=1 took 11 ms
[2022-06-03 15:29:19] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-11(UNSAT) depth K=1 took 4 ms
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :97201 after 1.75494e+18
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 903 rows 950 cols
[2022-06-03 15:29:19] [INFO ] Computed 360 place invariants in 2 ms
[2022-06-03 15:29:19] [INFO ] Computed 360 place invariants in 3 ms
[2022-06-03 15:29:21] [INFO ] Proved 950 variables to be positive in 1409 ms
[2022-06-03 15:29:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-01
[2022-06-03 15:29:21] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(SAT) depth K=0 took 253 ms
[2022-06-03 15:29:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-03
[2022-06-03 15:29:21] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-03(SAT) depth K=0 took 242 ms
[2022-06-03 15:29:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-06
[2022-06-03 15:29:22] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-06(SAT) depth K=0 took 221 ms
[2022-06-03 15:29:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-09
[2022-06-03 15:29:22] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(SAT) depth K=0 took 206 ms
[2022-06-03 15:29:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-10
[2022-06-03 15:29:22] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(SAT) depth K=0 took 144 ms
Compilation finished in 3327 ms.
Running link step : cd /tmp/ltsmin17996166195959852421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17996166195959852421;'/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' 'ShieldIIPtPT040BReachabilityFireability01==true'
[2022-06-03 15:29:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-11
[2022-06-03 15:29:22] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-11(SAT) depth K=0 took 230 ms
[2022-06-03 15:29:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-01
[2022-06-03 15:29:23] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(SAT) depth K=1 took 1014 ms
[2022-06-03 15:29:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-03
[2022-06-03 15:29:26] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-03(SAT) depth K=1 took 2426 ms
[2022-06-03 15:29:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-06
[2022-06-03 15:29:27] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-06(SAT) depth K=1 took 1167 ms
[2022-06-03 15:29:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-09
[2022-06-03 15:29:29] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-09(SAT) depth K=1 took 2234 ms
[2022-06-03 15:29:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-10
[2022-06-03 15:29:31] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(SAT) depth K=1 took 1760 ms
[2022-06-03 15:29:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-11
[2022-06-03 15:29:33] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-11(SAT) depth K=1 took 2412 ms
[2022-06-03 15:29:50] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(UNSAT) depth K=2 took 30455 ms
[2022-06-03 15:30:17] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-03(UNSAT) depth K=2 took 27697 ms
Invariant property ShieldIIPt-PT-040B-ReachabilityFireability-11 does not hold.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-09 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-06 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-040B-ReachabilityFireability-03 does not hold.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
[2022-06-03 15:30:43] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-06(UNSAT) depth K=2 took 25506 ms
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-01 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.76457e+24 after 8.70646e+81
[2022-06-03 15:31:08] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(UNSAT) depth K=2 took 24871 ms
[2022-06-03 15:33:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-01
[2022-06-03 15:33:17] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(SAT) depth K=2 took 223553 ms
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.70646e+81 after 1.9698e+99
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.9698e+99 after 1.9698e+99
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin17996166195959852421;'/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' 'ShieldIIPtPT040BReachabilityFireability01==true'
Running LTSmin : cd /tmp/ltsmin17996166195959852421;'/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' 'ShieldIIPtPT040BReachabilityFireability10==true'
[2022-06-03 15:48:07] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(UNSAT) depth K=3 took 1019341 ms
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin17996166195959852421;'/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' 'ShieldIIPtPT040BReachabilityFireability10==true'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin17996166195959852421;'/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' 'ShieldIIPtPT040BReachabilityFireability10==true'
[2022-06-03 15:49:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-10
[2022-06-03 15:49:39] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(SAT) depth K=2 took 982216 ms
Detected timeout of ITS tools.
[2022-06-03 15:53:10] [INFO ] Applying decomposition
[2022-06-03 15:53:10] [INFO ] Flatten gal took : 130 ms
[2022-06-03 15:53:10] [INFO ] Decomposing Gal with order
[2022-06-03 15:53:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:53:10] [INFO ] Removed a total of 713 redundant transitions.
[2022-06-03 15:53:10] [INFO ] Flatten gal took : 223 ms
[2022-06-03 15:53:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 104 ms.
[2022-06-03 15:53:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11601899908473861645.gal : 8 ms
[2022-06-03 15:53:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1545542525877217484.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability11601899908473861645.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1545542525877217484.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/ReachabilityFireability1545542525877217484.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 37
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :37 after 217
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :217 after 217
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :217 after 217
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :217 after 3241
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3241 after 1.53056e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9.90585e+23 after 1.21368e+28
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.082: Initializing POR dependencies: labels 909, guards 903
pins2lts-mc-linux64( 4/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 8.531: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 4/ 8), 8.742: "ShieldIIPtPT040BReachabilityFireability10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 8.734: "ShieldIIPtPT040BReachabilityFireability10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 8.738: "ShieldIIPtPT040BReachabilityFireability10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 8.738: "ShieldIIPtPT040BReachabilityFireability10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 8.734: There are 909 state labels and 1 edge labels
pins2lts-mc-linux64( 6/ 8), 8.738: "ShieldIIPtPT040BReachabilityFireability10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 8.738: "ShieldIIPtPT040BReachabilityFireability10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 8.742: "ShieldIIPtPT040BReachabilityFireability10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 8.734: State length is 950, there are 903 groups
pins2lts-mc-linux64( 3/ 8), 8.742: "ShieldIIPtPT040BReachabilityFireability10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 8.735: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 8.735: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 8.735: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 8.735: Visible groups: 0 / 903, labels: 1 / 909
pins2lts-mc-linux64( 0/ 8), 8.735: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 8.735: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 8.782: ~92 levels ~960 states ~1128 transitions
pins2lts-mc-linux64( 0/ 8), 8.900: ~98 levels ~1920 states ~3864 transitions
pins2lts-mc-linux64( 0/ 8), 9.160: ~102 levels ~3840 states ~11704 transitions
pins2lts-mc-linux64( 1/ 8), 9.465: ~10 levels ~7680 states ~21136 transitions
pins2lts-mc-linux64( 1/ 8), 10.230: ~12 levels ~15360 states ~48632 transitions
pins2lts-mc-linux64( 1/ 8), 11.629: ~13 levels ~30720 states ~102808 transitions
pins2lts-mc-linux64( 6/ 8), 14.401: ~15 levels ~61440 states ~254752 transitions
pins2lts-mc-linux64( 1/ 8), 19.545: ~15 levels ~122880 states ~481808 transitions
pins2lts-mc-linux64( 1/ 8), 31.251: ~16 levels ~245760 states ~1109400 transitions
pins2lts-mc-linux64( 1/ 8), 52.107: ~17 levels ~491520 states ~2256552 transitions
pins2lts-mc-linux64( 1/ 8), 98.412: ~18 levels ~983040 states ~5001120 transitions
pins2lts-mc-linux64( 1/ 8), 189.448: ~19 levels ~1966080 states ~10554048 transitions
pins2lts-mc-linux64( 1/ 8), 381.612: ~20 levels ~3932160 states ~22513784 transitions
pins2lts-mc-linux64( 6/ 8), 737.158: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 737.398:
pins2lts-mc-linux64( 0/ 8), 737.398: mean standard work distribution: 4.1% (states) 4.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 737.398:
pins2lts-mc-linux64( 0/ 8), 737.398: Explored 7161331 states 47112877 transitions, fanout: 6.579
pins2lts-mc-linux64( 0/ 8), 737.398: Total exploration time 728.670 sec (728.440 sec minimum, 728.551 sec on average)
pins2lts-mc-linux64( 0/ 8), 737.398: States per second: 9828, Transitions per second: 64656
pins2lts-mc-linux64( 0/ 8), 737.398: Ignoring proviso: 4715953
pins2lts-mc-linux64( 0/ 8), 737.398:
pins2lts-mc-linux64( 0/ 8), 737.398: Queue width: 8B, total height: 6009182, memory: 45.85MB
pins2lts-mc-linux64( 0/ 8), 737.398: Tree memory: 356.5MB, 28.4 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 737.398: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 737.398: Stored 1123 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 737.398: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 737.398: Est. total memory use: 402.3MB (~1069.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17996166195959852421;'/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' 'ShieldIIPtPT040BReachabilityFireability10==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17996166195959852421;'/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' 'ShieldIIPtPT040BReachabilityFireability10==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:122)
at java.base/java.lang.Thread.run(Thread.java:829)
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.21368e+28 after 6.96796e+94
[2022-06-03 16:09:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-10
[2022-06-03 16:09:04] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(SAT) depth K=3 took 1164487 ms
[2022-06-03 16:11:20] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(UNSAT) depth K=4 took 1393299 ms
Detected timeout of ITS tools.
[2022-06-03 16:17:01] [INFO ] Flatten gal took : 92 ms
[2022-06-03 16:17:02] [INFO ] Input system was already deterministic with 903 transitions.
[2022-06-03 16:17:02] [INFO ] Transformed 950 places.
[2022-06-03 16:17:02] [INFO ] Transformed 903 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 16:17:02] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12055616383074259530.gal : 5 ms
[2022-06-03 16:17:02] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16361229836816158427.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/ReachabilityFireability12055616383074259530.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16361229836816158427.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...366
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability16361229836816158427.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 34
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :34 after 208
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :208 after 1466
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1466 after 175632
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :175632 after 1.73874e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.73874e+07 after 7.15042e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.15042e+08 after 6.76095e+14
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.76095e+14 after 2.00714e+21
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.00714e+21 after 4.44632e+25
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.44632e+25 after 5.17309e+37
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.17309e+37 after 2.75501e+48
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.75501e+48 after 1.2843e+71
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.2843e+71 after 7.77604e+94
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :7.77604e+94 after 1.0574e+128

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;