Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475800503.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475800503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 3.3K May 14 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 19:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 19:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 349K May 12 20:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590597661363

[2020-05-27 16:41:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 16:41:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 16:41:03] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2020-05-27 16:41:03] [INFO ] Transformed 1363 places.
[2020-05-27 16:41:03] [INFO ] Transformed 1263 transitions.
[2020-05-27 16:41:03] [INFO ] Found NUPN structural information;
[2020-05-27 16:41:03] [INFO ] Parsed PT model containing 1363 places and 1263 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1]
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[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, 1, 0, 0, 0]
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[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]
// Phase 1: matrix 1263 rows 1363 cols
[2020-05-27 16:41:03] [INFO ] Computed 221 place invariants in 31 ms
[2020-05-27 16:41:03] [INFO ] [Real]Absence check using 221 positive place invariants in 206 ms returned sat
[2020-05-27 16:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:41:07] [INFO ] [Real]Absence check using state equation in 3740 ms returned sat
[2020-05-27 16:41:08] [INFO ] Deduced a trap composed of 22 places in 503 ms
[2020-05-27 16:41:08] [INFO ] Deduced a trap composed of 21 places in 572 ms
[2020-05-27 16: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 s1162 s1163 s1164 s1173 s1174 s1179 s1187 s1188 s1189 s1192 s1193 s1205 s1206 s1207 s1208 s1215 s1216 s1217) 0)") while checking expression at index 0
[2020-05-27 16:41:09] [INFO ] [Real]Absence check using 221 positive place invariants in 217 ms returned sat
[2020-05-27 16:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:41:12] [INFO ] [Real]Absence check using state equation in 3521 ms returned sat
[2020-05-27 16:41:13] [INFO ] Deduced a trap composed of 24 places in 549 ms
[2020-05-27 16:41:13] [INFO ] Deduced a trap composed of 24 places in 487 ms
[2020-05-27 16:41:13] [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 s894 s895 s896 s897 s898 s899 s902 s903 s904 s919 s921 s922 s952 s953 s954 s956 s957) 0)") while checking expression at index 1
[2020-05-27 16:41:14] [INFO ] [Real]Absence check using 221 positive place invariants in 220 ms returned sat
[2020-05-27 16:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:41:17] [INFO ] [Real]Absence check using state equation in 3203 ms returned sat
[2020-05-27 16:41:18] [INFO ] Deduced a trap composed of 26 places in 634 ms
[2020-05-27 16:41:18] [INFO ] Deduced a trap composed of 19 places in 545 ms
[2020-05-27 16:41:19] [INFO ] Deduced a trap composed of 38 places in 544 ms
[2020-05-27 16: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 s894 s895 s896 s897 s898 s899 s904 s907 s908 s912 s913 s914 s917 s918 s919 s921 s922 s928 s929 s930 s931 s938 s952 s953 s954 s957 s979 s980 s981 s984 s985) 0)") while checking expression at index 2
[2020-05-27 16:41:19] [INFO ] [Real]Absence check using 221 positive place invariants in 152 ms returned sat
[2020-05-27 16:41:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:41:22] [INFO ] [Real]Absence check using state equation in 3004 ms returned sat
[2020-05-27 16:41:23] [INFO ] Deduced a trap composed of 16 places in 610 ms
[2020-05-27 16:41:24] [INFO ] Deduced a trap composed of 30 places in 608 ms
[2020-05-27 16:41:24] [INFO ] Deduced a trap composed of 16 places in 570 ms
[2020-05-27 16: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 s1 s2 s3 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102 s1106 s1138 s1139 s1140) 0)") while checking expression at index 3
Support contains 30 out of 1363 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1363 transition count 1122
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 1222 transition count 1122
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 282 place count 1222 transition count 1023
Deduced a syphon composed of 99 places in 4 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 480 place count 1123 transition count 1023
Symmetric choice reduction at 2 with 136 rule applications. Total rules 616 place count 1123 transition count 1023
Deduced a syphon composed of 136 places in 6 ms
Reduce places removed 136 places and 136 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 888 place count 987 transition count 887
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 888 place count 987 transition count 830
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 1002 place count 930 transition count 830
Performed 286 Post agglomeration using F-continuation condition.Transition count delta: 286
Deduced a syphon composed of 286 places in 2 ms
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 2 with 572 rules applied. Total rules applied 1574 place count 644 transition count 544
Partial Free-agglomeration rule applied 168 times.
Drop transitions removed 168 transitions
Iterating global reduction 2 with 168 rules applied. Total rules applied 1742 place count 644 transition count 544
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 1744 place count 644 transition count 544
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1745 place count 643 transition count 543
Applied a total of 1745 rules in 393 ms. Remains 643 /1363 variables (removed 720) and now considering 543/1263 (removed 720) transitions.
Finished structural reductions, in 1 iterations. Remains : 643/1363 places, 543/1263 transitions.
Incomplete random walk after 1000000 steps, including 410 resets, run finished after 5572 ms. (steps per millisecond=179 ) properties seen :[0, 0, 0, 1]
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 40 resets, run finished after 3276 ms. (steps per millisecond=305 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 86 resets, run finished after 2881 ms. (steps per millisecond=347 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 45 resets, run finished after 2706 ms. (steps per millisecond=369 ) properties seen :[0, 0, 1]
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 543 rows 643 cols
[2020-05-27 16:41:39] [INFO ] Computed 221 place invariants in 16 ms
[2020-05-27 16:41:39] [INFO ] [Real]Absence check using 210 positive place invariants in 112 ms returned sat
[2020-05-27 16:41:39] [INFO ] [Real]Absence check using 210 positive and 11 generalized place invariants in 7 ms returned sat
[2020-05-27 16:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:41:40] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2020-05-27 16:41:40] [INFO ] Deduced a trap composed of 5 places in 188 ms
[2020-05-27 16:41:41] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2020-05-27 16:41:41] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-05-27 16:41:41] [INFO ] Deduced a trap composed of 5 places in 107 ms
[2020-05-27 16:41:41] [INFO ] Deduced a trap composed of 5 places in 113 ms
[2020-05-27 16:41:41] [INFO ] Deduced a trap composed of 7 places in 127 ms
[2020-05-27 16:41:41] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-05-27 16:41:41] [INFO ] Deduced a trap composed of 6 places in 99 ms
[2020-05-27 16:41:42] [INFO ] Deduced a trap composed of 5 places in 95 ms
[2020-05-27 16:41:42] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-05-27 16:41:42] [INFO ] Deduced a trap composed of 12 places in 109 ms
[2020-05-27 16:41:42] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-05-27 16:41:42] [INFO ] Deduced a trap composed of 5 places in 90 ms
[2020-05-27 16:41:42] [INFO ] Deduced a trap composed of 9 places in 88 ms
[2020-05-27 16:41:42] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2020-05-27 16:41:42] [INFO ] Deduced a trap composed of 7 places in 82 ms
[2020-05-27 16:41:42] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 7 places in 74 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 7 places in 72 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 7 places in 81 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 12 places in 64 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 19 places in 63 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 14 places in 64 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 9 places in 68 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 10 places in 60 ms
[2020-05-27 16:41:43] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-05-27 16:41:44] [INFO ] Deduced a trap composed of 15 places in 51 ms
[2020-05-27 16:41:44] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3260 ms
[2020-05-27 16:41:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:41:44] [INFO ] [Nat]Absence check using 210 positive place invariants in 79 ms returned sat
[2020-05-27 16:41:44] [INFO ] [Nat]Absence check using 210 positive and 11 generalized place invariants in 6 ms returned sat
[2020-05-27 16:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:41:44] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2020-05-27 16:41:45] [INFO ] Deduced a trap composed of 6 places in 167 ms
[2020-05-27 16:41:45] [INFO ] Deduced a trap composed of 6 places in 117 ms
[2020-05-27 16:41:45] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2020-05-27 16:41:45] [INFO ] Deduced a trap composed of 5 places in 130 ms
[2020-05-27 16:41:45] [INFO ] Deduced a trap composed of 6 places in 121 ms
[2020-05-27 16:41:45] [INFO ] Deduced a trap composed of 9 places in 105 ms
[2020-05-27 16:41:45] [INFO ] Deduced a trap composed of 7 places in 101 ms
[2020-05-27 16:41:46] [INFO ] Deduced a trap composed of 6 places in 111 ms
[2020-05-27 16:41:46] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-27 16:41:46] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2020-05-27 16:41:46] [INFO ] Deduced a trap composed of 7 places in 91 ms
[2020-05-27 16:41:46] [INFO ] Deduced a trap composed of 6 places in 84 ms
[2020-05-27 16:41:46] [INFO ] Deduced a trap composed of 7 places in 107 ms
[2020-05-27 16:41:46] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-05-27 16:41:46] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2020-05-27 16:41:47] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2020-05-27 16:41:47] [INFO ] Deduced a trap composed of 12 places in 86 ms
[2020-05-27 16:41:47] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-05-27 16:41:47] [INFO ] Deduced a trap composed of 17 places in 68 ms
[2020-05-27 16:41:47] [INFO ] Deduced a trap composed of 31 places in 71 ms
[2020-05-27 16:41:47] [INFO ] Deduced a trap composed of 25 places in 62 ms
[2020-05-27 16:41:47] [INFO ] Deduced a trap composed of 24 places in 66 ms
[2020-05-27 16:41:47] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2621 ms
[2020-05-27 16:41:47] [INFO ] Computed and/alt/rep : 536/1691/536 causal constraints in 38 ms.
[2020-05-27 16:41:58] [INFO ] Added : 493 causal constraints over 102 iterations in 10530 ms. Result :unknown
[2020-05-27 16:41:58] [INFO ] [Real]Absence check using 210 positive place invariants in 109 ms returned sat
[2020-05-27 16:41:58] [INFO ] [Real]Absence check using 210 positive and 11 generalized place invariants in 6 ms returned sat
[2020-05-27 16:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:41:59] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2020-05-27 16:41:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:41:59] [INFO ] [Nat]Absence check using 210 positive place invariants in 106 ms returned sat
[2020-05-27 16:41:59] [INFO ] [Nat]Absence check using 210 positive and 11 generalized place invariants in 5 ms returned sat
[2020-05-27 16:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:42:00] [INFO ] [Nat]Absence check using state equation in 852 ms returned sat
[2020-05-27 16:42:00] [INFO ] Deduced a trap composed of 4 places in 114 ms
[2020-05-27 16:42:00] [INFO ] Deduced a trap composed of 6 places in 133 ms
[2020-05-27 16:42:00] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-05-27 16:42:00] [INFO ] Deduced a trap composed of 5 places in 114 ms
[2020-05-27 16:42:00] [INFO ] Deduced a trap composed of 7 places in 110 ms
[2020-05-27 16:42:01] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-05-27 16:42:01] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2020-05-27 16:42:01] [INFO ] Deduced a trap composed of 4 places in 146 ms
[2020-05-27 16:42:01] [INFO ] Deduced a trap composed of 8 places in 106 ms
[2020-05-27 16:42:01] [INFO ] Deduced a trap composed of 5 places in 124 ms
[2020-05-27 16:42:01] [INFO ] Deduced a trap composed of 7 places in 116 ms
[2020-05-27 16:42:01] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-05-27 16:42:02] [INFO ] Deduced a trap composed of 7 places in 83 ms
[2020-05-27 16:42:02] [INFO ] Deduced a trap composed of 7 places in 89 ms
[2020-05-27 16:42:02] [INFO ] Deduced a trap composed of 6 places in 75 ms
[2020-05-27 16:42:02] [INFO ] Deduced a trap composed of 5 places in 74 ms
[2020-05-27 16:42:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 2066 ms
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 56800 steps, including 766 resets, run finished after 240 ms. (steps per millisecond=236 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 643 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 643/643 places, 543/543 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 643 transition count 542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 642 transition count 542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 642 transition count 541
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 641 transition count 541
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 24 place count 631 transition count 531
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 631 transition count 531
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 631 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 630 transition count 530
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 629 transition count 529
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 628 transition count 528
Applied a total of 34 rules in 88 ms. Remains 628 /643 variables (removed 15) and now considering 528/543 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 628/643 places, 528/543 transitions.
Incomplete random walk after 1000000 steps, including 244 resets, run finished after 4743 ms. (steps per millisecond=210 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 3072 ms. (steps per millisecond=325 ) properties seen :[0]
Interrupted probabilistic random walk after 3698110 steps, run timeout after 30001 ms. (steps per millisecond=123 ) properties seen :[0]
Probabilistic random walk after 3698110 steps, saw 447993 distinct states, run finished after 30002 ms. (steps per millisecond=123 ) properties seen :[0]
// Phase 1: matrix 528 rows 628 cols
[2020-05-27 16:42:40] [INFO ] Computed 221 place invariants in 23 ms
[2020-05-27 16:42:40] [INFO ] [Real]Absence check using 215 positive place invariants in 108 ms returned sat
[2020-05-27 16:42:40] [INFO ] [Real]Absence check using 215 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-27 16:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:42:41] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2020-05-27 16:42:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:42:41] [INFO ] [Nat]Absence check using 215 positive place invariants in 111 ms returned sat
[2020-05-27 16:42:41] [INFO ] [Nat]Absence check using 215 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-27 16:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:42:42] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2020-05-27 16:42:42] [INFO ] Deduced a trap composed of 6 places in 157 ms
[2020-05-27 16:42:42] [INFO ] Deduced a trap composed of 9 places in 134 ms
[2020-05-27 16:42:42] [INFO ] Deduced a trap composed of 9 places in 132 ms
[2020-05-27 16:42:43] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-05-27 16:42:43] [INFO ] Deduced a trap composed of 5 places in 113 ms
[2020-05-27 16:42:43] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-05-27 16:42:43] [INFO ] Deduced a trap composed of 5 places in 117 ms
[2020-05-27 16:42:43] [INFO ] Deduced a trap composed of 9 places in 106 ms
[2020-05-27 16:42:43] [INFO ] Deduced a trap composed of 6 places in 88 ms
[2020-05-27 16:42:43] [INFO ] Deduced a trap composed of 5 places in 84 ms
[2020-05-27 16:42:43] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-27 16:42:44] [INFO ] Deduced a trap composed of 6 places in 78 ms
[2020-05-27 16:42:44] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-27 16:42:44] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2020-05-27 16:42:44] [INFO ] Deduced a trap composed of 6 places in 70 ms
[2020-05-27 16:42:44] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-05-27 16:42:44] [INFO ] Deduced a trap composed of 7 places in 71 ms
[2020-05-27 16:42:44] [INFO ] Deduced a trap composed of 9 places in 71 ms
[2020-05-27 16:42:44] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-05-27 16:42:44] [INFO ] Deduced a trap composed of 17 places in 67 ms
[2020-05-27 16:42:44] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2277 ms
[2020-05-27 16:42:44] [INFO ] Computed and/alt/rep : 524/1579/524 causal constraints in 27 ms.
[2020-05-27 16:42:56] [INFO ] Added : 485 causal constraints over 98 iterations in 11819 ms. Result :unknown
Incomplete Parikh walk after 41700 steps, including 667 resets, run finished after 274 ms. (steps per millisecond=152 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 628 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 628/628 places, 528/528 transitions.
Applied a total of 0 rules in 15 ms. Remains 628 /628 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 628/628 places, 528/528 transitions.
Starting structural reductions, iteration 0 : 628/628 places, 528/528 transitions.
Applied a total of 0 rules in 15 ms. Remains 628 /628 variables (removed 0) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 628 cols
[2020-05-27 16:42:56] [INFO ] Computed 221 place invariants in 5 ms
[2020-05-27 16:42:57] [INFO ] Implicit Places using invariants in 1050 ms returned []
// Phase 1: matrix 528 rows 628 cols
[2020-05-27 16:42:57] [INFO ] Computed 221 place invariants in 5 ms
[2020-05-27 16:43:01] [INFO ] Implicit Places using invariants and state equation in 3994 ms returned []
Implicit Place search using SMT with State Equation took 5046 ms to find 0 implicit places.
[2020-05-27 16:43:01] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 528 rows 628 cols
[2020-05-27 16:43:01] [INFO ] Computed 221 place invariants in 6 ms
[2020-05-27 16:43:02] [INFO ] Dead Transitions using invariants and state equation in 848 ms returned []
Finished structural reductions, in 1 iterations. Remains : 628/628 places, 528/528 transitions.
Incomplete random walk after 100000 steps, including 22 resets, run finished after 578 ms. (steps per millisecond=173 ) properties seen :[0]
// Phase 1: matrix 528 rows 628 cols
[2020-05-27 16:43:03] [INFO ] Computed 221 place invariants in 3 ms
[2020-05-27 16:43:03] [INFO ] [Real]Absence check using 215 positive place invariants in 112 ms returned sat
[2020-05-27 16:43:03] [INFO ] [Real]Absence check using 215 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-27 16:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:43:04] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2020-05-27 16:43:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:43:04] [INFO ] [Nat]Absence check using 215 positive place invariants in 114 ms returned sat
[2020-05-27 16:43:04] [INFO ] [Nat]Absence check using 215 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-27 16:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:43:05] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2020-05-27 16:43:05] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2020-05-27 16:43:05] [INFO ] Deduced a trap composed of 9 places in 118 ms
[2020-05-27 16:43:06] [INFO ] Deduced a trap composed of 9 places in 114 ms
[2020-05-27 16:43:06] [INFO ] Deduced a trap composed of 4 places in 99 ms
[2020-05-27 16:43:06] [INFO ] Deduced a trap composed of 5 places in 99 ms
[2020-05-27 16:43:06] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-05-27 16:43:06] [INFO ] Deduced a trap composed of 5 places in 126 ms
[2020-05-27 16:43:06] [INFO ] Deduced a trap composed of 9 places in 121 ms
[2020-05-27 16:43:06] [INFO ] Deduced a trap composed of 6 places in 111 ms
[2020-05-27 16:43:07] [INFO ] Deduced a trap composed of 5 places in 105 ms
[2020-05-27 16:43:07] [INFO ] Deduced a trap composed of 4 places in 145 ms
[2020-05-27 16:43:07] [INFO ] Deduced a trap composed of 6 places in 110 ms
[2020-05-27 16:43:07] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-05-27 16:43:07] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-05-27 16:43:07] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-05-27 16:43:07] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-05-27 16:43:07] [INFO ] Deduced a trap composed of 7 places in 92 ms
[2020-05-27 16:43:07] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-05-27 16:43:08] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-27 16:43:08] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-05-27 16:43:08] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2657 ms
[2020-05-27 16:43:08] [INFO ] Computed and/alt/rep : 524/1579/524 causal constraints in 27 ms.
[2020-05-27 16:43:20] [INFO ] Added : 485 causal constraints over 98 iterations in 11923 ms. Result :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 628 transition count 528
Applied a total of 2 rules in 48 ms. Remains 628 /628 variables (removed 0) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 628 cols
[2020-05-27 16:43:20] [INFO ] Computed 221 place invariants in 7 ms
[2020-05-27 16:43:20] [INFO ] [Real]Absence check using 216 positive place invariants in 117 ms returned sat
[2020-05-27 16:43:20] [INFO ] [Real]Absence check using 216 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-27 16:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:43:21] [INFO ] [Real]Absence check using state equation in 874 ms returned sat
[2020-05-27 16:43:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:43:21] [INFO ] [Nat]Absence check using 216 positive place invariants in 81 ms returned sat
[2020-05-27 16:43:21] [INFO ] [Nat]Absence check using 216 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-27 16:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:43:22] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2020-05-27 16:43:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-27 16:43:22] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2020-05-27 16:43:22] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2020-05-27 16:43:22] [INFO ] Deduced a trap composed of 5 places in 123 ms
[2020-05-27 16:43:22] [INFO ] Deduced a trap composed of 6 places in 128 ms
[2020-05-27 16:43:22] [INFO ] Deduced a trap composed of 9 places in 137 ms
[2020-05-27 16:43:23] [INFO ] Deduced a trap composed of 5 places in 123 ms
[2020-05-27 16:43:23] [INFO ] Deduced a trap composed of 5 places in 128 ms
[2020-05-27 16:43:23] [INFO ] Deduced a trap composed of 6 places in 128 ms
[2020-05-27 16:43:23] [INFO ] Deduced a trap composed of 9 places in 169 ms
[2020-05-27 16:43:23] [INFO ] Deduced a trap composed of 6 places in 141 ms
[2020-05-27 16:43:23] [INFO ] Deduced a trap composed of 6 places in 146 ms
[2020-05-27 16:43:24] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2020-05-27 16:43:24] [INFO ] Deduced a trap composed of 9 places in 104 ms
[2020-05-27 16:43:24] [INFO ] Deduced a trap composed of 5 places in 135 ms
[2020-05-27 16:43:24] [INFO ] Deduced a trap composed of 6 places in 111 ms
[2020-05-27 16:43:24] [INFO ] Deduced a trap composed of 6 places in 81 ms
[2020-05-27 16:43:24] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-05-27 16:43:24] [INFO ] Deduced a trap composed of 6 places in 79 ms
[2020-05-27 16:43:24] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-05-27 16:43:25] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-05-27 16:43:25] [INFO ] Deduced a trap composed of 6 places in 119 ms
[2020-05-27 16:43:25] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-05-27 16:43:25] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-05-27 16:43:25] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-05-27 16:43:25] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-05-27 16:43:25] [INFO ] Deduced a trap composed of 4 places in 138 ms
[2020-05-27 16:43:25] [INFO ] Deduced a trap composed of 13 places in 93 ms
[2020-05-27 16:43:26] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3700 ms
[2020-05-27 16:43:26] [INFO ] Computed and/alt/rep : 524/1588/524 causal constraints in 23 ms.
[2020-05-27 16:43:38] [INFO ] Added : 490 causal constraints over 98 iterations in 12569 ms. Result :unknown
[2020-05-27 16:43:38] [INFO ] Flatten gal took : 160 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 16:43:39] [INFO ] Applying decomposition
[2020-05-27 16:43:39] [INFO ] Flatten gal took : 89 ms
[2020-05-27 16:43:39] [INFO ] Flatten gal took : 90 ms
[2020-05-27 16:43:39] [INFO ] Input system was already deterministic with 528 transitions.
[2020-05-27 16:43:39] [INFO ] Input system was already deterministic with 528 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16845432006484476341.txt, -o, /tmp/graph16845432006484476341.bin, -w, /tmp/graph16845432006484476341.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16845432006484476341.bin, -l, -1, -v, -w, /tmp/graph16845432006484476341.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 16:43:39] [INFO ] Decomposing Gal with order
[2020-05-27 16:43:39] [INFO ] Ran tautology test, simplified 0 / 1 in 585 ms.
[2020-05-27 16:43:39] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 528 rows 628 cols
[2020-05-27 16:43:39] [INFO ] Computed 221 place invariants in 3 ms
inv : p266 + p268 = 1
inv : p1017 + p1020 + p1022 + p1024 = 1
inv : p1046 + p1051 + p1052 = 1
inv : p299 + p301 = 1
inv : p428 + p429 + p450 + p455 + p456 = 1
inv : p146 + p149 + p151 + p153 = 1
inv : p1324 + p1325 = 1
inv : p428 + p429 + p443 + p448 + p449 = 1
inv : p1039 + p1044 + p1045 = 1
inv : p986 + p991 + p992 = 1
inv : p500 + p502 = 1
inv : p1342 + p1344 + p1346 + p1348 = 1
inv : -p506 - p507 + p508 + p509 = 0
inv : p1120 + p1125 + p1126 = 1
inv : p1103 + p1105 = 1
inv : p912 + p915 + p916 = 1
inv : p1113 + p1118 + p1119 = 1
inv : p34 + p39 + p40 = 1
inv : p1218 + p1221 + p1223 + p1225 = 1
inv : p802 + p804 = 1
inv : p869 + p871 = 1
inv : p1127 + p1129 + p1131 + p1133 = 1
inv : p672 + p674 + p676 + p678 = 1
inv : p428 + p429 + p457 + p459 + p461 + p463 = 1
inv : p48 + p51 + p52 = 1
inv : p1053 + p1058 + p1059 = 1
inv : p972 + p977 + p978 = 1
inv : p98 + p100 = 1
inv : p383 + p386 + p387 = 1
inv : p1247 + p1252 + p1253 = 1
inv : p471 + p473 + p475 + p477 = 1
inv : p905 + p907 + p908 + p909 = 1
inv : p309 + p312 + p313 = 1
inv : p634 + p636 = 1
inv : p1173 + p1178 + p1179 = 1
inv : p376 + p379 + p380 = 1
inv : p969 + p971 = 1
inv : p1007 + p1009 + p1011 + p1013 = 1
inv : p1314 + p1319 + p1320 = 1
inv : p510 + p515 + p516 = 1
inv : p792 + p794 + p796 + p798 = 1
inv : p1271 + p1273 = 1
inv : p548 + p551 + p553 + p555 = 1
inv : p1180 + p1185 + p1186 = 1
inv : p41 + p44 + p45 = 1
inv : p69 + p71 + p73 + p75 = 1
inv : p48 + p53 + p54 = 1
inv : p168 + p171 + p172 = 1
inv : p270 + p272 + p274 + p276 = 1
inv : p584 + p589 + p590 = 1
inv : -p982 - p983 + p984 + p985 = 0
inv : p1070 + p1072 = 1
inv : p1053 + p1056 + p1057 = 1
inv : p979 + p982 + p983 = 1
inv : p242 + p245 + p246 = 1
inv : p1106 + p1111 + p1112 = 1
inv : p347 + p350 + p352 + p354 = 1
inv : p256 + p258 + p260 + p262 = 1
inv : p65 + p67 = 1
inv : p1328 + p1332 + p1334 = 1
inv : p1120 + p1123 + p1124 = 1
inv : p400 + p402 = 1
inv : p651 + p656 + p657 = 1
inv : p838 + p841 + p842 = 1
inv : p637 + p642 + p643 = 1
inv : p1187 + p1190 + p1191 = 1
inv : p785 + p790 + p791 = 1
inv : p1039 + p1042 + p1043 = 1
inv : p1208 + p1210 + p1212 + p1214 = 1
inv : p189 + p191 + p193 + p195 = 1
inv : p1338 + p1340 = 1
inv : p115 + p117 + p120 + p121 = 1
inv : p919 + p924 + p925 = 1
inv : p644 + p649 + p650 = 1
inv : p428 + p429 + p436 + p439 + p440 = 1
inv : p1173 + p1176 + p1177 = 1
inv : p132 + p134 = 1
inv : p852 + p855 + p856 = 1
inv : p1261 + p1263 + p1265 + p1267 = 1
inv : p302 + p307 + p308 = 1
inv : p806 + p808 + p810 + p812 = 1
inv : p986 + p989 + p990 = 1
inv : p1046 + p1049 + p1050 = 1
inv : p1314 + p1317 + p1318 = 1
inv : p1326 + p1327 = 1
inv : p749 + p752 + p754 + p756 = 1
inv : p31 + p33 = 1
inv : p168 + p173 + p174 = 1
inv : p647 + p648 - p649 - p650 = 0
inv : p1141 + p1143 + p1145 + p1147 = 1
inv : p122 + p124 + p126 + p128 = 1
inv : p584 + p587 + p588 = 1
inv : p136 + p138 + p140 + p142 = 1
inv : p950 + p953 + p955 + p957 = 1
inv : p1240 + p1245 + p1246 = 1
inv : p905 + p907 + p910 + p911 = 1
inv : p309 + p314 + p315 = 1
inv : p302 + p305 + p306 = 1
inv : p1352 + p1355 + p1357 + p1359 = 1
inv : p940 + p942 + p944 + p946 + p947 = 1
inv : p165 + p167 = 1
inv : p428 + p429 + p436 + p441 + p442 = 1
inv : p682 + p685 + p687 + p689 = 1
inv : p1187 + p1192 + p1193 = 1
inv : p55 + p57 + p58 + p59 + p61 = 1
inv : p249 + p252 + p253 = 1
inv : p1194 + p1196 + p1198 + p1200 = 1
inv : p41 + p46 + p47 = 1
inv : p34 + p37 + p38 = 1
inv : p845 + p848 + p849 = 1
inv : p919 + p922 + p923 = 1
inv : p115 + p117 + p118 + p119 = 1
inv : p1036 + p1038 = 1
inv : p1180 + p1183 + p1184 = 1
inv : p778 + p781 + p782 = 1
inv : p203 + p205 + p207 + p209 = 1
inv : p704 + p707 + p708 = 1
inv : p101 + p103 + p104 + p105 = 1
inv : p852 + p857 + p858 = 1
inv : p835 + p837 = 1
inv : p845 + p850 + p851 = 1
inv : p725 + p727 + p729 + p731 = 1
inv : p711 + p714 + p715 = 1
inv : p771 + p774 + p775 = 1
inv : p875 + p877 + p879 + p881 = 1
inv : p1074 + p1076 + p1078 + p1080 = 1
inv : p414 + p417 + p419 + p421 = 1
inv : p182 + p187 + p188 = 1
inv : p838 + p843 + p844 = 1
inv : p567 + p569 = 1
inv : p615 + p618 + p620 + p622 = 1
inv : p637 + p640 + p641 = 1
inv : p570 + p573 + p574 = 1
inv : p816 + p819 + p821 + p822 + p823 = 1
inv : p333 + p335 = 1
inv : p718 + p721 + p722 = 1
inv : p1275 + p1277 + p1279 + p1281 = 1
inv : p1003 + p1005 = 1
inv : p323 + p325 + p327 + p329 = 1
inv : -p379 - p380 + p381 + p382 = 0
inv : p232 + p234 = 1
inv : p524 + p526 + p528 + p530 = 1
inv : p993 + p995 + p997 + p999 = 1
inv : p428 + p467 + p469 = 1
inv : p1084 + p1087 + p1089 + p1091 = 1
inv : p1307 + p1310 + p1311 = 1
inv : p108 + p113 + p114 = 1
inv : p20 + p22 = 1
inv : p249 + p254 + p255 = 1
inv : p503 + p506 + p507 = 1
inv : p316 + p321 + p322 = 1
inv : p175 + p180 + p181 = 1
inv : p1170 + p1172 = 1
inv : p577 + p580 + p581 = 1
inv : p883 + p886 + p888 + p890 = 1
inv : p735 + p737 = 1
inv : p926 + p928 + p930 + p932 = 1
inv : p771 + p776 + p777 = 1
inv : p785 + p788 + p789 = 1
inv : p1240 + p1243 + p1244 = 1
inv : p199 + p201 = 1
inv : p428 + p429 + p433 + p435 = 1
inv : p1060 + p1062 + p1064 + p1066 = 1
inv : p859 + p861 + p863 + p865 = 1
inv : p534 + p536 = 1
inv : p739 + p741 + p743 + p745 = 1
inv : p1113 + p1116 + p1117 = 1
inv : p1204 + p1206 = 1
inv : p1237 + p1239 = 1
inv : p912 + p917 + p918 = 1
inv : p428 + p429 + p443 + p446 + p447 = 1
inv : p1151 + p1154 + p1156 + p1158 = 1
inv : p1106 + p1109 + p1110 = 1
inv : p182 + p185 + p186 = 1
inv : p280 + p283 + p285 + p287 = 1
inv : p337 + p339 + p341 + p343 = 1
inv : -p781 - p782 + p783 + p784 = 0
inv : p79 + p82 + p84 + p86 = 1
inv : p718 + p723 + p724 = 1
inv : p668 + p670 = 1
inv : p538 + p540 + p542 + p544 = 1
inv : p369 + p374 + p375 = 1
inv : p701 + p703 = 1
inv : p481 + p484 + p486 + p488 = 1
inv : p577 + p582 + p583 = 1
inv : p383 + p388 + p389 = 1
inv : p658 + p660 + p662 + p664 = 1
inv : p1254 + p1257 + p1258 = 1
inv : p1304 + p1306 = 1
inv : p768 + p770 = 1
inv : p704 + p709 + p710 = 1
inv : p316 + p319 + p320 = 1
inv : p936 + p938 = 1
inv : p175 + p178 + p179 = 1
inv : -p1310 - p1311 + p1312 + p1313 = 0
inv : p510 + p513 + p514 = 1
inv : p235 + p238 + p239 = 1
inv : p242 + p247 + p248 = 1
inv : p517 + p522 + p523 = 1
inv : p601 + p603 = 1
inv : p605 + p607 + p609 + p611 = 1
inv : p235 + p240 + p241 = 1
inv : p1254 + p1259 + p1260 = 1
inv : p651 + p654 + p655 = 1
inv : p517 + p520 + p521 = 1
inv : p213 + p216 + p218 + p220 = 1
inv : p366 + p368 = 1
inv : p1247 + p1250 + p1251 = 1
inv : p101 + p103 + p106 + p107 = 1
inv : p390 + p392 + p394 + p396 = 1
inv : p591 + p593 + p595 + p597 = 1
inv : p972 + p975 + p976 = 1
inv : p404 + p406 + p408 + p410 = 1
inv : p1137 + p1139 = 1
inv : p570 + p575 + p576 = 1
inv : p902 + p904 = 1
inv : p428 + p429 + p450 + p453 + p454 = 1
inv : p1285 + p1287 + p1290 + p1292 = 1
inv : p369 + p372 + p373 = 1
inv : p711 + p716 + p717 = 1
inv : p108 + p111 + p112 = 1
Total of 221 invariants.
[2020-05-27 16:43:39] [INFO ] Computed 221 place invariants in 6 ms
[2020-05-27 16:43:39] [INFO ] BMC solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(UNSAT) depth K=0 took 65 ms
[2020-05-27 16:43:39] [INFO ] BMC solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(UNSAT) depth K=1 took 43 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 528 rows 628 cols
[2020-05-27 16:43:39] [INFO ] Computed 221 place invariants in 3 ms
inv : p266 + p268 = 1
inv : p1017 + p1020 + p1022 + p1024 = 1
inv : p1046 + p1051 + p1052 = 1
inv : p299 + p301 = 1
inv : p428 + p429 + p450 + p455 + p456 = 1
inv : p146 + p149 + p151 + p153 = 1
inv : p1324 + p1325 = 1
inv : p428 + p429 + p443 + p448 + p449 = 1
inv : p1039 + p1044 + p1045 = 1
inv : p986 + p991 + p992 = 1
inv : p500 + p502 = 1
inv : p1342 + p1344 + p1346 + p1348 = 1
inv : -p506 - p507 + p508 + p509 = 0
inv : p1120 + p1125 + p1126 = 1
inv : p1103 + p1105 = 1
inv : p912 + p915 + p916 = 1
inv : p1113 + p1118 + p1119 = 1
inv : p34 + p39 + p40 = 1
inv : p1218 + p1221 + p1223 + p1225 = 1
inv : p802 + p804 = 1
inv : p869 + p871 = 1
inv : p1127 + p1129 + p1131 + p1133 = 1
inv : p672 + p674 + p676 + p678 = 1
inv : p428 + p429 + p457 + p459 + p461 + p463 = 1
inv : p48 + p51 + p52 = 1
inv : p1053 + p1058 + p1059 = 1
inv : p972 + p977 + p978 = 1
inv : p98 + p100 = 1
inv : p383 + p386 + p387 = 1
inv : p1247 + p1252 + p1253 = 1
inv : p471 + p473 + p475 + p477 = 1
inv : p905 + p907 + p908 + p909 = 1
inv : p309 + p312 + p313 = 1
inv : p634 + p636 = 1
inv : p1173 + p1178 + p1179 = 1
inv : p376 + p379 + p380 = 1
inv : p969 + p971 = 1
inv : p1007 + p1009 + p1011 + p1013 = 1
inv : p1314 + p1319 + p1320 = 1
inv : p510 + p515 + p516 = 1
inv : p792 + p794 + p796 + p798 = 1
inv : p1271 + p1273 = 1
inv : p548 + p551 + p553 + p555 = 1
inv : p1180 + p1185 + p1186 = 1
inv : p41 + p44 + p45 = 1
inv : p69 + p71 + p73 + p75 = 1
inv : p48 + p53 + p54 = 1
inv : p168 + p171 + p172 = 1
inv : p270 + p272 + p274 + p276 = 1
inv : p584 + p589 + p590 = 1
inv : -p982 - p983 + p984 + p985 = 0
inv : p1070 + p1072 = 1
inv : p1053 + p1056 + p1057 = 1
inv : p979 + p982 + p983 = 1
inv : p242 + p245 + p246 = 1
inv : p1106 + p1111 + p1112 = 1
inv : p347 + p350 + p352 + p354 = 1
inv : p256 + p258 + p260 + p262 = 1
inv : p65 + p67 = 1
inv : p1328 + p1332 + p1334 = 1
inv : p1120 + p1123 + p1124 = 1
inv : p400 + p402 = 1
inv : p651 + p656 + p657 = 1
inv : p838 + p841 + p842 = 1
inv : p637 + p642 + p643 = 1
inv : p1187 + p1190 + p1191 = 1
inv : p785 + p790 + p791 = 1
inv : p1039 + p1042 + p1043 = 1
inv : p1208 + p1210 + p1212 + p1214 = 1
inv : p189 + p191 + p193 + p195 = 1
inv : p1338 + p1340 = 1
inv : p115 + p117 + p120 + p121 = 1
inv : p919 + p924 + p925 = 1
inv : p644 + p649 + p650 = 1
inv : p428 + p429 + p436 + p439 + p440 = 1
inv : p1173 + p1176 + p1177 = 1
inv : p132 + p134 = 1
inv : p852 + p855 + p856 = 1
inv : p1261 + p1263 + p1265 + p1267 = 1
inv : p302 + p307 + p308 = 1
inv : p806 + p808 + p810 + p812 = 1
inv : p986 + p989 + p990 = 1
inv : p1046 + p1049 + p1050 = 1
inv : p1314 + p1317 + p1318 = 1
inv : p1326 + p1327 = 1
inv : p749 + p752 + p754 + p756 = 1
inv : p31 + p33 = 1
inv : p168 + p173 + p174 = 1
inv : p647 + p648 - p649 - p650 = 0
inv : p1141 + p1143 + p1145 + p1147 = 1
inv : p122 + p124 + p126 + p128 = 1
inv : p584 + p587 + p588 = 1
inv : p136 + p138 + p140 + p142 = 1
inv : p950 + p953 + p955 + p957 = 1
inv : p1240 + p1245 + p1246 = 1
inv : p905 + p907 + p910 + p911 = 1
inv : p309 + p314 + p315 = 1
inv : p302 + p305 + p306 = 1
inv : p1352 + p1355 + p1357 + p1359 = 1
inv : p940 + p942 + p944 + p946 + p947 = 1
inv : p165 + p167 = 1
inv : p428 + p429 + p436 + p441 + p442 = 1
inv : p682 + p685 + p687 + p689 = 1
inv : p1187 + p1192 + p1193 = 1
inv : p55 + p57 + p58 + p59 + p61 = 1
inv : p249 + p252 + p253 = 1
inv : p1194 + p1196 + p1198 + p1200 = 1
inv : p41 + p46 + p47 = 1
inv : p34 + p37 + p38 = 1
inv : p845 + p848 + p849 = 1
inv : p919 + p922 + p923 = 1
inv : p115 + p117 + p118 + p119 = 1
inv : p1036 + p1038 = 1
inv : p1180 + p1183 + p1184 = 1
inv : p778 + p781 + p782 = 1
inv : p203 + p205 + p207 + p209 = 1
inv : p704 + p707 + p708 = 1
inv : p101 + p103 + p104 + p105 = 1
inv : p852 + p857 + p858 = 1
inv : p835 + p837 = 1
inv : p845 + p850 + p851 = 1
inv : p725 + p727 + p729 + p731 = 1
inv : p711 + p714 + p715 = 1
inv : p771 + p774 + p775 = 1
inv : p875 + p877 + p879 + p881 = 1
inv : p1074 + p1076 + p1078 + p1080 = 1
inv : p414 + p417 + p419 + p421 = 1
inv : p182 + p187 + p188 = 1
inv : p838 + p843 + p844 = 1
inv : p567 + p569 = 1
inv : p615 + p618 + p620 + p622 = 1
inv : p637 + p640 + p641 = 1
inv : p570 + p573 + p574 = 1
inv : p816 + p819 + p821 + p822 + p823 = 1
inv : p333 + p335 = 1
inv : p718 + p721 + p722 = 1
inv : p1275 + p1277 + p1279 + p1281 = 1
inv : p1003 + p1005 = 1
inv : p323 + p325 + p327 + p329 = 1
inv : -p379 - p380 + p381 + p382 = 0
inv : p232 + p234 = 1
inv : p524 + p526 + p528 + p530 = 1
inv : p993 + p995 + p997 + p999 = 1
inv : p428 + p467 + p469 = 1
inv : p1084 + p1087 + p1089 + p1091 = 1
inv : p1307 + p1310 + p1311 = 1
inv : p108 + p113 + p114 = 1
inv : p20 + p22 = 1
inv : p249 + p254 + p255 = 1
inv : p503 + p506 + p507 = 1
inv : p316 + p321 + p322 = 1
inv : p175 + p180 + p181 = 1
inv : p1170 + p1172 = 1
inv : p577 + p580 + p581 = 1
inv : p883 + p886 + p888 + p890 = 1
inv : p735 + p737 = 1
inv : p926 + p928 + p930 + p932 = 1
inv : p771 + p776 + p777 = 1
inv : p785 + p788 + p789 = 1
inv : p1240 + p1243 + p1244 = 1
inv : p199 + p201 = 1
inv : p428 + p429 + p433 + p435 = 1
inv : p1060 + p1062 + p1064 + p1066 = 1
inv : p859 + p861 + p863 + p865 = 1
inv : p534 + p536 = 1
inv : p739 + p741 + p743 + p745 = 1
inv : p1113 + p1116 + p1117 = 1
inv : p1204 + p1206 = 1
inv : p1237 + p1239 = 1
inv : p912 + p917 + p918 = 1
inv : p428 + p429 + p443 + p446 + p447 = 1
inv : p1151 + p1154 + p1156 + p1158 = 1
inv : p1106 + p1109 + p1110 = 1
inv : p182 + p185 + p186 = 1
inv : p280 + p283 + p285 + p287 = 1
inv : p337 + p339 + p341 + p343 = 1
inv : -p781 - p782 + p783 + p784 = 0
inv : p79 + p82 + p84 + p86 = 1
inv : p718 + p723 + p724 = 1
inv : p668 + p670 = 1
inv : p538 + p540 + p542 + p544 = 1
inv : p369 + p374 + p375 = 1
inv : p701 + p703 = 1
inv : p481 + p484 + p486 + p488 = 1
inv : p577 + p582 + p583 = 1
inv : p383 + p388 + p389 = 1
inv : p658 + p660 + p662 + p664 = 1
inv : p1254 + p1257 + p1258 = 1
inv : p1304 + p1306 = 1
inv : p768 + p770 = 1
inv : p704 + p709 + p710 = 1
inv : p316 + p319 + p320 = 1
inv : p936 + p938 = 1
inv : p175 + p178 + p179 = 1
inv : -p1310 - p1311 + p1312 + p1313 = 0
inv : p510 + p513 + p514 = 1
inv : p235 + p238 + p239 = 1
inv : p242 + p247 + p248 = 1
inv : p517 + p522 + p523 = 1
inv : p601 + p603 = 1
inv : p605 + p607 + p609 + p611 = 1
inv : p235 + p240 + p241 = 1
inv : p1254 + p1259 + p1260 = 1
inv : p651 + p654 + p655 = 1
inv : p517 + p520 + p521 = 1
inv : p213 + p216 + p218 + p220 = 1
inv : p366 + p368 = 1
inv : p1247 + p1250 + p1251 = 1
inv : p101 + p103 + p106 + p107 = 1
inv : p390 + p392 + p394 + p396 = 1
inv : p591 + p593 + p595 + p597 = 1
inv : p972 + p975 + p976 = 1
inv : p404 + p406 + p408 + p410 = 1
inv : p1137 + p1139 = 1
inv : p570 + p575 + p576 = 1
inv : p902 + p904 = 1
inv : p428 + p429 + p450 + p453 + p454 = 1
inv : p1285 + p1287 + p1290 + p1292 = 1
inv : p369 + p372 + p373 = 1
inv : p711 + p716 + p717 = 1
inv : p108 + p111 + p112 = 1
Total of 221 invariants.
[2020-05-27 16:43:39] [INFO ] Computed 221 place invariants in 5 ms
[2020-05-27 16:43:39] [INFO ] Removed a total of 262 redundant transitions.
[2020-05-27 16:43:40] [INFO ] Flatten gal took : 152 ms
[2020-05-27 16:43:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 433 labels/synchronizations in 44 ms.
[2020-05-27 16:43:40] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 20 ms
[2020-05-27 16:43:40] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ShieldPPPs-PT-020B-ReachabilityFireability-00 with value :(((((((i0.u12.p58==1)&&(i11.u124.p910==1))&&(i11.u130.p947==1))&&(i6.i1.i1.u70.p530!=1))&&(i6.i0.i0.u57.p429==1))&&((i11.u109.p822==1)||((i1.i0.i0.u11.p106==1)&&(i1.i0.i2.u17.p142==1))))&&(((i1.i0.i0.u10.p105==1)&&(i1.i0.i0.u10.p107==1))||((i1.i0.i2.u14.p120==1)&&(i1.i0.i2.u17.p140==1))))
built 24 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 15 ordering constraints for composite.
built 26 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 22 ordering constraints for composite.
built 19 ordering constraints for composite.
built 15 ordering constraints for composite.
built 22 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
[2020-05-27 16:43:40] [INFO ] BMC solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(UNSAT) depth K=2 took 465 ms
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
[2020-05-27 16:43:40] [INFO ] BMC solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(UNSAT) depth K=3 took 470 ms
SDD proceeding with computation, new max is 8192
[2020-05-27 16:43:41] [INFO ] Proved 628 variables to be positive in 1130 ms
[2020-05-27 16:43:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-020B-ReachabilityFireability-00
[2020-05-27 16:43:41] [INFO ] KInduction solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(SAT) depth K=0 took 28 ms
[2020-05-27 16:43:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-020B-ReachabilityFireability-00
[2020-05-27 16:43:41] [INFO ] KInduction solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(SAT) depth K=1 took 83 ms
[2020-05-27 16:43:41] [INFO ] Proved 628 variables to be positive in 1429 ms
[2020-05-27 16:43:41] [INFO ] Computing symmetric may disable matrix : 528 transitions.
[2020-05-27 16:43:41] [INFO ] Computation of disable matrix completed :0/528 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 16:43:41] [INFO ] Computation of Complete disable matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 16:43:41] [INFO ] Computing symmetric may enable matrix : 528 transitions.
[2020-05-27 16:43:41] [INFO ] Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 16:43:41] [INFO ] Computing symmetric co enabling matrix : 528 transitions.
SDD proceeding with computation, new max is 16384
[2020-05-27 16:43:44] [INFO ] Computation of co-enabling matrix(152/528) took 2927 ms. Total solver calls (SAT/UNSAT): 1319(101/1218)
[2020-05-27 16:43:47] [INFO ] Computation of co-enabling matrix(383/528) took 5930 ms. Total solver calls (SAT/UNSAT): 2395(222/2173)
[2020-05-27 16:43:48] [INFO ] Computation of Finished co-enabling matrix. took 7217 ms. Total solver calls (SAT/UNSAT): 2524(226/2298)
[2020-05-27 16:43:48] [INFO ] Computing Do-Not-Accords matrix : 528 transitions.
[2020-05-27 16:43:48] [INFO ] Computation of Completed DNA matrix. took 159 ms. Total solver calls (SAT/UNSAT): 40(0/40)
[2020-05-27 16:43:48] [INFO ] Built C files in 9707ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
SDD proceeding with computation, new max is 32768
Compilation finished in 7202 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 97 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPsPT020BReachabilityFireability00==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPsPT020BReachabilityFireability00==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPsPT020BReachabilityFireability00==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 16:44:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-020B-ReachabilityFireability-00
[2020-05-27 16:44:50] [INFO ] KInduction solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(SAT) depth K=2 took 69101 ms
[2020-05-27 16:45:04] [INFO ] BMC solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(UNSAT) depth K=4 took 83550 ms
[2020-05-27 16:45:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-020B-ReachabilityFireability-00
[2020-05-27 16:45:20] [INFO ] KInduction solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(SAT) depth K=3 took 30425 ms
SDD proceeding with computation, new max is 65536
[2020-05-27 16:49:27] [INFO ] BMC solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(UNSAT) depth K=5 took 263348 ms
[2020-05-27 16:52:53] [INFO ] BMC solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(UNSAT) depth K=6 took 205362 ms
SDD proceeding with computation, new max is 131072
[2020-05-27 17:02:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-020B-ReachabilityFireability-00
[2020-05-27 17:02:34] [INFO ] KInduction solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(SAT) depth K=4 took 1033638 ms
Detected timeout of ITS tools.
[2020-05-27 17:04:32] [INFO ] Applying decomposition
[2020-05-27 17:04:32] [INFO ] Flatten gal took : 24 ms
[2020-05-27 17:04:32] [INFO ] Decomposing Gal with order
[2020-05-27 17:04:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 17:04:32] [INFO ] Removed a total of 432 redundant transitions.
[2020-05-27 17:04:32] [INFO ] Flatten gal took : 135 ms
[2020-05-27 17:04:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 606 labels/synchronizations in 72 ms.
[2020-05-27 17:04:32] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 35 ms
[2020-05-27 17:04:32] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ShieldPPPs-PT-020B-ReachabilityFireability-00 with value :(((((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u38.p58==1)&&(i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u304.p910==1))&&(i0.i0.i0.i0.i0.i0.i1.i0.u313.p947==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u185.p530!=1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u568.p429==1))&&((i0.i0.i0.i0.i0.i0.i0.i0.i1.u272.p822==1)||((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u52.p106==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u61.p142==1))))&&(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u51.p105==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u52.p107==1))||((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i1.u58.p120==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u61.p140==1))))
built 1 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 17 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 23 ordering constraints for composite.
built 22 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 19 ordering constraints for composite.
built 26 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 17 ordering constraints for composite.
built 19 ordering constraints for composite.
built 18 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
[2020-05-27 17:05:31] [INFO ] BMC solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(UNSAT) depth K=7 took 758731 ms
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
ITS-tools command line returned an error code 137
[2020-05-27 17:17:21] [INFO ] Flatten gal took : 336 ms
[2020-05-27 17:17:22] [INFO ] Input system was already deterministic with 528 transitions.
[2020-05-27 17:17:23] [INFO ] Transformed 628 places.
[2020-05-27 17:17:23] [INFO ] Transformed 528 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-27 17:17:23] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 7 ms
[2020-05-27 17:17:23] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ShieldPPPs-PT-020B-ReachabilityFireability-00 with value :(((((((p58==1)&&(p910==1))&&(p947==1))&&(p530!=1))&&(p429==1))&&((p822==1)||((p106==1)&&(p142==1))))&&(((p105==1)&&(p107==1))||((p120==1)&&(p140==1))))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
SDD proceeding with computation, new max is 1048576
SDD proceeding with computation, new max is 2097152
ITS-tools command line returned an error code 137
[2020-05-27 17:30:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-020B-ReachabilityFireability-00
[2020-05-27 17:30:06] [INFO ] KInduction solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(SAT) depth K=5 took 1652062 ms
[2020-05-27 17:37:32] [INFO ] BMC solution for property ShieldPPPs-PT-020B-ReachabilityFireability-00(UNSAT) depth K=8 took 1921047 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-020B.tgz
mv ShieldPPPs-PT-020B 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 ;