About the Execution of ITS-Tools for ShieldIIPt-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.180 | 44239.00 | 61625.00 | 136.30 | TTTFTTTFTTTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475500311.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475500311
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 3.5K May 14 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 167K May 12 20:42 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-010B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1590581723945
[2020-05-27 12:15:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 12:15:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 12:15:25] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2020-05-27 12:15:25] [INFO ] Transformed 703 places.
[2020-05-27 12:15:25] [INFO ] Transformed 653 transitions.
[2020-05-27 12:15:25] [INFO ] Found NUPN structural information;
[2020-05-27 12:15:25] [INFO ] Parsed PT model containing 703 places and 653 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 73 ms. (steps per millisecond=136 ) properties seen :[0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 1, 0, 0, 0, 0, 0]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 653 rows 703 cols
[2020-05-27 12:15:25] [INFO ] Computed 91 place invariants in 20 ms
[2020-05-27 12:15:26] [INFO ] [Real]Absence check using 91 positive place invariants in 71 ms returned sat
[2020-05-27 12:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:15:27] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2020-05-27 12:15:27] [INFO ] Deduced a trap composed of 15 places in 247 ms
[2020-05-27 12:15:27] [INFO ] Deduced a trap composed of 26 places in 184 ms
[2020-05-27 12:15:27] [INFO ] Deduced a trap composed of 18 places in 183 ms
[2020-05-27 12:15:28] [INFO ] Deduced a trap composed of 18 places in 205 ms
[2020-05-27 12:15:28] [INFO ] Deduced a trap composed of 25 places in 146 ms
[2020-05-27 12:15:28] [INFO ] Deduced a trap composed of 20 places in 138 ms
[2020-05-27 12:15:28] [INFO ] Deduced a trap composed of 26 places in 180 ms
[2020-05-27 12:15:28] [INFO ] Deduced a trap composed of 28 places in 161 ms
[2020-05-27 12:15:28] [INFO ] Deduced a trap composed of 37 places in 145 ms
[2020-05-27 12:15:29] [INFO ] Deduced a trap composed of 28 places in 124 ms
[2020-05-27 12:15:29] [INFO ] Deduced a trap composed of 19 places in 152 ms
[2020-05-27 12:15:29] [INFO ] Deduced a trap composed of 21 places in 107 ms
[2020-05-27 12:15:29] [INFO ] Deduced a trap composed of 28 places in 105 ms
[2020-05-27 12:15:29] [INFO ] Deduced a trap composed of 24 places in 135 ms
[2020-05-27 12:15:29] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2020-05-27 12:15:30] [INFO ] Deduced a trap composed of 28 places in 104 ms
[2020-05-27 12:15:30] [INFO ] Deduced a trap composed of 23 places in 90 ms
[2020-05-27 12:15:30] [INFO ] Deduced a trap composed of 25 places in 82 ms
[2020-05-27 12:15:30] [INFO ] Deduced a trap composed of 24 places in 78 ms
[2020-05-27 12:15:30] [INFO ] Deduced a trap composed of 24 places in 62 ms
[2020-05-27 12:15:30] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3393 ms
[2020-05-27 12:15:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:15:30] [INFO ] [Nat]Absence check using 91 positive place invariants in 91 ms returned sat
[2020-05-27 12:15:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:15:31] [INFO ] [Nat]Absence check using state equation in 920 ms returned sat
[2020-05-27 12:15:31] [INFO ] Deduced a trap composed of 13 places in 188 ms
[2020-05-27 12:15:32] [INFO ] Deduced a trap composed of 28 places in 169 ms
[2020-05-27 12:15:32] [INFO ] Deduced a trap composed of 17 places in 166 ms
[2020-05-27 12:15:32] [INFO ] Deduced a trap composed of 34 places in 168 ms
[2020-05-27 12:15:32] [INFO ] Deduced a trap composed of 23 places in 156 ms
[2020-05-27 12:15:32] [INFO ] Deduced a trap composed of 15 places in 205 ms
[2020-05-27 12:15:33] [INFO ] Deduced a trap composed of 20 places in 170 ms
[2020-05-27 12:15:33] [INFO ] Deduced a trap composed of 27 places in 164 ms
[2020-05-27 12:15:33] [INFO ] Deduced a trap composed of 33 places in 154 ms
[2020-05-27 12:15:33] [INFO ] Deduced a trap composed of 22 places in 165 ms
[2020-05-27 12:15:33] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-05-27 12:15:33] [INFO ] Deduced a trap composed of 20 places in 170 ms
[2020-05-27 12:15:34] [INFO ] Deduced a trap composed of 25 places in 138 ms
[2020-05-27 12:15:34] [INFO ] Deduced a trap composed of 26 places in 152 ms
[2020-05-27 12:15:34] [INFO ] Deduced a trap composed of 22 places in 118 ms
[2020-05-27 12:15:34] [INFO ] Deduced a trap composed of 28 places in 117 ms
[2020-05-27 12:15:34] [INFO ] Deduced a trap composed of 24 places in 136 ms
[2020-05-27 12:15:34] [INFO ] Deduced a trap composed of 24 places in 119 ms
[2020-05-27 12:15:35] [INFO ] Deduced a trap composed of 27 places in 112 ms
[2020-05-27 12:15:35] [INFO ] Deduced a trap composed of 21 places in 131 ms
[2020-05-27 12:15:35] [INFO ] Deduced a trap composed of 25 places in 160 ms
[2020-05-27 12:15:35] [INFO ] Deduced a trap composed of 31 places in 97 ms
[2020-05-27 12:15:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s151 s152 s176 s177 s178 s179 s180 s181 s182 s183 s184 s198 s199 s200 s201 s202 s203 s204 s205 s206 s209 s218 s219) 0)") while checking expression at index 0
[2020-05-27 12:15:35] [INFO ] [Real]Absence check using 91 positive place invariants in 78 ms returned sat
[2020-05-27 12:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:15:36] [INFO ] [Real]Absence check using state equation in 1032 ms returned sat
[2020-05-27 12:15:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:15:37] [INFO ] [Nat]Absence check using 91 positive place invariants in 98 ms returned sat
[2020-05-27 12:15:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:15:38] [INFO ] [Nat]Absence check using state equation in 1016 ms returned sat
[2020-05-27 12:15:38] [INFO ] Deduced a trap composed of 21 places in 202 ms
[2020-05-27 12:15:38] [INFO ] Deduced a trap composed of 19 places in 250 ms
[2020-05-27 12:15:38] [INFO ] Deduced a trap composed of 29 places in 192 ms
[2020-05-27 12:15:38] [INFO ] Deduced a trap composed of 31 places in 192 ms
[2020-05-27 12:15:39] [INFO ] Deduced a trap composed of 23 places in 174 ms
[2020-05-27 12:15:39] [INFO ] Deduced a trap composed of 22 places in 174 ms
[2020-05-27 12:15:39] [INFO ] Deduced a trap composed of 21 places in 174 ms
[2020-05-27 12:15:39] [INFO ] Deduced a trap composed of 23 places in 170 ms
[2020-05-27 12:15:40] [INFO ] Deduced a trap composed of 23 places in 235 ms
[2020-05-27 12:15:40] [INFO ] Deduced a trap composed of 34 places in 190 ms
[2020-05-27 12:15:40] [INFO ] Deduced a trap composed of 25 places in 172 ms
[2020-05-27 12:15:40] [INFO ] Deduced a trap composed of 25 places in 210 ms
[2020-05-27 12:15:40] [INFO ] Deduced a trap composed of 25 places in 193 ms
[2020-05-27 12:15:41] [INFO ] Deduced a trap composed of 23 places in 168 ms
[2020-05-27 12:15:41] [INFO ] Deduced a trap composed of 36 places in 219 ms
[2020-05-27 12:15:41] [INFO ] Deduced a trap composed of 23 places in 172 ms
[2020-05-27 12:15:41] [INFO ] Deduced a trap composed of 17 places in 168 ms
[2020-05-27 12:15:41] [INFO ] Deduced a trap composed of 23 places in 128 ms
[2020-05-27 12:15:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s289 s290 s297 s298 s299 s307 s308 s309 s347 s349 s351 s352 s353 s354 s355 s356 s357) 0)") while checking expression at index 1
[2020-05-27 12:15:42] [INFO ] [Real]Absence check using 91 positive place invariants in 48 ms returned sat
[2020-05-27 12:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:15:42] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2020-05-27 12:15:43] [INFO ] Deduced a trap composed of 20 places in 198 ms
[2020-05-27 12:15:43] [INFO ] Deduced a trap composed of 15 places in 146 ms
[2020-05-27 12:15:43] [INFO ] Deduced a trap composed of 25 places in 117 ms
[2020-05-27 12:15:43] [INFO ] Deduced a trap composed of 20 places in 143 ms
[2020-05-27 12:15:43] [INFO ] Deduced a trap composed of 20 places in 135 ms
[2020-05-27 12:15:43] [INFO ] Deduced a trap composed of 22 places in 117 ms
[2020-05-27 12:15:44] [INFO ] Deduced a trap composed of 27 places in 169 ms
[2020-05-27 12:15:44] [INFO ] Deduced a trap composed of 20 places in 125 ms
[2020-05-27 12:15:44] [INFO ] Deduced a trap composed of 20 places in 122 ms
[2020-05-27 12:15:44] [INFO ] Deduced a trap composed of 20 places in 153 ms
[2020-05-27 12:15:44] [INFO ] Deduced a trap composed of 21 places in 83 ms
[2020-05-27 12:15:44] [INFO ] Deduced a trap composed of 26 places in 109 ms
[2020-05-27 12:15:44] [INFO ] Deduced a trap composed of 20 places in 83 ms
[2020-05-27 12:15:45] [INFO ] Deduced a trap composed of 18 places in 80 ms
[2020-05-27 12:15:45] [INFO ] Deduced a trap composed of 17 places in 75 ms
[2020-05-27 12:15:45] [INFO ] Deduced a trap composed of 19 places in 123 ms
[2020-05-27 12:15:45] [INFO ] Deduced a trap composed of 33 places in 92 ms
[2020-05-27 12:15:45] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2636 ms
[2020-05-27 12:15:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:15:45] [INFO ] [Nat]Absence check using 91 positive place invariants in 69 ms returned sat
[2020-05-27 12:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:15:46] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2020-05-27 12:15:46] [INFO ] Deduced a trap composed of 15 places in 188 ms
[2020-05-27 12:15:46] [INFO ] Deduced a trap composed of 19 places in 154 ms
[2020-05-27 12:15:46] [INFO ] Deduced a trap composed of 17 places in 166 ms
[2020-05-27 12:15:47] [INFO ] Deduced a trap composed of 25 places in 157 ms
[2020-05-27 12:15:47] [INFO ] Deduced a trap composed of 21 places in 149 ms
[2020-05-27 12:15:47] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2020-05-27 12:15:47] [INFO ] Deduced a trap composed of 13 places in 118 ms
[2020-05-27 12:15:47] [INFO ] Deduced a trap composed of 19 places in 132 ms
[2020-05-27 12:15:47] [INFO ] Deduced a trap composed of 19 places in 117 ms
[2020-05-27 12:15:48] [INFO ] Deduced a trap composed of 20 places in 132 ms
[2020-05-27 12:15:48] [INFO ] Deduced a trap composed of 33 places in 103 ms
[2020-05-27 12:15:48] [INFO ] Deduced a trap composed of 26 places in 120 ms
[2020-05-27 12:15:48] [INFO ] Deduced a trap composed of 21 places in 121 ms
[2020-05-27 12:15:48] [INFO ] Deduced a trap composed of 21 places in 97 ms
[2020-05-27 12:15:48] [INFO ] Deduced a trap composed of 23 places in 93 ms
[2020-05-27 12:15:48] [INFO ] Deduced a trap composed of 20 places in 81 ms
[2020-05-27 12:15:48] [INFO ] Deduced a trap composed of 25 places in 76 ms
[2020-05-27 12:15:48] [INFO ] Deduced a trap composed of 20 places in 68 ms
[2020-05-27 12:15:49] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-05-27 12:15:49] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2020-05-27 12:15:49] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2812 ms
[2020-05-27 12:15:49] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints in 41 ms.
[2020-05-27 12:15:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t191 0) (and (> t190 0) (< o190 o191)))") while checking expression at index 2
[2020-05-27 12:15:50] [INFO ] [Real]Absence check using 91 positive place invariants in 74 ms returned sat
[2020-05-27 12:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:15:51] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2020-05-27 12:15:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:15:51] [INFO ] [Nat]Absence check using 91 positive place invariants in 61 ms returned sat
[2020-05-27 12:15:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:15:53] [INFO ] [Nat]Absence check using state equation in 1068 ms returned sat
[2020-05-27 12:15:53] [INFO ] Deduced a trap composed of 22 places in 234 ms
[2020-05-27 12:15:53] [INFO ] Deduced a trap composed of 18 places in 124 ms
[2020-05-27 12:15:53] [INFO ] Deduced a trap composed of 26 places in 114 ms
[2020-05-27 12:15:53] [INFO ] Deduced a trap composed of 24 places in 131 ms
[2020-05-27 12:15:53] [INFO ] Deduced a trap composed of 23 places in 113 ms
[2020-05-27 12:15:54] [INFO ] Deduced a trap composed of 20 places in 100 ms
[2020-05-27 12:15:54] [INFO ] Deduced a trap composed of 37 places in 95 ms
[2020-05-27 12:15:54] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-05-27 12:15:54] [INFO ] Deduced a trap composed of 26 places in 92 ms
[2020-05-27 12:15:54] [INFO ] Deduced a trap composed of 18 places in 112 ms
[2020-05-27 12:15:54] [INFO ] Deduced a trap composed of 22 places in 84 ms
[2020-05-27 12:15:54] [INFO ] Deduced a trap composed of 26 places in 74 ms
[2020-05-27 12:15:54] [INFO ] Deduced a trap composed of 19 places in 75 ms
[2020-05-27 12:15:54] [INFO ] Deduced a trap composed of 20 places in 75 ms
[2020-05-27 12:15:54] [INFO ] Deduced a trap composed of 29 places in 60 ms
[2020-05-27 12:15:55] [INFO ] Deduced a trap composed of 22 places in 57 ms
[2020-05-27 12:15:55] [INFO ] Deduced a trap composed of 41 places in 54 ms
[2020-05-27 12:15:55] [INFO ] Deduced a trap composed of 26 places in 56 ms
[2020-05-27 12:15:55] [INFO ] Deduced a trap composed of 23 places in 49 ms
[2020-05-27 12:15:55] [INFO ] Deduced a trap composed of 32 places in 54 ms
[2020-05-27 12:15:55] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2330 ms
[2020-05-27 12:15:55] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints in 37 ms.
[2020-05-27 12:15:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t267 0) (and (> t266 0) (< o266 o267)))") while checking expression at index 3
[2020-05-27 12:15:56] [INFO ] [Real]Absence check using 91 positive place invariants in 20 ms returned unsat
[2020-05-27 12:15:57] [INFO ] [Real]Absence check using 91 positive place invariants in 64 ms returned sat
[2020-05-27 12:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:15:58] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2020-05-27 12:15:58] [INFO ] Deduced a trap composed of 26 places in 263 ms
[2020-05-27 12:15:58] [INFO ] Deduced a trap composed of 30 places in 195 ms
[2020-05-27 12:15:58] [INFO ] Deduced a trap composed of 23 places in 180 ms
[2020-05-27 12:15:59] [INFO ] Deduced a trap composed of 26 places in 207 ms
[2020-05-27 12:15:59] [INFO ] Deduced a trap composed of 26 places in 183 ms
[2020-05-27 12:15:59] [INFO ] Deduced a trap composed of 28 places in 197 ms
[2020-05-27 12:15:59] [INFO ] Deduced a trap composed of 38 places in 152 ms
[2020-05-27 12:15:59] [INFO ] Deduced a trap composed of 20 places in 160 ms
[2020-05-27 12:16:00] [INFO ] Deduced a trap composed of 28 places in 172 ms
[2020-05-27 12:16:00] [INFO ] Deduced a trap composed of 20 places in 141 ms
[2020-05-27 12:16:00] [INFO ] Deduced a trap composed of 20 places in 140 ms
[2020-05-27 12:16:00] [INFO ] Deduced a trap composed of 21 places in 132 ms
[2020-05-27 12:16:00] [INFO ] Deduced a trap composed of 21 places in 134 ms
[2020-05-27 12:16:00] [INFO ] Deduced a trap composed of 21 places in 170 ms
[2020-05-27 12:16:01] [INFO ] Deduced a trap composed of 25 places in 118 ms
[2020-05-27 12:16:01] [INFO ] Deduced a trap composed of 39 places in 112 ms
[2020-05-27 12:16:01] [INFO ] Deduced a trap composed of 31 places in 110 ms
[2020-05-27 12:16:01] [INFO ] Deduced a trap composed of 24 places in 89 ms
[2020-05-27 12:16:01] [INFO ] Deduced a trap composed of 20 places in 83 ms
[2020-05-27 12:16:01] [INFO ] Deduced a trap composed of 23 places in 82 ms
[2020-05-27 12:16:01] [INFO ] Deduced a trap composed of 26 places in 69 ms
[2020-05-27 12:16:01] [INFO ] Deduced a trap composed of 25 places in 67 ms
[2020-05-27 12:16:01] [INFO ] Deduced a trap composed of 25 places in 51 ms
[2020-05-27 12:16:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s220 s221 s222 s223 s224 s225 s226 s238 s240 s279 s280 s281 s282 s283 s284 s285 s286 s287) 0)") while checking expression at index 5
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 36 out of 703 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 703/703 places, 653/653 transitions.
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 703 transition count 501
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 154 rules applied. Total rules applied 306 place count 551 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 307 place count 550 transition count 499
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 307 place count 550 transition count 454
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 397 place count 505 transition count 454
Symmetric choice reduction at 3 with 65 rule applications. Total rules 462 place count 505 transition count 454
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 65 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 592 place count 440 transition count 389
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 592 place count 440 transition count 363
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 644 place count 414 transition count 363
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 149
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 942 place count 265 transition count 214
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 992 place count 240 transition count 227
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 993 place count 240 transition count 226
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 994 place count 240 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 995 place count 239 transition count 225
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1005 place count 239 transition count 225
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1006 place count 239 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1007 place count 238 transition count 224
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1009 place count 236 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1009 place count 236 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1011 place count 235 transition count 223
Applied a total of 1011 rules in 296 ms. Remains 235 /703 variables (removed 468) and now considering 223/653 (removed 430) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/703 places, 223/653 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3046 ms. (steps per millisecond=328 ) properties seen :[0, 1, 1, 0, 1]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1831 ms. (steps per millisecond=546 ) properties seen :[1, 0]
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 235457 steps, including 0 resets, run visited all 1 properties in 504 ms. (steps per millisecond=467 )
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
BK_STOP 1590581768184
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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-010B"
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"
# 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-010B, 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 r210-tajo-159033475500311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010B.tgz
mv ShieldIIPt-PT-010B 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 '
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 ;