About the Execution of ITS-LoLa for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.130 | 3600000.00 | 750904.00 | 224.50 | TFTFTFTTTFFFTTTT | 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.r211-tajo-159033477900727.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 itslola
Input is ShieldPPPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477900727
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 3.2K May 14 02:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 02:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 19:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 19:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 13 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 955K 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 ShieldPPPt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591324288939
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 02:31:30] [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, -timeout, 3600, -rebuildPNML]
[2020-06-05 02:31:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 02:31:30] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2020-06-05 02:31:30] [INFO ] Transformed 3903 places.
[2020-06-05 02:31:30] [INFO ] Transformed 3553 transitions.
[2020-06-05 02:31:30] [INFO ] Found NUPN structural information;
[2020-06-05 02:31:30] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 297 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 111 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 140 ms. (steps per millisecond=71 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1]
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
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, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
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, 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, 0]
// Phase 1: matrix 3553 rows 3903 cols
[2020-06-05 02:31:31] [INFO ] Computed 551 place invariants in 60 ms
[2020-06-05 02:31:32] [INFO ] [Real]Absence check using 551 positive place invariants in 900 ms returned sat
[2020-06-05 02:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:31:36] [INFO ] [Real]Absence check using state equation in 3672 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:31:38] [INFO ] [Real]Absence check using 551 positive place invariants in 1154 ms returned sat
[2020-06-05 02:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:31:41] [INFO ] [Real]Absence check using state equation in 3155 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:31:42] [INFO ] [Real]Absence check using 551 positive place invariants in 1151 ms returned sat
[2020-06-05 02:31:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:31:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:31:46] [INFO ] [Real]Absence check using state equation in 3364 ms returned (error "Failed to check-sat")
[2020-06-05 02:31:47] [INFO ] [Real]Absence check using 551 positive place invariants in 885 ms returned sat
[2020-06-05 02:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:31:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:31:51] [INFO ] [Real]Absence check using state equation in 3657 ms returned (error "Failed to check-sat")
[2020-06-05 02:31:52] [INFO ] [Real]Absence check using 551 positive place invariants in 975 ms returned sat
[2020-06-05 02:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:31:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:31:56] [INFO ] [Real]Absence check using state equation in 3399 ms returned (error "Failed to check-sat")
[2020-06-05 02:31:57] [INFO ] [Real]Absence check using 551 positive place invariants in 929 ms returned sat
[2020-06-05 02:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:32:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:32:01] [INFO ] [Real]Absence check using state equation in 3491 ms returned (error "Failed to check-sat")
[2020-06-05 02:32:02] [INFO ] [Real]Absence check using 551 positive place invariants in 914 ms returned sat
[2020-06-05 02:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:32:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:32:06] [INFO ] [Real]Absence check using state equation in 3541 ms returned (error "Failed to check-sat")
Support contains 19 out of 3903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Performed 940 Post agglomeration using F-continuation condition.Transition count delta: 940
Iterating post reduction 0 with 940 rules applied. Total rules applied 940 place count 3903 transition count 2613
Reduce places removed 940 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 942 rules applied. Total rules applied 1882 place count 2963 transition count 2611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1883 place count 2962 transition count 2611
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 1883 place count 2962 transition count 2408
Deduced a syphon composed of 203 places in 10 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 2289 place count 2759 transition count 2408
Symmetric choice reduction at 3 with 348 rule applications. Total rules 2637 place count 2759 transition count 2408
Deduced a syphon composed of 348 places in 40 ms
Reduce places removed 348 places and 348 transitions.
Iterating global reduction 3 with 696 rules applied. Total rules applied 3333 place count 2411 transition count 2060
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 3333 place count 2411 transition count 1913
Deduced a syphon composed of 147 places in 6 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 3627 place count 2264 transition count 1913
Performed 840 Post agglomeration using F-continuation condition.Transition count delta: 840
Deduced a syphon composed of 840 places in 10 ms
Reduce places removed 840 places and 0 transitions.
Iterating global reduction 3 with 1680 rules applied. Total rules applied 5307 place count 1424 transition count 1073
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5509 place count 1323 transition count 1073
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 5599 place count 1278 transition count 1073
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5600 place count 1278 transition count 1072
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5601 place count 1277 transition count 1072
Partial Free-agglomeration rule applied 150 times.
Drop transitions removed 150 transitions
Iterating global reduction 4 with 150 rules applied. Total rules applied 5751 place count 1277 transition count 1072
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5752 place count 1276 transition count 1071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5753 place count 1275 transition count 1071
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 5753 place count 1275 transition count 1069
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 5757 place count 1273 transition count 1069
Applied a total of 5757 rules in 1755 ms. Remains 1273 /3903 variables (removed 2630) and now considering 1069/3553 (removed 2484) transitions.
Finished structural reductions, in 1 iterations. Remains : 1273/3903 places, 1069/3553 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7911 ms. (steps per millisecond=126 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 955479 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 955594 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 978562 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 993909 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 963236 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4958 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 4871 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 1858514 steps, run timeout after 30001 ms. (steps per millisecond=61 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 1858514 steps, saw 289537 distinct states, run finished after 30001 ms. (steps per millisecond=61 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1069 rows 1273 cols
[2020-06-05 02:33:20] [INFO ] Computed 550 place invariants in 4 ms
[2020-06-05 02:33:21] [INFO ] [Real]Absence check using 550 positive place invariants in 396 ms returned sat
[2020-06-05 02:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:33:24] [INFO ] [Real]Absence check using state equation in 2595 ms returned sat
[2020-06-05 02:33:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2020-06-05 02:33:24] [INFO ] [Real]Added 7 Read/Feed constraints in 19 ms returned sat
[2020-06-05 02:33:24] [INFO ] Deduced a trap composed of 3 places in 294 ms
[2020-06-05 02:33:24] [INFO ] Deduced a trap composed of 5 places in 228 ms
[2020-06-05 02:33:25] [INFO ] Deduced a trap composed of 6 places in 177 ms
[2020-06-05 02:33:25] [INFO ] Deduced a trap composed of 6 places in 228 ms
[2020-06-05 02:33:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1149 ms
[2020-06-05 02:33:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:33:26] [INFO ] [Nat]Absence check using 550 positive place invariants in 427 ms returned sat
[2020-06-05 02:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:33:28] [INFO ] [Nat]Absence check using state equation in 2711 ms returned sat
[2020-06-05 02:33:28] [INFO ] [Nat]Added 7 Read/Feed constraints in 10 ms returned sat
[2020-06-05 02:33:29] [INFO ] Deduced a trap composed of 4 places in 233 ms
[2020-06-05 02:33:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2020-06-05 02:33:29] [INFO ] Computed and/alt/rep : 1063/2504/1063 causal constraints in 67 ms.
[2020-06-05 02:33:49] [INFO ] Added : 925 causal constraints over 185 iterations in 20114 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 101 ms.
[2020-06-05 02:33:50] [INFO ] [Real]Absence check using 550 positive place invariants in 432 ms returned sat
[2020-06-05 02:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:33:53] [INFO ] [Real]Absence check using state equation in 2905 ms returned sat
[2020-06-05 02:33:53] [INFO ] [Real]Added 7 Read/Feed constraints in 10 ms returned sat
[2020-06-05 02:33:53] [INFO ] Deduced a trap composed of 5 places in 325 ms
[2020-06-05 02:33:53] [INFO ] Deduced a trap composed of 4 places in 212 ms
[2020-06-05 02:33:54] [INFO ] Deduced a trap composed of 7 places in 165 ms
[2020-06-05 02:33:54] [INFO ] Deduced a trap composed of 7 places in 228 ms
[2020-06-05 02:33:54] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-06-05 02:33:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1412 ms
[2020-06-05 02:33:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:33:55] [INFO ] [Nat]Absence check using 550 positive place invariants in 444 ms returned sat
[2020-06-05 02:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:33:57] [INFO ] [Nat]Absence check using state equation in 2712 ms returned sat
[2020-06-05 02:33:57] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2020-06-05 02:33:58] [INFO ] Computed and/alt/rep : 1063/2504/1063 causal constraints in 83 ms.
[2020-06-05 02:34:18] [INFO ] Added : 840 causal constraints over 168 iterations in 20283 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 100 ms.
[2020-06-05 02:34:19] [INFO ] [Real]Absence check using 550 positive place invariants in 390 ms returned sat
[2020-06-05 02:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:34:21] [INFO ] [Real]Absence check using state equation in 2535 ms returned sat
[2020-06-05 02:34:21] [INFO ] [Real]Added 7 Read/Feed constraints in 11 ms returned sat
[2020-06-05 02:34:21] [INFO ] Deduced a trap composed of 5 places in 249 ms
[2020-06-05 02:34:22] [INFO ] Deduced a trap composed of 3 places in 198 ms
[2020-06-05 02:34:22] [INFO ] Deduced a trap composed of 6 places in 198 ms
[2020-06-05 02:34:22] [INFO ] Deduced a trap composed of 7 places in 288 ms
[2020-06-05 02:34:23] [INFO ] Deduced a trap composed of 4 places in 268 ms
[2020-06-05 02:34:23] [INFO ] Deduced a trap composed of 5 places in 274 ms
[2020-06-05 02:34:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1772 ms
[2020-06-05 02:34:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:34:24] [INFO ] [Nat]Absence check using 550 positive place invariants in 405 ms returned sat
[2020-06-05 02:34:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:34:26] [INFO ] [Nat]Absence check using state equation in 2854 ms returned sat
[2020-06-05 02:34:26] [INFO ] [Nat]Added 7 Read/Feed constraints in 10 ms returned sat
[2020-06-05 02:34:27] [INFO ] Deduced a trap composed of 6 places in 256 ms
[2020-06-05 02:34:27] [INFO ] Deduced a trap composed of 7 places in 165 ms
[2020-06-05 02:34:27] [INFO ] Deduced a trap composed of 4 places in 160 ms
[2020-06-05 02:34:27] [INFO ] Deduced a trap composed of 5 places in 190 ms
[2020-06-05 02:34:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 945 ms
[2020-06-05 02:34:27] [INFO ] Computed and/alt/rep : 1063/2504/1063 causal constraints in 70 ms.
[2020-06-05 02:34:48] [INFO ] Added : 1020 causal constraints over 204 iterations in 20868 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-06-05 02:34:49] [INFO ] [Real]Absence check using 550 positive place invariants in 393 ms returned sat
[2020-06-05 02:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:34:52] [INFO ] [Real]Absence check using state equation in 2689 ms returned sat
[2020-06-05 02:34:52] [INFO ] [Real]Added 7 Read/Feed constraints in 18 ms returned sat
[2020-06-05 02:34:52] [INFO ] Deduced a trap composed of 3 places in 254 ms
[2020-06-05 02:34:52] [INFO ] Deduced a trap composed of 5 places in 204 ms
[2020-06-05 02:34:53] [INFO ] Deduced a trap composed of 5 places in 287 ms
[2020-06-05 02:34:53] [INFO ] Deduced a trap composed of 6 places in 226 ms
[2020-06-05 02:34:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1191 ms
[2020-06-05 02:34:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:34:54] [INFO ] [Nat]Absence check using 550 positive place invariants in 409 ms returned sat
[2020-06-05 02:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:34:57] [INFO ] [Nat]Absence check using state equation in 3512 ms returned sat
[2020-06-05 02:34:57] [INFO ] [Nat]Added 7 Read/Feed constraints in 13 ms returned sat
[2020-06-05 02:34:57] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-06-05 02:34:58] [INFO ] Deduced a trap composed of 5 places in 213 ms
[2020-06-05 02:34:58] [INFO ] Deduced a trap composed of 6 places in 189 ms
[2020-06-05 02:34:58] [INFO ] Deduced a trap composed of 6 places in 159 ms
[2020-06-05 02:34:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1052 ms
[2020-06-05 02:34:58] [INFO ] Computed and/alt/rep : 1063/2504/1063 causal constraints in 41 ms.
[2020-06-05 02:35:15] [INFO ] Added : 1017 causal constraints over 205 iterations in 16903 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 50 ms.
[2020-06-05 02:35:16] [INFO ] [Real]Absence check using 550 positive place invariants in 283 ms returned sat
[2020-06-05 02:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:35:18] [INFO ] [Real]Absence check using state equation in 2722 ms returned sat
[2020-06-05 02:35:18] [INFO ] [Real]Added 7 Read/Feed constraints in 11 ms returned sat
[2020-06-05 02:35:19] [INFO ] Deduced a trap composed of 6 places in 259 ms
[2020-06-05 02:35:19] [INFO ] Deduced a trap composed of 5 places in 139 ms
[2020-06-05 02:35:19] [INFO ] Deduced a trap composed of 3 places in 137 ms
[2020-06-05 02:35:19] [INFO ] Deduced a trap composed of 6 places in 147 ms
[2020-06-05 02:35:19] [INFO ] Deduced a trap composed of 4 places in 214 ms
[2020-06-05 02:35:20] [INFO ] Deduced a trap composed of 7 places in 149 ms
[2020-06-05 02:35:20] [INFO ] Deduced a trap composed of 4 places in 158 ms
[2020-06-05 02:35:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1467 ms
[2020-06-05 02:35:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:35:21] [INFO ] [Nat]Absence check using 550 positive place invariants in 455 ms returned sat
[2020-06-05 02:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:35:23] [INFO ] [Nat]Absence check using state equation in 2770 ms returned sat
[2020-06-05 02:35:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 10 ms returned sat
[2020-06-05 02:35:24] [INFO ] Deduced a trap composed of 5 places in 201 ms
[2020-06-05 02:35:24] [INFO ] Deduced a trap composed of 6 places in 175 ms
[2020-06-05 02:35:24] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2020-06-05 02:35:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 678 ms
[2020-06-05 02:35:24] [INFO ] Computed and/alt/rep : 1063/2504/1063 causal constraints in 59 ms.
[2020-06-05 02:35:44] [INFO ] Added : 925 causal constraints over 185 iterations in 20227 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 83 ms.
[2020-06-05 02:35:45] [INFO ] [Real]Absence check using 550 positive place invariants in 417 ms returned sat
[2020-06-05 02:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:35:48] [INFO ] [Real]Absence check using state equation in 2837 ms returned sat
[2020-06-05 02:35:48] [INFO ] [Real]Added 7 Read/Feed constraints in 10 ms returned sat
[2020-06-05 02:35:48] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-06-05 02:35:49] [INFO ] Deduced a trap composed of 3 places in 249 ms
[2020-06-05 02:35:49] [INFO ] Deduced a trap composed of 4 places in 167 ms
[2020-06-05 02:35:49] [INFO ] Deduced a trap composed of 4 places in 250 ms
[2020-06-05 02:35:49] [INFO ] Deduced a trap composed of 6 places in 205 ms
[2020-06-05 02:35:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1394 ms
[2020-06-05 02:35:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:35:50] [INFO ] [Nat]Absence check using 550 positive place invariants in 311 ms returned sat
[2020-06-05 02:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:35:53] [INFO ] [Nat]Absence check using state equation in 2817 ms returned sat
[2020-06-05 02:35:53] [INFO ] [Nat]Added 7 Read/Feed constraints in 10 ms returned sat
[2020-06-05 02:35:53] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-06-05 02:35:53] [INFO ] Deduced a trap composed of 5 places in 246 ms
[2020-06-05 02:35:54] [INFO ] Deduced a trap composed of 5 places in 238 ms
[2020-06-05 02:35:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 929 ms
[2020-06-05 02:35:54] [INFO ] Computed and/alt/rep : 1063/2504/1063 causal constraints in 65 ms.
[2020-06-05 02:36:14] [INFO ] Added : 870 causal constraints over 174 iterations in 20327 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 101 ms.
[2020-06-05 02:36:15] [INFO ] [Real]Absence check using 550 positive place invariants in 443 ms returned sat
[2020-06-05 02:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:36:18] [INFO ] [Real]Absence check using state equation in 3005 ms returned sat
[2020-06-05 02:36:18] [INFO ] [Real]Added 7 Read/Feed constraints in 24 ms returned sat
[2020-06-05 02:36:18] [INFO ] Deduced a trap composed of 4 places in 283 ms
[2020-06-05 02:36:18] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-06-05 02:36:19] [INFO ] Deduced a trap composed of 7 places in 248 ms
[2020-06-05 02:36:19] [INFO ] Deduced a trap composed of 5 places in 249 ms
[2020-06-05 02:36:19] [INFO ] Deduced a trap composed of 6 places in 218 ms
[2020-06-05 02:36:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1497 ms
[2020-06-05 02:36:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:36:20] [INFO ] [Nat]Absence check using 550 positive place invariants in 406 ms returned sat
[2020-06-05 02:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:36:23] [INFO ] [Nat]Absence check using state equation in 2808 ms returned sat
[2020-06-05 02:36:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 10 ms returned sat
[2020-06-05 02:36:23] [INFO ] Deduced a trap composed of 4 places in 249 ms
[2020-06-05 02:36:23] [INFO ] Deduced a trap composed of 6 places in 256 ms
[2020-06-05 02:36:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 622 ms
[2020-06-05 02:36:24] [INFO ] Computed and/alt/rep : 1063/2504/1063 causal constraints in 58 ms.
[2020-06-05 02:36:44] [INFO ] Added : 895 causal constraints over 179 iterations in 20189 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 87 ms.
Incomplete Parikh walk after 135200 steps, including 1000 resets, run finished after 1196 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 133600 steps, including 1000 resets, run finished after 975 ms. (steps per millisecond=137 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 142600 steps, including 698 resets, run finished after 1290 ms. (steps per millisecond=110 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 127000 steps, including 1000 resets, run finished after 948 ms. (steps per millisecond=133 ) properties seen :[0, 0, 1, 1, 0, 0, 0] could not realise parikh vector
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 174100 steps, including 508 resets, run finished after 1462 ms. (steps per millisecond=119 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 136600 steps, including 913 resets, run finished after 1419 ms. (steps per millisecond=96 ) properties seen :[0, 1, 0, 1, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 136000 steps, including 1000 resets, run finished after 1122 ms. (steps per millisecond=121 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 1273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1273/1273 places, 1069/1069 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1273 transition count 1067
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1271 transition count 1067
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 1271 transition count 1062
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 1266 transition count 1062
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 1261 transition count 1057
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 1260 transition count 1057
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 1260 transition count 1056
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 1259 transition count 1056
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 1258 transition count 1055
Applied a total of 29 rules in 150 ms. Remains 1258 /1273 variables (removed 15) and now considering 1055/1069 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 1258/1273 places, 1055/1069 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6721 ms. (steps per millisecond=148 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4796 ms. (steps per millisecond=208 ) properties seen :[0, 0]
Interrupted Best-First random walk after 989752 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 1902608 steps, run timeout after 30001 ms. (steps per millisecond=63 ) properties seen :[0, 0]
Probabilistic random walk after 1902608 steps, saw 288541 distinct states, run finished after 30003 ms. (steps per millisecond=63 ) properties seen :[0, 0]
// Phase 1: matrix 1055 rows 1258 cols
[2020-06-05 02:37:39] [INFO ] Computed 550 place invariants in 3 ms
[2020-06-05 02:37:40] [INFO ] [Real]Absence check using 550 positive place invariants in 410 ms returned sat
[2020-06-05 02:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:37:42] [INFO ] [Real]Absence check using state equation in 2746 ms returned sat
[2020-06-05 02:37:42] [INFO ] State equation strengthened by 7 read => feed constraints.
[2020-06-05 02:37:42] [INFO ] [Real]Added 7 Read/Feed constraints in 25 ms returned sat
[2020-06-05 02:37:43] [INFO ] Deduced a trap composed of 3 places in 272 ms
[2020-06-05 02:37:43] [INFO ] Deduced a trap composed of 3 places in 228 ms
[2020-06-05 02:37:43] [INFO ] Deduced a trap composed of 7 places in 214 ms
[2020-06-05 02:37:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 885 ms
[2020-06-05 02:37:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:37:44] [INFO ] [Nat]Absence check using 550 positive place invariants in 385 ms returned sat
[2020-06-05 02:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:37:47] [INFO ] [Nat]Absence check using state equation in 2714 ms returned sat
[2020-06-05 02:37:47] [INFO ] [Nat]Added 7 Read/Feed constraints in 11 ms returned sat
[2020-06-05 02:37:47] [INFO ] Deduced a trap composed of 7 places in 272 ms
[2020-06-05 02:37:47] [INFO ] Deduced a trap composed of 3 places in 258 ms
[2020-06-05 02:37:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 692 ms
[2020-06-05 02:37:47] [INFO ] Computed and/alt/rep : 1049/2492/1049 causal constraints in 91 ms.
[2020-06-05 02:38:08] [INFO ] Added : 865 causal constraints over 173 iterations in 20233 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 85 ms.
[2020-06-05 02:38:08] [INFO ] [Real]Absence check using 550 positive place invariants in 415 ms returned sat
[2020-06-05 02:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:38:12] [INFO ] [Real]Absence check using state equation in 3324 ms returned sat
[2020-06-05 02:38:12] [INFO ] [Real]Added 7 Read/Feed constraints in 27 ms returned sat
[2020-06-05 02:38:12] [INFO ] Deduced a trap composed of 3 places in 238 ms
[2020-06-05 02:38:12] [INFO ] Deduced a trap composed of 6 places in 206 ms
[2020-06-05 02:38:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 594 ms
[2020-06-05 02:38:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:38:13] [INFO ] [Nat]Absence check using 550 positive place invariants in 439 ms returned sat
[2020-06-05 02:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:38:16] [INFO ] [Nat]Absence check using state equation in 3025 ms returned sat
[2020-06-05 02:38:16] [INFO ] [Nat]Added 7 Read/Feed constraints in 11 ms returned sat
[2020-06-05 02:38:17] [INFO ] Deduced a trap composed of 5 places in 244 ms
[2020-06-05 02:38:17] [INFO ] Deduced a trap composed of 4 places in 226 ms
[2020-06-05 02:38:17] [INFO ] Deduced a trap composed of 4 places in 227 ms
[2020-06-05 02:38:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 855 ms
[2020-06-05 02:38:17] [INFO ] Computed and/alt/rep : 1049/2492/1049 causal constraints in 67 ms.
[2020-06-05 02:38:37] [INFO ] Added : 880 causal constraints over 176 iterations in 20214 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 77 ms.
Incomplete Parikh walk after 126000 steps, including 997 resets, run finished after 1171 ms. (steps per millisecond=107 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 136700 steps, including 1000 resets, run finished after 882 ms. (steps per millisecond=154 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 1258 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1258/1258 places, 1055/1055 transitions.
Applied a total of 0 rules in 27 ms. Remains 1258 /1258 variables (removed 0) and now considering 1055/1055 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1258/1258 places, 1055/1055 transitions.
Starting structural reductions, iteration 0 : 1258/1258 places, 1055/1055 transitions.
Applied a total of 0 rules in 24 ms. Remains 1258 /1258 variables (removed 0) and now considering 1055/1055 (removed 0) transitions.
// Phase 1: matrix 1055 rows 1258 cols
[2020-06-05 02:38:40] [INFO ] Computed 550 place invariants in 3 ms
[2020-06-05 02:38:44] [INFO ] Implicit Places using invariants in 4059 ms returned [1241, 1245]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4065 ms to find 2 implicit places.
[2020-06-05 02:38:44] [INFO ] Redundant transitions in 114 ms returned []
// Phase 1: matrix 1055 rows 1256 cols
[2020-06-05 02:38:44] [INFO ] Computed 548 place invariants in 4 ms
[2020-06-05 02:38:47] [INFO ] Dead Transitions using invariants and state equation in 3089 ms returned []
Starting structural reductions, iteration 1 : 1256/1258 places, 1055/1055 transitions.
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1256 transition count 1055
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 1254 transition count 1053
Applied a total of 6 rules in 43 ms. Remains 1254 /1256 variables (removed 2) and now considering 1053/1055 (removed 2) transitions.
// Phase 1: matrix 1053 rows 1254 cols
[2020-06-05 02:38:47] [INFO ] Computed 548 place invariants in 3 ms
[2020-06-05 02:38:51] [INFO ] Implicit Places using invariants in 4186 ms returned []
// Phase 1: matrix 1053 rows 1254 cols
[2020-06-05 02:38:51] [INFO ] Computed 548 place invariants in 7 ms
[2020-06-05 02:38:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-05 02:39:07] [INFO ] Implicit Places using invariants and state equation in 15629 ms returned []
Implicit Place search using SMT with State Equation took 19821 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1254/1258 places, 1053/1055 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7245 ms. (steps per millisecond=138 ) properties seen :[0, 0]
Interrupted Best-First random walk after 940537 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen :[0, 0]
Interrupted Best-First random walk after 916445 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 1744103 steps, run timeout after 30001 ms. (steps per millisecond=58 ) properties seen :[0, 0]
Probabilistic random walk after 1744103 steps, saw 267195 distinct states, run finished after 30001 ms. (steps per millisecond=58 ) properties seen :[0, 0]
// Phase 1: matrix 1053 rows 1254 cols
[2020-06-05 02:39:54] [INFO ] Computed 548 place invariants in 8 ms
[2020-06-05 02:39:55] [INFO ] [Real]Absence check using 548 positive place invariants in 439 ms returned sat
[2020-06-05 02:39:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:39:57] [INFO ] [Real]Absence check using state equation in 2685 ms returned sat
[2020-06-05 02:39:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-05 02:39:58] [INFO ] [Real]Added 5 Read/Feed constraints in 9 ms returned sat
[2020-06-05 02:39:58] [INFO ] Deduced a trap composed of 7 places in 287 ms
[2020-06-05 02:39:58] [INFO ] Deduced a trap composed of 3 places in 230 ms
[2020-06-05 02:39:58] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-06-05 02:39:59] [INFO ] Deduced a trap composed of 6 places in 242 ms
[2020-06-05 02:39:59] [INFO ] Deduced a trap composed of 4 places in 247 ms
[2020-06-05 02:39:59] [INFO ] Deduced a trap composed of 4 places in 225 ms
[2020-06-05 02:40:00] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2020-06-05 02:40:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2035 ms
[2020-06-05 02:40:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:40:00] [INFO ] [Nat]Absence check using 548 positive place invariants in 400 ms returned sat
[2020-06-05 02:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:40:03] [INFO ] [Nat]Absence check using state equation in 2649 ms returned sat
[2020-06-05 02:40:03] [INFO ] [Nat]Added 5 Read/Feed constraints in 16 ms returned sat
[2020-06-05 02:40:03] [INFO ] Deduced a trap composed of 4 places in 280 ms
[2020-06-05 02:40:03] [INFO ] Deduced a trap composed of 7 places in 251 ms
[2020-06-05 02:40:04] [INFO ] Deduced a trap composed of 7 places in 250 ms
[2020-06-05 02:40:04] [INFO ] Deduced a trap composed of 4 places in 248 ms
[2020-06-05 02:40:04] [INFO ] Deduced a trap composed of 7 places in 240 ms
[2020-06-05 02:40:05] [INFO ] Deduced a trap composed of 3 places in 242 ms
[2020-06-05 02:40:05] [INFO ] Deduced a trap composed of 6 places in 241 ms
[2020-06-05 02:40:05] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-06-05 02:40:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2408 ms
[2020-06-05 02:40:05] [INFO ] Computed and/alt/rep : 1047/2479/1047 causal constraints in 47 ms.
[2020-06-05 02:40:25] [INFO ] Added : 880 causal constraints over 176 iterations in 20108 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
[2020-06-05 02:40:26] [INFO ] [Real]Absence check using 548 positive place invariants in 406 ms returned sat
[2020-06-05 02:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:40:29] [INFO ] [Real]Absence check using state equation in 2696 ms returned sat
[2020-06-05 02:40:29] [INFO ] [Real]Added 5 Read/Feed constraints in 13 ms returned sat
[2020-06-05 02:40:29] [INFO ] Deduced a trap composed of 3 places in 225 ms
[2020-06-05 02:40:29] [INFO ] Deduced a trap composed of 5 places in 223 ms
[2020-06-05 02:40:30] [INFO ] Deduced a trap composed of 4 places in 187 ms
[2020-06-05 02:40:30] [INFO ] Deduced a trap composed of 4 places in 182 ms
[2020-06-05 02:40:30] [INFO ] Deduced a trap composed of 6 places in 209 ms
[2020-06-05 02:40:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1265 ms
[2020-06-05 02:40:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:40:31] [INFO ] [Nat]Absence check using 548 positive place invariants in 443 ms returned sat
[2020-06-05 02:40:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:40:34] [INFO ] [Nat]Absence check using state equation in 2919 ms returned sat
[2020-06-05 02:40:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 9 ms returned sat
[2020-06-05 02:40:34] [INFO ] Deduced a trap composed of 5 places in 212 ms
[2020-06-05 02:40:34] [INFO ] Deduced a trap composed of 3 places in 183 ms
[2020-06-05 02:40:34] [INFO ] Deduced a trap composed of 4 places in 195 ms
[2020-06-05 02:40:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 732 ms
[2020-06-05 02:40:35] [INFO ] Computed and/alt/rep : 1047/2479/1047 causal constraints in 55 ms.
[2020-06-05 02:40:55] [INFO ] Added : 985 causal constraints over 197 iterations in 20210 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 97 ms.
Incomplete Parikh walk after 168900 steps, including 1000 resets, run finished after 1284 ms. (steps per millisecond=131 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 135400 steps, including 1000 resets, run finished after 855 ms. (steps per millisecond=158 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 1254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1254/1254 places, 1053/1053 transitions.
Applied a total of 0 rules in 56 ms. Remains 1254 /1254 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1254/1254 places, 1053/1053 transitions.
Starting structural reductions, iteration 0 : 1254/1254 places, 1053/1053 transitions.
Applied a total of 0 rules in 43 ms. Remains 1254 /1254 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
// Phase 1: matrix 1053 rows 1254 cols
[2020-06-05 02:40:57] [INFO ] Computed 548 place invariants in 9 ms
[2020-06-05 02:41:01] [INFO ] Implicit Places using invariants in 4141 ms returned []
// Phase 1: matrix 1053 rows 1254 cols
[2020-06-05 02:41:01] [INFO ] Computed 548 place invariants in 8 ms
[2020-06-05 02:41:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-05 02:41:16] [INFO ] Implicit Places using invariants and state equation in 14808 ms returned []
Implicit Place search using SMT with State Equation took 18952 ms to find 0 implicit places.
[2020-06-05 02:41:16] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1053 rows 1254 cols
[2020-06-05 02:41:16] [INFO ] Computed 548 place invariants in 4 ms
[2020-06-05 02:41:19] [INFO ] Dead Transitions using invariants and state equation in 3284 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1254/1254 places, 1053/1053 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 916 ms. (steps per millisecond=109 ) properties seen :[0, 0]
// Phase 1: matrix 1053 rows 1254 cols
[2020-06-05 02:41:20] [INFO ] Computed 548 place invariants in 3 ms
[2020-06-05 02:41:21] [INFO ] [Real]Absence check using 548 positive place invariants in 395 ms returned sat
[2020-06-05 02:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:24] [INFO ] [Real]Absence check using state equation in 2542 ms returned sat
[2020-06-05 02:41:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-05 02:41:24] [INFO ] [Real]Added 5 Read/Feed constraints in 16 ms returned sat
[2020-06-05 02:41:24] [INFO ] Deduced a trap composed of 7 places in 258 ms
[2020-06-05 02:41:24] [INFO ] Deduced a trap composed of 3 places in 223 ms
[2020-06-05 02:41:24] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-06-05 02:41:25] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-06-05 02:41:25] [INFO ] Deduced a trap composed of 4 places in 225 ms
[2020-06-05 02:41:25] [INFO ] Deduced a trap composed of 4 places in 217 ms
[2020-06-05 02:41:26] [INFO ] Deduced a trap composed of 6 places in 221 ms
[2020-06-05 02:41:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1968 ms
[2020-06-05 02:41:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:26] [INFO ] [Nat]Absence check using 548 positive place invariants in 406 ms returned sat
[2020-06-05 02:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:29] [INFO ] [Nat]Absence check using state equation in 2662 ms returned sat
[2020-06-05 02:41:29] [INFO ] [Nat]Added 5 Read/Feed constraints in 14 ms returned sat
[2020-06-05 02:41:29] [INFO ] Deduced a trap composed of 4 places in 267 ms
[2020-06-05 02:41:30] [INFO ] Deduced a trap composed of 7 places in 244 ms
[2020-06-05 02:41:30] [INFO ] Deduced a trap composed of 7 places in 334 ms
[2020-06-05 02:41:30] [INFO ] Deduced a trap composed of 4 places in 209 ms
[2020-06-05 02:41:30] [INFO ] Deduced a trap composed of 7 places in 198 ms
[2020-06-05 02:41:31] [INFO ] Deduced a trap composed of 3 places in 187 ms
[2020-06-05 02:41:31] [INFO ] Deduced a trap composed of 6 places in 148 ms
[2020-06-05 02:41:31] [INFO ] Deduced a trap composed of 5 places in 219 ms
[2020-06-05 02:41:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2211 ms
[2020-06-05 02:41:31] [INFO ] Computed and/alt/rep : 1047/2479/1047 causal constraints in 51 ms.
[2020-06-05 02:41:46] [INFO ] Added : 790 causal constraints over 158 iterations in 14501 ms. Result :unknown
[2020-06-05 02:41:46] [INFO ] [Real]Absence check using 548 positive place invariants in 429 ms returned sat
[2020-06-05 02:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:49] [INFO ] [Real]Absence check using state equation in 2727 ms returned sat
[2020-06-05 02:41:49] [INFO ] [Real]Added 5 Read/Feed constraints in 10 ms returned sat
[2020-06-05 02:41:49] [INFO ] Deduced a trap composed of 3 places in 222 ms
[2020-06-05 02:41:50] [INFO ] Deduced a trap composed of 5 places in 206 ms
[2020-06-05 02:41:50] [INFO ] Deduced a trap composed of 4 places in 206 ms
[2020-06-05 02:41:50] [INFO ] Deduced a trap composed of 4 places in 219 ms
[2020-06-05 02:41:50] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2020-06-05 02:41:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1292 ms
[2020-06-05 02:41:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:41:51] [INFO ] [Nat]Absence check using 548 positive place invariants in 424 ms returned sat
[2020-06-05 02:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:54] [INFO ] [Nat]Absence check using state equation in 3185 ms returned sat
[2020-06-05 02:41:54] [INFO ] [Nat]Added 5 Read/Feed constraints in 14 ms returned sat
[2020-06-05 02:41:55] [INFO ] Deduced a trap composed of 5 places in 238 ms
[2020-06-05 02:41:55] [INFO ] Deduced a trap composed of 3 places in 219 ms
[2020-06-05 02:41:55] [INFO ] Deduced a trap composed of 4 places in 219 ms
[2020-06-05 02:41:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 839 ms
[2020-06-05 02:41:55] [INFO ] Computed and/alt/rep : 1047/2479/1047 causal constraints in 73 ms.
[2020-06-05 02:42:10] [INFO ] Added : 740 causal constraints over 148 iterations in 15323 ms. Result :unknown
Partial Free-agglomeration rule applied 292 times.
Drop transitions removed 292 transitions
Iterating global reduction 0 with 292 rules applied. Total rules applied 292 place count 1254 transition count 1053
Partial Post-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 0 with 51 rules applied. Total rules applied 343 place count 1254 transition count 1053
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 344 place count 1254 transition count 1052
Applied a total of 344 rules in 146 ms. Remains 1254 /1254 variables (removed 0) and now considering 1052/1053 (removed 1) transitions.
// Phase 1: matrix 1052 rows 1254 cols
[2020-06-05 02:42:11] [INFO ] Computed 548 place invariants in 4 ms
[2020-06-05 02:42:11] [INFO ] [Real]Absence check using 548 positive place invariants in 418 ms returned sat
[2020-06-05 02:42:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:42:14] [INFO ] [Real]Absence check using state equation in 2691 ms returned sat
[2020-06-05 02:42:14] [INFO ] State equation strengthened by 286 read => feed constraints.
[2020-06-05 02:42:14] [INFO ] [Real]Added 286 Read/Feed constraints in 61 ms returned sat
[2020-06-05 02:42:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:42:15] [INFO ] [Nat]Absence check using 548 positive place invariants in 417 ms returned sat
[2020-06-05 02:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:42:18] [INFO ] [Nat]Absence check using state equation in 2837 ms returned sat
[2020-06-05 02:42:18] [INFO ] [Nat]Added 286 Read/Feed constraints in 58 ms returned sat
[2020-06-05 02:42:18] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-05 02:42:18] [INFO ] Deduced a trap composed of 3 places in 18 ms
[2020-06-05 02:42:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2020-06-05 02:42:18] [INFO ] Computed and/alt/rep : 1048/3573/1048 causal constraints in 96 ms.
[2020-06-05 02:42:38] [INFO ] Added : 805 causal constraints over 161 iterations in 20072 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
[2020-06-05 02:42:39] [INFO ] [Real]Absence check using 548 positive place invariants in 411 ms returned sat
[2020-06-05 02:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:42:42] [INFO ] [Real]Absence check using state equation in 2750 ms returned sat
[2020-06-05 02:42:42] [INFO ] [Real]Added 286 Read/Feed constraints in 82 ms returned sat
[2020-06-05 02:42:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:42:42] [INFO ] [Nat]Absence check using 548 positive place invariants in 432 ms returned sat
[2020-06-05 02:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:42:45] [INFO ] [Nat]Absence check using state equation in 2925 ms returned sat
[2020-06-05 02:42:45] [INFO ] [Nat]Added 286 Read/Feed constraints in 51 ms returned sat
[2020-06-05 02:42:45] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-05 02:42:45] [INFO ] Deduced a trap composed of 3 places in 19 ms
[2020-06-05 02:42:46] [INFO ] Deduced a trap composed of 3 places in 20 ms
[2020-06-05 02:42:46] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-06-05 02:42:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 429 ms
[2020-06-05 02:42:46] [INFO ] Computed and/alt/rep : 1048/3573/1048 causal constraints in 89 ms.
[2020-06-05 02:43:06] [INFO ] Added : 800 causal constraints over 160 iterations in 20211 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 74 ms.
[2020-06-05 02:43:06] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2020-06-05 02:43:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 24 ms.
[2020-06-05 02:43:07] [INFO ] Flatten gal took : 167 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPt-PT-050B @ 3570 seconds
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for ReachabilityFireability @ ShieldPPPt-PT-050B
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 02:43:07 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p199) AND (1 <= p1185))))",
"processed_size": 38,
"rewrites": 1
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p309 <= 0) OR (p230 <= 0) OR ((1 <= p105) AND (1 <= p432) AND (1 <= p954)))))",
"processed_size": 87,
"rewrites": 2
},
"result":
{
"edges": 146,
"markings": 147,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 27720,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 4621,
"conflict_clusters": 411,
"places": 1254,
"places_significant": 706,
"singleton_clusters": 0,
"transitions": 1053
},
"result":
{
"preliminary_value": "no no ",
"value": "no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2307/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 40128
lola: finding significant places
lola: 1254 places, 1053 transitions, 706 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p1185 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p432 <= 1)
lola: LP says that atomic proposition is always true: (p954 <= 1)
lola: E (F (((1 <= p199) AND (1 <= p1185)))) : A (G (((p309 <= 0) OR (p230 <= 0) OR ((1 <= p105) AND (1 <= p432) AND (1 <= p954)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p199) AND (1 <= p1185))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p199) AND (1 <= p1185))))
lola: processed formula length: 38
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: formula 0: ((1 <= p199) AND (1 <= p1185))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 9 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p309 <= 0) OR (p230 <= 0) OR ((1 <= p105) AND (1 <= p432) AND (1 <= p954)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p309 <= 0) OR (p230 <= 0) OR ((1 <= p105) AND (1 <= p432) AND (1 <= p954)))))
lola: processed formula length: 87
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p309) AND (1 <= p230) AND ((p105 <= 0) OR (p432 <= 0) OR (p954 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 147 markings, 146 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no
lola:
preliminary result: no no
lola: memory consumption: 27720 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
--------------------
content from stderr:
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="ShieldPPPt-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is ShieldPPPt-PT-050B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477900727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;