About the Execution of 2020-gold for ShieldPPPs-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7618.063 | 3600000.00 | 668357.00 | 1468.60 | FFTFTFTTFFFTTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r227-tall-162098231200344.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is ShieldPPPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231200344
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 12:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 1.8M May 5 16:52 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 ShieldPPPs-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1621175335984
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 14:28:57] [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]
[2021-05-16 14:28:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:28:57] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2021-05-16 14:28:58] [INFO ] Transformed 6803 places.
[2021-05-16 14:28:58] [INFO ] Transformed 6303 transitions.
[2021-05-16 14:28:58] [INFO ] Found NUPN structural information;
[2021-05-16 14:28:58] [INFO ] Parsed PT model containing 6803 places and 6303 transitions in 627 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 209 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 252 ms. (steps per millisecond=39 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1]
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 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, 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, 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, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 6303 rows 6803 cols
[2021-05-16 14:28:59] [INFO ] Computed 1101 place invariants in 121 ms
[2021-05-16 14:29:04] [INFO ] [Real]Absence check using 1101 positive place invariants in 4078 ms returned sat
[2021-05-16 14:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:29:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2021-05-16 14:29:09] [INFO ] [Real]Absence check using 1101 positive place invariants in 3892 ms returned sat
[2021-05-16 14:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:29:09] [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: Broken pipe (>= t2232 0)") while checking expression at index 1
[2021-05-16 14:29:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 14:29:14] [INFO ] [Real]Absence check using 1101 positive place invariants in 3963 ms returned (error "Failed to check-sat")
[2021-05-16 14:29:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:29:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2021-05-16 14:29:19] [INFO ] [Real]Absence check using 1101 positive place invariants in 4025 ms returned sat
[2021-05-16 14:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:29:19] [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: Broken pipe (>= t1585 0)") while checking expression at index 3
[2021-05-16 14:29:24] [INFO ] [Real]Absence check using 1101 positive place invariants in 3834 ms returned sat
[2021-05-16 14:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:29:24] [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: Broken pipe (>= t2664 0)") while checking expression at index 4
[2021-05-16 14:29:29] [INFO ] [Real]Absence check using 1101 positive place invariants in 3722 ms returned sat
[2021-05-16 14:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:29:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 5
[2021-05-16 14:29:34] [INFO ] [Real]Absence check using 1101 positive place invariants in 3720 ms returned sat
[2021-05-16 14:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:29:34] [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: Broken pipe (>= t3329 0)") while checking expression at index 6
[2021-05-16 14:29:39] [INFO ] [Real]Absence check using 1101 positive place invariants in 3837 ms returned sat
[2021-05-16 14:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:29:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 7
[2021-05-16 14:29:44] [INFO ] [Real]Absence check using 1101 positive place invariants in 3858 ms returned sat
[2021-05-16 14:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:29:44] [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: Broken pipe (>= t1565 0)") while checking expression at index 8
[2021-05-16 14:29:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 14:29:49] [INFO ] [Real]Absence check using 1101 positive place invariants in 4167 ms returned (error "Failed to check-sat")
[2021-05-16 14:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:29:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 9
Support contains 63 out of 6803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Performed 691 Post agglomeration using F-continuation condition.Transition count delta: 691
Iterating post reduction 0 with 691 rules applied. Total rules applied 691 place count 6803 transition count 5612
Reduce places removed 691 places and 0 transitions.
Iterating post reduction 1 with 691 rules applied. Total rules applied 1382 place count 6112 transition count 5612
Performed 496 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 496 Pre rules applied. Total rules applied 1382 place count 6112 transition count 5116
Deduced a syphon composed of 496 places in 64 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 2 with 992 rules applied. Total rules applied 2374 place count 5616 transition count 5116
Symmetric choice reduction at 2 with 683 rule applications. Total rules 3057 place count 5616 transition count 5116
Deduced a syphon composed of 683 places in 26 ms
Reduce places removed 683 places and 683 transitions.
Iterating global reduction 2 with 1366 rules applied. Total rules applied 4423 place count 4933 transition count 4433
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 284 Pre rules applied. Total rules applied 4423 place count 4933 transition count 4149
Deduced a syphon composed of 284 places in 65 ms
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 2 with 568 rules applied. Total rules applied 4991 place count 4649 transition count 4149
Performed 1482 Post agglomeration using F-continuation condition.Transition count delta: 1482
Deduced a syphon composed of 1482 places in 9 ms
Reduce places removed 1482 places and 0 transitions.
Iterating global reduction 2 with 2964 rules applied. Total rules applied 7955 place count 3167 transition count 2667
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 876 times.
Drop transitions removed 876 transitions
Iterating global reduction 2 with 876 rules applied. Total rules applied 8831 place count 3167 transition count 2667
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8833 place count 3167 transition count 2667
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8834 place count 3166 transition count 2666
Applied a total of 8834 rules in 3659 ms. Remains 3166 /6803 variables (removed 3637) and now considering 2666/6303 (removed 3637) transitions.
Finished structural reductions, in 1 iterations. Remains : 3166/6803 places, 2666/6303 transitions.
Incomplete random walk after 1000000 steps, including 54 resets, run finished after 24983 ms. (steps per millisecond=40 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 0, 1, 1]
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 308883 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=61 ) properties seen :[1, 0, 0, 0]
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 343631 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 341304 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 313730 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=62 ) properties seen :[0, 0, 1]
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2666 rows 3166 cols
[2021-05-16 14:30:38] [INFO ] Computed 1101 place invariants in 150 ms
[2021-05-16 14:30:39] [INFO ] [Real]Absence check using 1046 positive place invariants in 1354 ms returned sat
[2021-05-16 14:30:40] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 87 ms returned sat
[2021-05-16 14:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:30:59] [INFO ] [Real]Absence check using state equation in 19755 ms returned sat
[2021-05-16 14:30:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:31:01] [INFO ] [Nat]Absence check using 1046 positive place invariants in 1320 ms returned sat
[2021-05-16 14:31:01] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 86 ms returned sat
[2021-05-16 14:31:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:31:21] [INFO ] [Nat]Absence check using state equation in 19864 ms returned sat
[2021-05-16 14:31:22] [INFO ] Deduced a trap composed of 6 places in 1179 ms
[2021-05-16 14:31:24] [INFO ] Deduced a trap composed of 6 places in 1172 ms
[2021-05-16 14:31:26] [INFO ] Deduced a trap composed of 6 places in 1605 ms
[2021-05-16 14:31:27] [INFO ] Deduced a trap composed of 4 places in 1102 ms
[2021-05-16 14:31:28] [INFO ] Deduced a trap composed of 6 places in 1247 ms
[2021-05-16 14:31:29] [INFO ] Deduced a trap composed of 4 places in 1092 ms
[2021-05-16 14:31:30] [INFO ] Deduced a trap composed of 3 places in 1034 ms
[2021-05-16 14:31:32] [INFO ] Deduced a trap composed of 6 places in 1049 ms
[2021-05-16 14:31:33] [INFO ] Deduced a trap composed of 6 places in 1036 ms
[2021-05-16 14:31:34] [INFO ] Deduced a trap composed of 8 places in 1044 ms
[2021-05-16 14:31:35] [INFO ] Deduced a trap composed of 6 places in 995 ms
[2021-05-16 14:31:36] [INFO ] Deduced a trap composed of 5 places in 1004 ms
[2021-05-16 14:31:37] [INFO ] Deduced a trap composed of 6 places in 989 ms
[2021-05-16 14:31:38] [INFO ] Deduced a trap composed of 5 places in 1040 ms
[2021-05-16 14:31:39] [INFO ] Deduced a trap composed of 8 places in 989 ms
[2021-05-16 14:31:40] [INFO ] Deduced a trap composed of 6 places in 998 ms
[2021-05-16 14:31:42] [INFO ] Deduced a trap composed of 6 places in 1025 ms
[2021-05-16 14:31:43] [INFO ] Deduced a trap composed of 6 places in 972 ms
[2021-05-16 14:31:44] [INFO ] Deduced a trap composed of 8 places in 942 ms
[2021-05-16 14:31:45] [INFO ] Deduced a trap composed of 6 places in 946 ms
[2021-05-16 14:31:45] [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 (> (+ s2996 s2997 s3024 s3027 s3036 s3038) 0)") while checking expression at index 0
[2021-05-16 14:31:47] [INFO ] [Real]Absence check using 1046 positive place invariants in 1370 ms returned sat
[2021-05-16 14:31:47] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 90 ms returned sat
[2021-05-16 14:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:32:07] [INFO ] [Real]Absence check using state equation in 20490 ms returned sat
[2021-05-16 14:32:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:32:09] [INFO ] [Nat]Absence check using 1046 positive place invariants in 1327 ms returned sat
[2021-05-16 14:32:09] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 87 ms returned sat
[2021-05-16 14:32:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:32:29] [INFO ] [Nat]Absence check using state equation in 19953 ms returned sat
[2021-05-16 14:32:30] [INFO ] Deduced a trap composed of 5 places in 952 ms
[2021-05-16 14:32:31] [INFO ] Deduced a trap composed of 5 places in 911 ms
[2021-05-16 14:32:32] [INFO ] Deduced a trap composed of 7 places in 932 ms
[2021-05-16 14:32:33] [INFO ] Deduced a trap composed of 6 places in 979 ms
[2021-05-16 14:32:34] [INFO ] Deduced a trap composed of 6 places in 976 ms
[2021-05-16 14:32:35] [INFO ] Deduced a trap composed of 3 places in 928 ms
[2021-05-16 14:32:36] [INFO ] Deduced a trap composed of 9 places in 925 ms
[2021-05-16 14:32:37] [INFO ] Deduced a trap composed of 6 places in 951 ms
[2021-05-16 14:32:38] [INFO ] Deduced a trap composed of 6 places in 937 ms
[2021-05-16 14:32:39] [INFO ] Deduced a trap composed of 11 places in 925 ms
[2021-05-16 14:32:40] [INFO ] Deduced a trap composed of 5 places in 916 ms
[2021-05-16 14:32:41] [INFO ] Deduced a trap composed of 6 places in 926 ms
[2021-05-16 14:32:42] [INFO ] Deduced a trap composed of 6 places in 904 ms
[2021-05-16 14:32:44] [INFO ] Deduced a trap composed of 6 places in 890 ms
[2021-05-16 14:32:45] [INFO ] Deduced a trap composed of 5 places in 913 ms
[2021-05-16 14:32:46] [INFO ] Deduced a trap composed of 6 places in 941 ms
[2021-05-16 14:32:47] [INFO ] Deduced a trap composed of 6 places in 924 ms
[2021-05-16 14:32:48] [INFO ] Deduced a trap composed of 6 places in 947 ms
[2021-05-16 14:32:49] [INFO ] Deduced a trap composed of 6 places in 926 ms
[2021-05-16 14:32:50] [INFO ] Deduced a trap composed of 5 places in 906 ms
[2021-05-16 14:32:51] [INFO ] Deduced a trap composed of 6 places in 905 ms
[2021-05-16 14:32:52] [INFO ] Deduced a trap composed of 5 places in 900 ms
[2021-05-16 14:32:53] [INFO ] Deduced a trap composed of 4 places in 861 ms
[2021-05-16 14:32:53] [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 (> (+ s1880 s1881 s1894 s1897) 0)") while checking expression at index 1
Support contains 8 out of 3166 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3166/3166 places, 2666/2666 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 3166 transition count 2659
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 3159 transition count 2659
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 3159 transition count 2652
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 3152 transition count 2652
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 7 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 102 place count 3115 transition count 2615
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 3115 transition count 2615
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 3115 transition count 2615
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 3114 transition count 2614
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 3113 transition count 2613
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 3112 transition count 2612
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 3111 transition count 2611
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 3110 transition count 2610
Applied a total of 123 rules in 1726 ms. Remains 3110 /3166 variables (removed 56) and now considering 2610/2666 (removed 56) transitions.
Finished structural reductions, in 1 iterations. Remains : 3110/3166 places, 2610/2666 transitions.
Incomplete random walk after 1000000 steps, including 47 resets, run finished after 24775 ms. (steps per millisecond=40 ) properties seen :[0, 0]
Interrupted Best-First random walk after 347063 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=69 ) properties seen :[0, 0]
Interrupted Best-First random walk after 343202 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen :[0, 1]
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2610 rows 3110 cols
[2021-05-16 14:33:30] [INFO ] Computed 1101 place invariants in 68 ms
[2021-05-16 14:33:31] [INFO ] [Real]Absence check using 1055 positive place invariants in 1296 ms returned sat
[2021-05-16 14:33:32] [INFO ] [Real]Absence check using 1055 positive and 46 generalized place invariants in 74 ms returned sat
[2021-05-16 14:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:33:50] [INFO ] [Real]Absence check using state equation in 18862 ms returned sat
[2021-05-16 14:33:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:33:52] [INFO ] [Nat]Absence check using 1055 positive place invariants in 1296 ms returned sat
[2021-05-16 14:33:52] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 76 ms returned sat
[2021-05-16 14:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:34:11] [INFO ] [Nat]Absence check using state equation in 18874 ms returned sat
[2021-05-16 14:34:12] [INFO ] Deduced a trap composed of 4 places in 931 ms
[2021-05-16 14:34:13] [INFO ] Deduced a trap composed of 7 places in 897 ms
[2021-05-16 14:34:14] [INFO ] Deduced a trap composed of 4 places in 913 ms
[2021-05-16 14:34:15] [INFO ] Deduced a trap composed of 4 places in 844 ms
[2021-05-16 14:34:16] [INFO ] Deduced a trap composed of 6 places in 735 ms
[2021-05-16 14:34:17] [INFO ] Deduced a trap composed of 5 places in 770 ms
[2021-05-16 14:34:18] [INFO ] Deduced a trap composed of 5 places in 734 ms
[2021-05-16 14:34:19] [INFO ] Deduced a trap composed of 5 places in 712 ms
[2021-05-16 14:34:19] [INFO ] Deduced a trap composed of 9 places in 703 ms
[2021-05-16 14:34:20] [INFO ] Deduced a trap composed of 4 places in 650 ms
[2021-05-16 14:34:21] [INFO ] Deduced a trap composed of 4 places in 664 ms
[2021-05-16 14:34:22] [INFO ] Deduced a trap composed of 6 places in 646 ms
[2021-05-16 14:34:22] [INFO ] Deduced a trap composed of 5 places in 674 ms
[2021-05-16 14:34:23] [INFO ] Deduced a trap composed of 12 places in 657 ms
[2021-05-16 14:34:24] [INFO ] Deduced a trap composed of 6 places in 651 ms
[2021-05-16 14:34:25] [INFO ] Deduced a trap composed of 5 places in 687 ms
[2021-05-16 14:34:26] [INFO ] Deduced a trap composed of 6 places in 675 ms
[2021-05-16 14:34:26] [INFO ] Deduced a trap composed of 6 places in 666 ms
[2021-05-16 14:34:27] [INFO ] Deduced a trap composed of 4 places in 606 ms
[2021-05-16 14:34:28] [INFO ] Deduced a trap composed of 6 places in 634 ms
[2021-05-16 14:34:29] [INFO ] Deduced a trap composed of 6 places in 639 ms
[2021-05-16 14:34:30] [INFO ] Deduced a trap composed of 9 places in 641 ms
[2021-05-16 14:34:30] [INFO ] Deduced a trap composed of 6 places in 592 ms
[2021-05-16 14:34:31] [INFO ] Deduced a trap composed of 6 places in 617 ms
[2021-05-16 14:34:32] [INFO ] Deduced a trap composed of 6 places in 612 ms
[2021-05-16 14:34:32] [INFO ] Deduced a trap composed of 8 places in 598 ms
[2021-05-16 14:34:33] [INFO ] Deduced a trap composed of 6 places in 580 ms
[2021-05-16 14:34:34] [INFO ] Deduced a trap composed of 6 places in 577 ms
[2021-05-16 14:34:35] [INFO ] Deduced a trap composed of 5 places in 580 ms
[2021-05-16 14:34:35] [INFO ] Deduced a trap composed of 6 places in 573 ms
[2021-05-16 14:34:40] [INFO ] Deduced a trap composed of 2 places in 4195 ms
[2021-05-16 14:34:40] [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 (> (+ s1421 s1422) 0)") while checking expression at index 0
Support contains 2 out of 3110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3110/3110 places, 2610/2610 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 3110 transition count 2608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3108 transition count 2608
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 3106 transition count 2606
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 3106 transition count 2606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 3104 transition count 2604
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 3103 transition count 2603
Applied a total of 13 rules in 820 ms. Remains 3103 /3110 variables (removed 7) and now considering 2603/2610 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3110 places, 2603/2610 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 24278 ms. (steps per millisecond=41 ) properties seen :[0]
Interrupted Best-First random walk after 350909 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=70 ) properties seen :[0]
Interrupted probabilistic random walk after 762645 steps, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen :[0]
Probabilistic random walk after 762645 steps, saw 47702 distinct states, run finished after 30001 ms. (steps per millisecond=25 ) properties seen :[0]
// Phase 1: matrix 2603 rows 3103 cols
[2021-05-16 14:35:40] [INFO ] Computed 1101 place invariants in 65 ms
[2021-05-16 14:35:42] [INFO ] [Real]Absence check using 1050 positive place invariants in 1288 ms returned sat
[2021-05-16 14:35:42] [INFO ] [Real]Absence check using 1050 positive and 51 generalized place invariants in 76 ms returned sat
[2021-05-16 14:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:36:01] [INFO ] [Real]Absence check using state equation in 19405 ms returned sat
[2021-05-16 14:36:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:36:03] [INFO ] [Nat]Absence check using 1050 positive place invariants in 1332 ms returned sat
[2021-05-16 14:36:03] [INFO ] [Nat]Absence check using 1050 positive and 51 generalized place invariants in 81 ms returned sat
[2021-05-16 14:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:36:24] [INFO ] [Nat]Absence check using state equation in 20919 ms returned sat
[2021-05-16 14:36:25] [INFO ] Deduced a trap composed of 6 places in 803 ms
[2021-05-16 14:36:26] [INFO ] Deduced a trap composed of 9 places in 808 ms
[2021-05-16 14:36:27] [INFO ] Deduced a trap composed of 4 places in 822 ms
[2021-05-16 14:36:28] [INFO ] Deduced a trap composed of 5 places in 970 ms
[2021-05-16 14:36:29] [INFO ] Deduced a trap composed of 6 places in 816 ms
[2021-05-16 14:36:30] [INFO ] Deduced a trap composed of 4 places in 861 ms
[2021-05-16 14:36:31] [INFO ] Deduced a trap composed of 5 places in 929 ms
[2021-05-16 14:36:32] [INFO ] Deduced a trap composed of 4 places in 848 ms
[2021-05-16 14:36:32] [INFO ] Deduced a trap composed of 5 places in 766 ms
[2021-05-16 14:36:33] [INFO ] Deduced a trap composed of 4 places in 741 ms
[2021-05-16 14:36:34] [INFO ] Deduced a trap composed of 6 places in 763 ms
[2021-05-16 14:36:35] [INFO ] Deduced a trap composed of 6 places in 758 ms
[2021-05-16 14:36:36] [INFO ] Deduced a trap composed of 9 places in 846 ms
[2021-05-16 14:36:37] [INFO ] Deduced a trap composed of 5 places in 765 ms
[2021-05-16 14:36:38] [INFO ] Deduced a trap composed of 4 places in 801 ms
[2021-05-16 14:36:39] [INFO ] Deduced a trap composed of 5 places in 746 ms
[2021-05-16 14:36:40] [INFO ] Deduced a trap composed of 5 places in 754 ms
[2021-05-16 14:36:40] [INFO ] Deduced a trap composed of 6 places in 752 ms
[2021-05-16 14:36:41] [INFO ] Deduced a trap composed of 6 places in 762 ms
[2021-05-16 14:36:42] [INFO ] Deduced a trap composed of 9 places in 765 ms
[2021-05-16 14:36:43] [INFO ] Deduced a trap composed of 6 places in 800 ms
[2021-05-16 14:36:44] [INFO ] Deduced a trap composed of 6 places in 793 ms
[2021-05-16 14:36:45] [INFO ] Deduced a trap composed of 5 places in 756 ms
[2021-05-16 14:36:46] [INFO ] Deduced a trap composed of 4 places in 775 ms
[2021-05-16 14:36:47] [INFO ] Deduced a trap composed of 6 places in 753 ms
[2021-05-16 14:36:47] [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 (> (+ s2799 s2800 s2801 s2803 s2804 s2812) 0)") while checking expression at index 0
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 135 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Starting structural reductions, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 131 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2021-05-16 14:36:47] [INFO ] Computed 1101 place invariants in 65 ms
[2021-05-16 14:36:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 14:37:00] [INFO ] Implicit Places using invariants in 13256 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2021-05-16 14:37:00] [INFO ] Computed 1101 place invariants in 65 ms
[2021-05-16 14:37:01] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 14:37:13] [INFO ] Implicit Places using invariants and state equation in 13291 ms returned []
Implicit Place search using SMT with State Equation took 26556 ms to find 0 implicit places.
[2021-05-16 14:37:14] [INFO ] Redundant transitions in 172 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2021-05-16 14:37:14] [INFO ] Computed 1101 place invariants in 84 ms
[2021-05-16 14:37:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 14:37:24] [INFO ] Dead Transitions using invariants and state equation in 10381 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 2496 ms. (steps per millisecond=40 ) properties seen :[0]
// Phase 1: matrix 2603 rows 3103 cols
[2021-05-16 14:37:26] [INFO ] Computed 1101 place invariants in 64 ms
[2021-05-16 14:37:28] [INFO ] [Real]Absence check using 1050 positive place invariants in 1295 ms returned sat
[2021-05-16 14:37:28] [INFO ] [Real]Absence check using 1050 positive and 51 generalized place invariants in 90 ms returned sat
[2021-05-16 14:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:37:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 14:37:46] [INFO ] [Real]Absence check using state equation in 18239 ms returned unknown
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Applied a total of 2 rules in 274 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2021-05-16 14:37:47] [INFO ] Computed 1101 place invariants in 63 ms
[2021-05-16 14:37:49] [INFO ] [Real]Absence check using 1051 positive place invariants in 1339 ms returned sat
[2021-05-16 14:37:49] [INFO ] [Real]Absence check using 1051 positive and 50 generalized place invariants in 78 ms returned sat
[2021-05-16 14:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:38:09] [INFO ] [Real]Absence check using state equation in 20043 ms returned sat
[2021-05-16 14:38:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:38:10] [INFO ] [Nat]Absence check using 1051 positive place invariants in 1310 ms returned sat
[2021-05-16 14:38:11] [INFO ] [Nat]Absence check using 1051 positive and 50 generalized place invariants in 79 ms returned sat
[2021-05-16 14:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:38:31] [INFO ] [Nat]Absence check using state equation in 20358 ms returned sat
[2021-05-16 14:38:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 14:38:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 33 ms returned sat
[2021-05-16 14:38:32] [INFO ] Deduced a trap composed of 11 places in 817 ms
[2021-05-16 14:38:33] [INFO ] Deduced a trap composed of 6 places in 786 ms
[2021-05-16 14:38:34] [INFO ] Deduced a trap composed of 6 places in 832 ms
[2021-05-16 14:38:35] [INFO ] Deduced a trap composed of 9 places in 815 ms
[2021-05-16 14:38:35] [INFO ] Deduced a trap composed of 6 places in 785 ms
[2021-05-16 14:38:36] [INFO ] Deduced a trap composed of 4 places in 783 ms
[2021-05-16 14:38:37] [INFO ] Deduced a trap composed of 6 places in 816 ms
[2021-05-16 14:38:38] [INFO ] Deduced a trap composed of 4 places in 828 ms
[2021-05-16 14:38:39] [INFO ] Deduced a trap composed of 4 places in 803 ms
[2021-05-16 14:38:40] [INFO ] Deduced a trap composed of 9 places in 806 ms
[2021-05-16 14:38:41] [INFO ] Deduced a trap composed of 4 places in 793 ms
[2021-05-16 14:38:42] [INFO ] Deduced a trap composed of 7 places in 808 ms
[2021-05-16 14:38:43] [INFO ] Deduced a trap composed of 6 places in 764 ms
[2021-05-16 14:38:43] [INFO ] Deduced a trap composed of 6 places in 712 ms
[2021-05-16 14:38:44] [INFO ] Deduced a trap composed of 4 places in 717 ms
[2021-05-16 14:38:45] [INFO ] Deduced a trap composed of 5 places in 712 ms
[2021-05-16 14:38:46] [INFO ] Deduced a trap composed of 4 places in 687 ms
[2021-05-16 14:38:47] [INFO ] Deduced a trap composed of 4 places in 705 ms
[2021-05-16 14:38:47] [INFO ] Deduced a trap composed of 6 places in 643 ms
[2021-05-16 14:38:48] [INFO ] Deduced a trap composed of 9 places in 624 ms
[2021-05-16 14:38:49] [INFO ] Deduced a trap composed of 6 places in 694 ms
[2021-05-16 14:38:50] [INFO ] Deduced a trap composed of 6 places in 747 ms
[2021-05-16 14:38:51] [INFO ] Deduced a trap composed of 6 places in 720 ms
[2021-05-16 14:38:51] [INFO ] Deduced a trap composed of 5 places in 686 ms
[2021-05-16 14:38:52] [INFO ] Deduced a trap composed of 6 places in 676 ms
[2021-05-16 14:38:53] [INFO ] Deduced a trap composed of 6 places in 680 ms
[2021-05-16 14:38:54] [INFO ] Deduced a trap composed of 6 places in 691 ms
[2021-05-16 14:38:58] [INFO ] Deduced a trap composed of 2 places in 4046 ms
[2021-05-16 14:38:58] [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 (> (+ s2516 s2517) 0)") while checking expression at index 0
[2021-05-16 14:38:58] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 1 ms.
[2021-05-16 14:38:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 34 ms.
[2021-05-16 14:38:58] [INFO ] Flatten gal took : 301 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPs-PT-100B @ 3570 seconds
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3555
rslt: Output for ReachabilityFireability @ ShieldPPPs-PT-100B
{
"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",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 14:38:59 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 55456,
"runtime": 15.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p1151) AND (p1118 <= 1) AND (1 <= p1118))))",
"processed_size": 56,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 11984,
"conflict_clusters": 510,
"places": 3103,
"places_significant": 2002,
"singleton_clusters": 0,
"transitions": 2603
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
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: 5706/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3103
lola: finding significant places
lola: 3103 places, 2603 transitions, 2002 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: (p1151 <= 1)
lola: E (F (((1 <= p1151) AND (p1118 <= 1) AND (1 <= p1118))))
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 <= p1151) AND (p1118 <= 1) AND (1 <= p1118))))
lola: processed formula length: 56
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: subprocess will run for 0 seconds at most (--localtimelimit)
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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1151) AND (p1118 <= 1) AND (1 <= p1118))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3 markings, 2 edges
lola: memory consumption: 55456 KB
lola: time consumption: 15 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="ShieldPPPs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ShieldPPPs-PT-100B, 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 r227-tall-162098231200344"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100B.tgz
mv ShieldPPPs-PT-100B 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 ;