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.r246-smll-162106594200064.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldRVs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594200064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.3K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 12:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 18:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 18:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 370K 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 ShieldRVs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621298432818

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 00:40:36] [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-18 00:40:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 00:40:36] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2021-05-18 00:40:36] [INFO ] Transformed 1203 places.
[2021-05-18 00:40:36] [INFO ] Transformed 1353 transitions.
[2021-05-18 00:40:36] [INFO ] Found NUPN structural information;
[2021-05-18 00:40:36] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 317 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 75 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 154 ms. (steps per millisecond=64 ) properties seen :[0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) 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 34 ms. (steps per millisecond=294 ) 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 39 ms. (steps per millisecond=256 ) 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 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[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]
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, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1353 rows 1203 cols
[2021-05-18 00:40:37] [INFO ] Computed 121 place invariants in 46 ms
[2021-05-18 00:40:38] [INFO ] [Real]Absence check using 121 positive place invariants in 268 ms returned sat
[2021-05-18 00:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:40:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 00:40:42] [INFO ] [Real]Absence check using state equation in 4048 ms returned (error "Failed to check-sat")
[2021-05-18 00:40:42] [INFO ] [Real]Absence check using 121 positive place invariants in 149 ms returned sat
[2021-05-18 00:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:40:46] [INFO ] [Real]Absence check using state equation in 4097 ms returned sat
[2021-05-18 00:40:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:40:47] [INFO ] [Nat]Absence check using 121 positive place invariants in 418 ms returned sat
[2021-05-18 00:40:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:40:51] [INFO ] [Nat]Absence check using state equation in 3803 ms returned sat
[2021-05-18 00:40:52] [INFO ] Deduced a trap composed of 27 places in 833 ms
[2021-05-18 00:40:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s657 s658 s659 s672 s673 s674 s675 s676 s677 s681 s682 s683 s684) 0)") while checking expression at index 1
[2021-05-18 00:40:52] [INFO ] [Real]Absence check using 121 positive place invariants in 152 ms returned sat
[2021-05-18 00:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:40:56] [INFO ] [Real]Absence check using state equation in 3842 ms returned sat
[2021-05-18 00:40:57] [INFO ] Deduced a trap composed of 36 places in 1251 ms
[2021-05-18 00:40:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s1037 s1038 s1039 s1040 s1041 s1042 s1043 s1044 s1045 s1047 s1048 s1053 s1054 s1057 s1067 s1068 s1069 s1070 s1071 s1075 s1083 s1084 s1085 s1091 s1092 s1093 s1096 s1097 s1098 s1101 s1102 s1103) 0)") while checking expression at index 2
[2021-05-18 00:40:58] [INFO ] [Real]Absence check using 121 positive place invariants in 181 ms returned sat
[2021-05-18 00:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:41:02] [INFO ] [Real]Absence check using state equation in 4459 ms returned sat
[2021-05-18 00:41:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:41:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 365 ms returned sat
[2021-05-18 00:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:41:07] [INFO ] [Nat]Absence check using state equation in 4359 ms returned sat
[2021-05-18 00:41:08] [INFO ] Deduced a trap composed of 32 places in 1065 ms
[2021-05-18 00:41:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s896 s897 s899 s900 s902 s903 s907 s921 s922 s924 s925 s930 s931 s949 s950 s951 s952 s953 s954 s955 s956 s958 s966 s967 s968) 0)") while checking expression at index 3
[2021-05-18 00:41:09] [INFO ] [Real]Absence check using 121 positive place invariants in 224 ms returned sat
[2021-05-18 00:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:41:13] [INFO ] [Real]Absence check using state equation in 4284 ms returned sat
[2021-05-18 00:41:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:41:13] [INFO ] [Nat]Absence check using 121 positive place invariants in 200 ms returned sat
[2021-05-18 00:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:41:17] [INFO ] [Nat]Absence check using state equation in 3927 ms returned sat
[2021-05-18 00:41:19] [INFO ] Deduced a trap composed of 49 places in 1227 ms
[2021-05-18 00:41: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: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s624 s625 s626 s627 s637 s638 s639 s642 s643 s644 s657 s658 s663 s665 s666 s677 s678 s681 s685 s686 s687 s688 s690 s691 s693 s694 s695 s701 s702 s703 s704 s705 s706 s707 s708) 0)") while checking expression at index 4
[2021-05-18 00:41:19] [INFO ] [Real]Absence check using 121 positive place invariants in 250 ms returned sat
[2021-05-18 00:41:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:41:23] [INFO ] [Real]Absence check using state equation in 4045 ms returned sat
[2021-05-18 00:41:24] [INFO ] Deduced a trap composed of 21 places in 833 ms
[2021-05-18 00:41: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: Stream closed (> (+ s0 s1140 s1141 s1142 s1155 s1156 s1157 s1159 s1160 s1164 s1165 s1166 s1179 s1180 s1181 s1182 s1184 s1188 s1189 s1190 s1191) 0)") while checking expression at index 5
[2021-05-18 00:41:25] [INFO ] [Real]Absence check using 121 positive place invariants in 158 ms returned sat
[2021-05-18 00:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:41:29] [INFO ] [Real]Absence check using state equation in 4162 ms returned sat
[2021-05-18 00:41:30] [INFO ] Deduced a trap composed of 30 places in 968 ms
[2021-05-18 00:41:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s774 s775 s776 s777 s788 s789 s791 s793 s794 s795 s798 s799 s800 s803 s804 s805 s807 s810 s811) 0)") while checking expression at index 6
[2021-05-18 00:41:30] [INFO ] [Real]Absence check using 121 positive place invariants in 220 ms returned sat
[2021-05-18 00:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:41:34] [INFO ] [Real]Absence check using state equation in 4119 ms returned sat
[2021-05-18 00:41:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:41:35] [INFO ] [Nat]Absence check using 121 positive place invariants in 364 ms returned sat
[2021-05-18 00:41:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:41:39] [INFO ] [Nat]Absence check using state equation in 3929 ms returned sat
[2021-05-18 00:41:40] [INFO ] Deduced a trap composed of 27 places in 988 ms
[2021-05-18 00:41: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 (> (+ s0 s1 s2 s3 s1047 s1048 s1053 s1054 s1056 s1057 s1075 s1083 s1084 s1085 s1102 s1105 s1106 s1107 s1108 s1109 s1110 s1111 s1112 s1116 s1117 s1119 s1120) 0)") while checking expression at index 7
Support contains 69 out of 1203 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 1203 transition count 1238
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 1088 transition count 1238
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 230 place count 1088 transition count 1090
Deduced a syphon composed of 148 places in 9 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 526 place count 940 transition count 1090
Symmetric choice reduction at 2 with 193 rule applications. Total rules 719 place count 940 transition count 1090
Deduced a syphon composed of 193 places in 10 ms
Reduce places removed 193 places and 193 transitions.
Iterating global reduction 2 with 386 rules applied. Total rules applied 1105 place count 747 transition count 897
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 1105 place count 747 transition count 828
Deduced a syphon composed of 69 places in 6 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 1243 place count 678 transition count 828
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 197
Deduced a syphon composed of 197 places in 4 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 1637 place count 481 transition count 631
Partial Free-agglomeration rule applied 55 times.
Drop transitions removed 55 transitions
Iterating global reduction 2 with 55 rules applied. Total rules applied 1692 place count 481 transition count 631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1693 place count 480 transition count 630
Applied a total of 1693 rules in 632 ms. Remains 480 /1203 variables (removed 723) and now considering 630/1353 (removed 723) transitions.
Finished structural reductions, in 1 iterations. Remains : 480/1203 places, 630/1353 transitions.
Incomplete random walk after 1000000 steps, including 2278 resets, run finished after 5903 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 242 resets, run finished after 2941 ms. (steps per millisecond=340 ) properties seen :[1, 0, 0, 0, 0, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 233 resets, run finished after 2787 ms. (steps per millisecond=358 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 217 resets, run finished after 2405 ms. (steps per millisecond=415 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 223 resets, run finished after 3150 ms. (steps per millisecond=317 ) properties seen :[0, 1, 0, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 212 resets, run finished after 2495 ms. (steps per millisecond=400 ) properties seen :[0, 1, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 235 resets, run finished after 2810 ms. (steps per millisecond=355 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 230 resets, run finished after 2367 ms. (steps per millisecond=422 ) properties seen :[0, 0, 1]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 630 rows 480 cols
[2021-05-18 00:42:06] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-18 00:42:06] [INFO ] [Real]Absence check using 121 positive place invariants in 111 ms returned sat
[2021-05-18 00:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:42:07] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2021-05-18 00:42:07] [INFO ] Deduced a trap composed of 11 places in 63 ms
[2021-05-18 00:42:07] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2021-05-18 00:42:07] [INFO ] Deduced a trap composed of 7 places in 50 ms
[2021-05-18 00:42:07] [INFO ] Deduced a trap composed of 6 places in 32 ms
[2021-05-18 00:42:07] [INFO ] Deduced a trap composed of 9 places in 32 ms
[2021-05-18 00:42:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 488 ms
[2021-05-18 00:42:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:42:08] [INFO ] [Nat]Absence check using 121 positive place invariants in 122 ms returned sat
[2021-05-18 00:42:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:42:09] [INFO ] [Nat]Absence check using state equation in 1216 ms returned sat
[2021-05-18 00:42:09] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2021-05-18 00:42:09] [INFO ] Deduced a trap composed of 14 places in 52 ms
[2021-05-18 00:42:09] [INFO ] Deduced a trap composed of 12 places in 57 ms
[2021-05-18 00:42:09] [INFO ] Deduced a trap composed of 14 places in 31 ms
[2021-05-18 00:42:09] [INFO ] Deduced a trap composed of 15 places in 25 ms
[2021-05-18 00:42:09] [INFO ] Deduced a trap composed of 10 places in 22 ms
[2021-05-18 00:42:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 541 ms
[2021-05-18 00:42:10] [INFO ] Computed and/alt/rep : 622/4634/622 causal constraints in 101 ms.
[2021-05-18 00:42:30] [INFO ] Added : 495 causal constraints over 99 iterations in 20579 ms.(timeout) Result :sat
[2021-05-18 00:42:30] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2021-05-18 00:42:30] [INFO ] Deduced a trap composed of 7 places in 70 ms
[2021-05-18 00:42:31] [INFO ] Deduced a trap composed of 7 places in 64 ms
[2021-05-18 00:42:31] [INFO ] Deduced a trap composed of 17 places in 41 ms
[2021-05-18 00:42:31] [INFO ] Deduced a trap composed of 7 places in 49 ms
[2021-05-18 00:42:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1374 ms
Attempting to minimize the solution found.
Minimization took 130 ms.
[2021-05-18 00:42:32] [INFO ] [Real]Absence check using 121 positive place invariants in 128 ms returned sat
[2021-05-18 00:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:42:33] [INFO ] [Real]Absence check using state equation in 1151 ms returned sat
[2021-05-18 00:42:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:42:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 107 ms returned sat
[2021-05-18 00:42:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:42:34] [INFO ] [Nat]Absence check using state equation in 978 ms returned sat
[2021-05-18 00:42:34] [INFO ] Deduced a trap composed of 6 places in 39 ms
[2021-05-18 00:42:34] [INFO ] Deduced a trap composed of 6 places in 39 ms
[2021-05-18 00:42:34] [INFO ] Deduced a trap composed of 12 places in 38 ms
[2021-05-18 00:42:34] [INFO ] Deduced a trap composed of 10 places in 39 ms
[2021-05-18 00:42:35] [INFO ] Deduced a trap composed of 6 places in 38 ms
[2021-05-18 00:42:35] [INFO ] Deduced a trap composed of 11 places in 50 ms
[2021-05-18 00:42:35] [INFO ] Deduced a trap composed of 9 places in 46 ms
[2021-05-18 00:42:35] [INFO ] Deduced a trap composed of 8 places in 40 ms
[2021-05-18 00:42:35] [INFO ] Deduced a trap composed of 8 places in 54 ms
[2021-05-18 00:42:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 686 ms
[2021-05-18 00:42:35] [INFO ] Computed and/alt/rep : 622/4634/622 causal constraints in 91 ms.
[2021-05-18 00:42:56] [INFO ] Added : 520 causal constraints over 104 iterations in 20600 ms.(timeout) Result :sat
[2021-05-18 00:42:56] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2021-05-18 00:42:56] [INFO ] Deduced a trap composed of 8 places in 78 ms
[2021-05-18 00:42:56] [INFO ] Deduced a trap composed of 22 places in 64 ms
[2021-05-18 00:42:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 882 ms
Attempting to minimize the solution found.
Minimization took 154 ms.
Incomplete Parikh walk after 77400 steps, including 883 resets, run finished after 702 ms. (steps per millisecond=110 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 67000 steps, including 794 resets, run finished after 532 ms. (steps per millisecond=125 ) properties seen :[0, 0] could not realise parikh vector
Support contains 21 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 630/630 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 480 transition count 627
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 477 transition count 627
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 477 transition count 622
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 16 place count 472 transition count 622
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 72 place count 444 transition count 594
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 444 transition count 594
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 443 transition count 593
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 442 transition count 592
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 441 transition count 591
Applied a total of 80 rules in 218 ms. Remains 441 /480 variables (removed 39) and now considering 591/630 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/480 places, 591/630 transitions.
Incomplete random walk after 1000000 steps, including 2569 resets, run finished after 4492 ms. (steps per millisecond=222 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 282 resets, run finished after 2547 ms. (steps per millisecond=392 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 292 resets, run finished after 2927 ms. (steps per millisecond=341 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 3507872 steps, run timeout after 30001 ms. (steps per millisecond=116 ) properties seen :[0, 0]
Probabilistic random walk after 3507872 steps, saw 566007 distinct states, run finished after 30001 ms. (steps per millisecond=116 ) properties seen :[0, 0]
// Phase 1: matrix 591 rows 441 cols
[2021-05-18 00:43:38] [INFO ] Computed 121 place invariants in 4 ms
[2021-05-18 00:43:38] [INFO ] [Real]Absence check using 121 positive place invariants in 69 ms returned sat
[2021-05-18 00:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:43:39] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2021-05-18 00:43:39] [INFO ] Deduced a trap composed of 15 places in 97 ms
[2021-05-18 00:43:39] [INFO ] Deduced a trap composed of 9 places in 205 ms
[2021-05-18 00:43:39] [INFO ] Deduced a trap composed of 11 places in 128 ms
[2021-05-18 00:43:40] [INFO ] Deduced a trap composed of 26 places in 107 ms
[2021-05-18 00:43:40] [INFO ] Deduced a trap composed of 15 places in 104 ms
[2021-05-18 00:43:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 811 ms
[2021-05-18 00:43:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:43:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 67 ms returned sat
[2021-05-18 00:43:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:43:41] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2021-05-18 00:43:41] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2021-05-18 00:43:41] [INFO ] Deduced a trap composed of 14 places in 48 ms
[2021-05-18 00:43:41] [INFO ] Deduced a trap composed of 10 places in 46 ms
[2021-05-18 00:43:41] [INFO ] Deduced a trap composed of 12 places in 45 ms
[2021-05-18 00:43:41] [INFO ] Deduced a trap composed of 11 places in 42 ms
[2021-05-18 00:43:41] [INFO ] Deduced a trap composed of 13 places in 40 ms
[2021-05-18 00:43:41] [INFO ] Deduced a trap composed of 6 places in 41 ms
[2021-05-18 00:43:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 480 ms
[2021-05-18 00:43:41] [INFO ] Computed and/alt/rep : 579/3211/579 causal constraints in 50 ms.
[2021-05-18 00:44:07] [INFO ] Added : 560 causal constraints over 112 iterations in 25590 ms.(timeout) Result :unknown
[2021-05-18 00:44:07] [INFO ] [Real]Absence check using 121 positive place invariants in 70 ms returned sat
[2021-05-18 00:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:44:08] [INFO ] [Real]Absence check using state equation in 930 ms returned sat
[2021-05-18 00:44:08] [INFO ] Deduced a trap composed of 12 places in 99 ms
[2021-05-18 00:44:08] [INFO ] Deduced a trap composed of 13 places in 84 ms
[2021-05-18 00:44:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2021-05-18 00:44:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:44:08] [INFO ] [Nat]Absence check using 121 positive place invariants in 119 ms returned sat
[2021-05-18 00:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:44:09] [INFO ] [Nat]Absence check using state equation in 941 ms returned sat
[2021-05-18 00:44:09] [INFO ] Computed and/alt/rep : 579/3211/579 causal constraints in 39 ms.
[2021-05-18 00:44:33] [INFO ] Added : 550 causal constraints over 110 iterations in 23595 ms.(timeout) Result :unknown
Incomplete Parikh walk after 79900 steps, including 779 resets, run finished after 479 ms. (steps per millisecond=166 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 47300 steps, including 1045 resets, run finished after 291 ms. (steps per millisecond=162 ) properties seen :[0, 0] could not realise parikh vector
Support contains 21 out of 441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 441/441 places, 591/591 transitions.
Applied a total of 0 rules in 22 ms. Remains 441 /441 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 591/591 transitions.
Starting structural reductions, iteration 0 : 441/441 places, 591/591 transitions.
Applied a total of 0 rules in 24 ms. Remains 441 /441 variables (removed 0) and now considering 591/591 (removed 0) transitions.
// Phase 1: matrix 591 rows 441 cols
[2021-05-18 00:44:34] [INFO ] Computed 121 place invariants in 5 ms
[2021-05-18 00:44:35] [INFO ] Implicit Places using invariants in 804 ms returned []
// Phase 1: matrix 591 rows 441 cols
[2021-05-18 00:44:35] [INFO ] Computed 121 place invariants in 8 ms
[2021-05-18 00:44:38] [INFO ] Implicit Places using invariants and state equation in 3453 ms returned []
Implicit Place search using SMT with State Equation took 4259 ms to find 0 implicit places.
[2021-05-18 00:44:38] [INFO ] Redundant transitions in 405 ms returned []
// Phase 1: matrix 591 rows 441 cols
[2021-05-18 00:44:38] [INFO ] Computed 121 place invariants in 7 ms
[2021-05-18 00:44:39] [INFO ] Dead Transitions using invariants and state equation in 1056 ms returned []
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 591/591 transitions.
Incomplete random walk after 100000 steps, including 256 resets, run finished after 602 ms. (steps per millisecond=166 ) properties seen :[0, 0]
// Phase 1: matrix 591 rows 441 cols
[2021-05-18 00:44:40] [INFO ] Computed 121 place invariants in 3 ms
[2021-05-18 00:44:40] [INFO ] [Real]Absence check using 121 positive place invariants in 62 ms returned sat
[2021-05-18 00:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:44:41] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2021-05-18 00:44:41] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2021-05-18 00:44:41] [INFO ] Deduced a trap composed of 9 places in 119 ms
[2021-05-18 00:44:41] [INFO ] Deduced a trap composed of 11 places in 108 ms
[2021-05-18 00:44:41] [INFO ] Deduced a trap composed of 26 places in 117 ms
[2021-05-18 00:44:42] [INFO ] Deduced a trap composed of 15 places in 106 ms
[2021-05-18 00:44:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 697 ms
[2021-05-18 00:44:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:44:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 106 ms returned sat
[2021-05-18 00:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:44:43] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2021-05-18 00:44:43] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2021-05-18 00:44:43] [INFO ] Deduced a trap composed of 14 places in 50 ms
[2021-05-18 00:44:43] [INFO ] Deduced a trap composed of 10 places in 38 ms
[2021-05-18 00:44:43] [INFO ] Deduced a trap composed of 12 places in 34 ms
[2021-05-18 00:44:43] [INFO ] Deduced a trap composed of 11 places in 57 ms
[2021-05-18 00:44:43] [INFO ] Deduced a trap composed of 13 places in 63 ms
[2021-05-18 00:44:43] [INFO ] Deduced a trap composed of 6 places in 59 ms
[2021-05-18 00:44:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 560 ms
[2021-05-18 00:44:43] [INFO ] Computed and/alt/rep : 579/3211/579 causal constraints in 61 ms.
[2021-05-18 00:45:02] [INFO ] Added : 540 causal constraints over 108 iterations in 18286 ms. Result :unknown
[2021-05-18 00:45:02] [INFO ] [Real]Absence check using 121 positive place invariants in 106 ms returned sat
[2021-05-18 00:45:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:45:03] [INFO ] [Real]Absence check using state equation in 935 ms returned sat
[2021-05-18 00:45:03] [INFO ] Deduced a trap composed of 12 places in 46 ms
[2021-05-18 00:45:03] [INFO ] Deduced a trap composed of 13 places in 49 ms
[2021-05-18 00:45:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2021-05-18 00:45:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:45:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 114 ms returned sat
[2021-05-18 00:45:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:45:04] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2021-05-18 00:45:04] [INFO ] Computed and/alt/rep : 579/3211/579 causal constraints in 41 ms.
[2021-05-18 00:45:23] [INFO ] Added : 545 causal constraints over 109 iterations in 18966 ms. Result :unknown
Applied a total of 0 rules in 16 ms. Remains 441 /441 variables (removed 0) and now considering 591/591 (removed 0) transitions.
// Phase 1: matrix 591 rows 441 cols
[2021-05-18 00:45:23] [INFO ] Computed 121 place invariants in 3 ms
[2021-05-18 00:45:23] [INFO ] [Real]Absence check using 121 positive place invariants in 101 ms returned sat
[2021-05-18 00:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:45:24] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2021-05-18 00:45:24] [INFO ] Deduced a trap composed of 15 places in 90 ms
[2021-05-18 00:45:24] [INFO ] Deduced a trap composed of 9 places in 96 ms
[2021-05-18 00:45:24] [INFO ] Deduced a trap composed of 11 places in 86 ms
[2021-05-18 00:45:24] [INFO ] Deduced a trap composed of 26 places in 91 ms
[2021-05-18 00:45:25] [INFO ] Deduced a trap composed of 15 places in 89 ms
[2021-05-18 00:45:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 600 ms
[2021-05-18 00:45:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:45:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 109 ms returned sat
[2021-05-18 00:45:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:45:26] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2021-05-18 00:45:26] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2021-05-18 00:45:26] [INFO ] Deduced a trap composed of 14 places in 45 ms
[2021-05-18 00:45:26] [INFO ] Deduced a trap composed of 10 places in 45 ms
[2021-05-18 00:45:26] [INFO ] Deduced a trap composed of 12 places in 49 ms
[2021-05-18 00:45:26] [INFO ] Deduced a trap composed of 11 places in 61 ms
[2021-05-18 00:45:26] [INFO ] Deduced a trap composed of 13 places in 61 ms
[2021-05-18 00:45:26] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2021-05-18 00:45:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 594 ms
[2021-05-18 00:45:26] [INFO ] Computed and/alt/rep : 579/3211/579 causal constraints in 66 ms.
[2021-05-18 00:45:47] [INFO ] Added : 550 causal constraints over 110 iterations in 20377 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 70 ms.
[2021-05-18 00:45:47] [INFO ] [Real]Absence check using 121 positive place invariants in 72 ms returned sat
[2021-05-18 00:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 00:45:48] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2021-05-18 00:45:48] [INFO ] Deduced a trap composed of 12 places in 46 ms
[2021-05-18 00:45:48] [INFO ] Deduced a trap composed of 13 places in 53 ms
[2021-05-18 00:45:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2021-05-18 00:45:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 00:45:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 71 ms returned sat
[2021-05-18 00:45:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 00:45:49] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2021-05-18 00:45:49] [INFO ] Computed and/alt/rep : 579/3211/579 causal constraints in 40 ms.
[2021-05-18 00:46:12] [INFO ] Added : 550 causal constraints over 110 iterations in 22658 ms.(timeout) Result :sat
[2021-05-18 00:46:12] [INFO ] Deduced a trap composed of 7 places in 29 ms
[2021-05-18 00:46:12] [INFO ] Deduced a trap composed of 7 places in 38 ms
[2021-05-18 00:46:12] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2021-05-18 00:46:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 694 ms
Attempting to minimize the solution found.
Minimization took 131 ms.
[2021-05-18 00:46:13] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2021-05-18 00:46:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 22 ms.
[2021-05-18 00:46:14] [INFO ] Flatten gal took : 246 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVs-PT-030B @ 3570 seconds

FORMULA ShieldRVs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for ReachabilityFireability @ ShieldRVs-PT-030B

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 00:46:15 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p213 <= 0) OR (p215 <= 0) OR (p219 <= 0) OR (p373 <= 0) OR ((1 <= p399)) OR (p238 <= 0) OR (p255 <= 0) OR (p267 <= 0))))",
"processed_size": 135,
"rewrites": 2
},
"result":
{
"edges": 163,
"markings": 101,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p58) AND (1 <= p61) AND (1 <= p70) AND (1 <= p51) AND ((p13 <= 0) OR (p161 <= 0) OR (p164 <= 0) OR (p173 <= 0) OR (p88 <= 0) OR (p93 <= 0) OR (p101 <= 0)) AND (((1 <= p240)) OR ((1 <= p389))))))",
"processed_size": 214,
"rewrites": 1
},
"result":
{
"edges": 89,
"markings": 90,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 84,
"problems": 14
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 26960,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 2806,
"conflict_clusters": 50,
"places": 441,
"places_significant": 320,
"singleton_clusters": 0,
"transitions": 591
},
"result":
{
"preliminary_value": "yes yes ",
"value": "yes yes "
},
"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: 1032/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 441
lola: finding significant places
lola: 441 places, 591 transitions, 320 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: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p389 <= 1)
lola: A (G (((p213 <= 0) OR (p215 <= 0) OR (p219 <= 0) OR (p373 <= 0) OR ((1 <= p399)) OR (p238 <= 0) OR (p255 <= 0) OR (p267 <= 0)))) : E (F (((1 <= p58) AND (1 <= p61) AND (1 <= p70) AND (1 <= p51) AND ((p13 <= 0) OR (p161 <= 0) OR (p164 <= 0) OR (p173 <= 0) OR (p88 <= 0) OR (p93 <= 0) OR (p101 <= 0)) AND (((1 <= p240)) OR ((1 <= p389))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p213 <= 0) OR (p215 <= 0) OR (p219 <= 0) OR (p373 <= 0) OR ((1 <= p399)) OR (p238 <= 0) OR (p255 <= 0) OR (p267 <= 0))))
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 (((p213 <= 0) OR (p215 <= 0) OR (p219 <= 0) OR (p373 <= 0) OR ((1 <= p399)) OR (p238 <= 0) OR (p255 <= 0) OR (p267 <= 0))))
lola: processed formula length: 135
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 <= p213) AND (1 <= p215) AND (1 <= p219) AND (1 <= p373) AND ((p399 <= 0)) AND (1 <= p238) AND (1 <= p255) AND (1 <= p267))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 101 markings, 163 edges
lola: ========================================
lola: subprocess 1 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p58) AND (1 <= p61) AND (1 <= p70) AND (1 <= p51) AND ((p13 <= 0) OR (p161 <= 0) OR (p164 <= 0) OR (p173 <= 0) OR (p88 <= 0) OR (p93 <= 0) OR (p101 <= 0)) AND (((1 <= p240)) OR ((1 <= p389))))))
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 <= p58) AND (1 <= p61) AND (1 <= p70) AND (1 <= p51) AND ((p13 <= 0) OR (p161 <= 0) OR (p164 <= 0) OR (p173 <= 0) OR (p88 <= 0) OR (p93 <= 0) OR (p101 <= 0)) AND (((1 <= p240)) OR ((1 <= p389))))))
lola: processed formula length: 214
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: formula 0: ((1 <= p58) AND (1 <= p61) AND (1 <= p70) AND (1 <= p51) AND ((p13 <= 0) OR (p161 <= 0) OR (p164 <= 0) OR (p173 <= 0) OR (p88 <= 0) OR (p93 <= 0) OR (p101 <= 0)) AND (((1 <= p240)) OR ((1 <= p389))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 84 literals and 14 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 90 markings, 89 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes
lola:
preliminary result: yes yes
lola: memory consumption: 26960 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="ShieldRVs-PT-030B"
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 ShieldRVs-PT-030B, 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 r246-smll-162106594200064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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