About the Execution of ITS-Tools for ShieldIIPs-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.800 | 3600000.00 | 10519057.00 | 12934.70 | FFTTFFTTFTTTF?FT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475300166.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 ShieldIIPs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475300166
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 3.8K May 14 00:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 00:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 07:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 07:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 503K 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 ShieldIIPs-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1590571937352
[2020-05-27 09:32:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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 09:32:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 09:32:18] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2020-05-27 09:32:18] [INFO ] Transformed 1803 places.
[2020-05-27 09:32:18] [INFO ] Transformed 1773 transitions.
[2020-05-27 09:32:18] [INFO ] Found NUPN structural information;
[2020-05-27 09:32:18] [INFO ] Parsed PT model containing 1803 places and 1773 transitions in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0]
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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]
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1773 rows 1803 cols
[2020-05-27 09:32:19] [INFO ] Computed 271 place invariants in 36 ms
[2020-05-27 09:32:19] [INFO ] [Real]Absence check using 271 positive place invariants in 241 ms returned sat
[2020-05-27 09:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:24] [INFO ] [Real]Absence check using state equation in 4499 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 09:32:24] [INFO ] [Real]Absence check using 271 positive place invariants in 276 ms returned sat
[2020-05-27 09:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 09:32:29] [INFO ] [Real]Absence check using state equation in 4374 ms returned unknown
[2020-05-27 09:32:29] [INFO ] [Real]Absence check using 271 positive place invariants in 288 ms returned sat
[2020-05-27 09:32:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 09:32:34] [INFO ] [Real]Absence check using state equation in 4458 ms returned (error "Failed to check-sat")
[2020-05-27 09:32:34] [INFO ] [Real]Absence check using 271 positive place invariants in 330 ms returned sat
[2020-05-27 09:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 09:32:39] [INFO ] [Real]Absence check using state equation in 4445 ms returned unknown
Support contains 20 out of 1803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1803 transition count 1624
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 298 place count 1654 transition count 1624
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 298 place count 1654 transition count 1471
Deduced a syphon composed of 153 places in 10 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 604 place count 1501 transition count 1471
Symmetric choice reduction at 2 with 207 rule applications. Total rules 811 place count 1501 transition count 1471
Deduced a syphon composed of 207 places in 4 ms
Reduce places removed 207 places and 207 transitions.
Iterating global reduction 2 with 414 rules applied. Total rules applied 1225 place count 1294 transition count 1264
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 1225 place count 1294 transition count 1177
Deduced a syphon composed of 87 places in 5 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 1399 place count 1207 transition count 1177
Performed 431 Post agglomeration using F-continuation condition.Transition count delta: 431
Deduced a syphon composed of 431 places in 4 ms
Reduce places removed 431 places and 0 transitions.
Iterating global reduction 2 with 862 rules applied. Total rules applied 2261 place count 776 transition count 746
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 2 with 203 rules applied. Total rules applied 2464 place count 776 transition count 746
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 2465 place count 776 transition count 746
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2466 place count 775 transition count 745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2467 place count 774 transition count 745
Applied a total of 2467 rules in 754 ms. Remains 774 /1803 variables (removed 1029) and now considering 745/1773 (removed 1028) transitions.
Finished structural reductions, in 1 iterations. Remains : 774/1803 places, 745/1773 transitions.
Incomplete random walk after 1000000 steps, including 310 resets, run finished after 5672 ms. (steps per millisecond=176 ) properties seen :[0, 1, 0, 1]
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 3292 ms. (steps per millisecond=303 ) properties seen :[1, 0]
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 3525 ms. (steps per millisecond=283 ) properties seen :[0]
// Phase 1: matrix 745 rows 774 cols
[2020-05-27 09:32:52] [INFO ] Computed 270 place invariants in 36 ms
[2020-05-27 09:32:52] [INFO ] [Real]Absence check using 266 positive place invariants in 158 ms returned sat
[2020-05-27 09:32:52] [INFO ] [Real]Absence check using 266 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-27 09:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:54] [INFO ] [Real]Absence check using state equation in 1273 ms returned sat
[2020-05-27 09:32:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 09:32:54] [INFO ] [Nat]Absence check using 266 positive place invariants in 124 ms returned sat
[2020-05-27 09:32:54] [INFO ] [Nat]Absence check using 266 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-27 09:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 09:32:55] [INFO ] [Nat]Absence check using state equation in 1293 ms returned sat
[2020-05-27 09:32:55] [INFO ] Deduced a trap composed of 5 places in 107 ms
[2020-05-27 09:32:56] [INFO ] Deduced a trap composed of 7 places in 77 ms
[2020-05-27 09:32:56] [INFO ] Deduced a trap composed of 15 places in 75 ms
[2020-05-27 09:32:56] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-05-27 09:32:56] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2020-05-27 09:32:56] [INFO ] Deduced a trap composed of 10 places in 80 ms
[2020-05-27 09:32:56] [INFO ] Deduced a trap composed of 8 places in 146 ms
[2020-05-27 09:32:56] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2020-05-27 09:32:56] [INFO ] Deduced a trap composed of 9 places in 60 ms
[2020-05-27 09:32:56] [INFO ] Deduced a trap composed of 14 places in 83 ms
[2020-05-27 09:32:57] [INFO ] Deduced a trap composed of 10 places in 77 ms
[2020-05-27 09:32:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1309 ms
[2020-05-27 09:32:57] [INFO ] Computed and/alt/rep : 742/3976/742 causal constraints in 53 ms.
[2020-05-27 09:33:18] [INFO ] Added : 685 causal constraints over 137 iterations in 21519 ms.(timeout) Result :sat
[2020-05-27 09:33:18] [INFO ] Deduced a trap composed of 8 places in 66 ms
[2020-05-27 09:33:18] [INFO ] Deduced a trap composed of 10 places in 61 ms
[2020-05-27 09:33:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
Attempting to minimize the solution found.
Minimization took 78 ms.
Incomplete Parikh walk after 93200 steps, including 356 resets, run finished after 664 ms. (steps per millisecond=140 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 774 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 774/774 places, 745/745 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 757 transition count 728
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 757 transition count 728
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 756 transition count 727
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 755 transition count 726
Applied a total of 38 rules in 217 ms. Remains 755 /774 variables (removed 19) and now considering 726/745 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 755/774 places, 726/745 transitions.
Incomplete random walk after 1000000 steps, including 273 resets, run finished after 6186 ms. (steps per millisecond=161 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 22 resets, run finished after 3251 ms. (steps per millisecond=307 ) properties seen :[0]
Interrupted probabilistic random walk after 2542204 steps, run timeout after 30001 ms. (steps per millisecond=84 ) properties seen :[0]
Probabilistic random walk after 2542204 steps, saw 434077 distinct states, run finished after 30001 ms. (steps per millisecond=84 ) properties seen :[0]
// Phase 1: matrix 726 rows 755 cols
[2020-05-27 09:33:59] [INFO ] Computed 270 place invariants in 36 ms
[2020-05-27 09:33:59] [INFO ] [Real]Absence check using 268 positive place invariants in 106 ms returned sat
[2020-05-27 09:33:59] [INFO ] [Real]Absence check using 268 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-27 09:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:34:00] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2020-05-27 09:34:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 09:34:01] [INFO ] [Nat]Absence check using 268 positive place invariants in 103 ms returned sat
[2020-05-27 09:34:01] [INFO ] [Nat]Absence check using 268 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-27 09:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 09:34:02] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2020-05-27 09:34:02] [INFO ] Deduced a trap composed of 6 places in 120 ms
[2020-05-27 09:34:02] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-05-27 09:34:02] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-05-27 09:34:02] [INFO ] Deduced a trap composed of 17 places in 101 ms
[2020-05-27 09:34:02] [INFO ] Deduced a trap composed of 5 places in 110 ms
[2020-05-27 09:34:03] [INFO ] Deduced a trap composed of 14 places in 103 ms
[2020-05-27 09:34:03] [INFO ] Deduced a trap composed of 16 places in 80 ms
[2020-05-27 09:34:03] [INFO ] Deduced a trap composed of 17 places in 75 ms
[2020-05-27 09:34:03] [INFO ] Deduced a trap composed of 11 places in 69 ms
[2020-05-27 09:34:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1177 ms
[2020-05-27 09:34:03] [INFO ] Computed and/alt/rep : 723/2372/723 causal constraints in 49 ms.
[2020-05-27 09:34:26] [INFO ] Added : 704 causal constraints over 141 iterations in 22622 ms. Result :unknown
Incomplete Parikh walk after 67500 steps, including 493 resets, run finished after 484 ms. (steps per millisecond=139 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 755 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 755/755 places, 726/726 transitions.
Applied a total of 0 rules in 17 ms. Remains 755 /755 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 726/726 transitions.
Starting structural reductions, iteration 0 : 755/755 places, 726/726 transitions.
Applied a total of 0 rules in 16 ms. Remains 755 /755 variables (removed 0) and now considering 726/726 (removed 0) transitions.
// Phase 1: matrix 726 rows 755 cols
[2020-05-27 09:34:26] [INFO ] Computed 270 place invariants in 7 ms
[2020-05-27 09:34:27] [INFO ] Implicit Places using invariants in 1354 ms returned []
// Phase 1: matrix 726 rows 755 cols
[2020-05-27 09:34:27] [INFO ] Computed 270 place invariants in 5 ms
[2020-05-27 09:34:33] [INFO ] Implicit Places using invariants and state equation in 5518 ms returned []
Implicit Place search using SMT with State Equation took 6874 ms to find 0 implicit places.
[2020-05-27 09:34:33] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 726 rows 755 cols
[2020-05-27 09:34:33] [INFO ] Computed 270 place invariants in 7 ms
[2020-05-27 09:34:34] [INFO ] Dead Transitions using invariants and state equation in 1197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 755/755 places, 726/726 transitions.
Incomplete random walk after 100000 steps, including 26 resets, run finished after 563 ms. (steps per millisecond=177 ) properties seen :[0]
// Phase 1: matrix 726 rows 755 cols
[2020-05-27 09:34:35] [INFO ] Computed 270 place invariants in 5 ms
[2020-05-27 09:34:35] [INFO ] [Real]Absence check using 268 positive place invariants in 153 ms returned sat
[2020-05-27 09:34:35] [INFO ] [Real]Absence check using 268 positive and 2 generalized place invariants in 3 ms returned sat
[2020-05-27 09:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:34:36] [INFO ] [Real]Absence check using state equation in 1189 ms returned sat
[2020-05-27 09:34:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 09:34:36] [INFO ] [Nat]Absence check using 268 positive place invariants in 102 ms returned sat
[2020-05-27 09:34:36] [INFO ] [Nat]Absence check using 268 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-27 09:34:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 09:34:37] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2020-05-27 09:34:38] [INFO ] Deduced a trap composed of 6 places in 113 ms
[2020-05-27 09:34:38] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-27 09:34:38] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-27 09:34:38] [INFO ] Deduced a trap composed of 17 places in 81 ms
[2020-05-27 09:34:38] [INFO ] Deduced a trap composed of 5 places in 99 ms
[2020-05-27 09:34:38] [INFO ] Deduced a trap composed of 14 places in 84 ms
[2020-05-27 09:34:38] [INFO ] Deduced a trap composed of 16 places in 88 ms
[2020-05-27 09:34:38] [INFO ] Deduced a trap composed of 17 places in 92 ms
[2020-05-27 09:34:39] [INFO ] Deduced a trap composed of 11 places in 93 ms
[2020-05-27 09:34:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1105 ms
[2020-05-27 09:34:39] [INFO ] Computed and/alt/rep : 723/2372/723 causal constraints in 36 ms.
[2020-05-27 09:34:56] [INFO ] Added : 704 causal constraints over 141 iterations in 17724 ms. Result :unknown
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 755 transition count 726
Applied a total of 1 rules in 35 ms. Remains 755 /755 variables (removed 0) and now considering 726/726 (removed 0) transitions.
// Phase 1: matrix 726 rows 755 cols
[2020-05-27 09:34:56] [INFO ] Computed 270 place invariants in 8 ms
[2020-05-27 09:34:57] [INFO ] [Real]Absence check using 268 positive place invariants in 109 ms returned sat
[2020-05-27 09:34:57] [INFO ] [Real]Absence check using 268 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-27 09:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 09:34:58] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2020-05-27 09:34:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 09:34:58] [INFO ] [Nat]Absence check using 268 positive place invariants in 149 ms returned sat
[2020-05-27 09:34:58] [INFO ] [Nat]Absence check using 268 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-27 09:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 09:34:59] [INFO ] [Nat]Absence check using state equation in 1165 ms returned sat
[2020-05-27 09:34:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-27 09:34:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-05-27 09:34:59] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-27 09:35:00] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2020-05-27 09:35:00] [INFO ] Deduced a trap composed of 17 places in 86 ms
[2020-05-27 09:35:00] [INFO ] Deduced a trap composed of 7 places in 94 ms
[2020-05-27 09:35:00] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-05-27 09:35:00] [INFO ] Deduced a trap composed of 11 places in 61 ms
[2020-05-27 09:35:00] [INFO ] Deduced a trap composed of 6 places in 51 ms
[2020-05-27 09:35:00] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-05-27 09:35:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 854 ms
[2020-05-27 09:35:00] [INFO ] Computed and/alt/rep : 723/2376/723 causal constraints in 46 ms.
[2020-05-27 09:35:21] [INFO ] Added : 710 causal constraints over 142 iterations in 20667 ms. Result :unknown
[2020-05-27 09:35:21] [INFO ] Flatten gal took : 107 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 09:35:21] [INFO ] Applying decomposition
[2020-05-27 09:35:21] [INFO ] Flatten gal took : 152 ms
[2020-05-27 09:35:21] [INFO ] Flatten gal took : 120 ms
[2020-05-27 09:35:21] [INFO ] Input system was already deterministic with 726 transitions.
[2020-05-27 09:35:21] [INFO ] Input system was already deterministic with 726 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/graph3238710082048316358.txt, -o, /tmp/graph3238710082048316358.bin, -w, /tmp/graph3238710082048316358.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/graph3238710082048316358.bin, -l, -1, -v, -w, /tmp/graph3238710082048316358.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 09:35:22] [INFO ] Decomposing Gal with order
[2020-05-27 09:35:22] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 726 rows 755 cols
[2020-05-27 09:35:22] [INFO ] Computed 270 place invariants in 5 ms
inv : p494 + p497 + p499 + p501 = 1
inv : p287 + p289 = 1
inv : p228 + p230 = 1
inv : p169 + p171 = 1
inv : p1001 + p1003 + p1005 + p1007 = 1
inv : p175 + p177 + p179 + p181 = 1
inv : p346 + p348 = 1
inv : p811 + p816 + p817 = 1
inv : p1588 + p1590 = 1
inv : p634 + p639 + p640 = 1
inv : p682 + p684 + p693 + p696 + p697 = 1
inv : p1674 + p1677 + p1679 + p1681 = 1
inv : p1352 + p1354 = 1
inv : p1280 + p1282 = 1
inv : p457 + p462 + p463 = 1
inv : p657 + p659 = 1
inv : p1283 + p1288 + p1289 = 1
inv : p1460 + p1463 + p1464 = 1
inv : p1221 + p1223 = 1
inv : p682 + p684 + p690 + p692 = 1
inv : p307 + p309 + p311 + p313 = 1
inv : p1401 + p1404 + p1405 = 1
inv : p870 + p873 + p874 = 1
inv : p140 + p143 + p145 + p147 = 1
inv : p435 + p438 + p440 + p442 = 1
inv : p1129 + p1131 = 1
inv : p598 + p600 = 1
inv : p1306 + p1308 = 1
inv : p682 + p684 + p716 + p718 = 1
inv : p44 + p49 + p50 = 1
inv : p1011 + p1013 = 1
inv : p103 + p106 + p107 = 1
inv : p1296 + p1298 + p1300 + p1302 = 1
inv : p1251 + p1253 + p1255 + p1257 = 1
inv : p1470 + p1472 = 1
inv : p1473 + p1475 + p1477 + p1479 = 1
inv : p1103 + p1105 = 1
inv : p405 + p407 = 1
inv : p529 + p531 + p533 + p535 = 1
inv : p110 + p112 = 1
inv : p808 + p810 = 1
inv : p775 + p777 = 1
inv : p870 + p875 + p876 = 1
inv : p848 + p851 + p853 + p855 = 1
inv : p1401 + p1406 + p1407 = 1
inv : p867 + p869 = 1
inv : p952 + p954 = 1
inv : p1121 + p1123 + p1125 + p1127 = 1
inv : p162 + p165 + p166 = 1
inv : p1408 + p1410 = 1
inv : p467 + p469 = 1
inv : p103 + p108 + p109 = 1
inv : p126 + p128 = 1
inv : p1188 + p1190 = 1
inv : p1719 + p1721 = 1
inv : p1133 + p1135 + p1137 + p1139 = 1
inv : p1585 + p1587 = 1
inv : p1355 + p1357 + p1359 + p1361 = 1
inv : p1768 + p1772 + p1774 = 1
inv : p1224 + p1229 + p1230 = 1
inv : p395 + p397 = 1
inv : p470 + p472 + p474 + p476 = 1
inv : p1438 + p1441 + p1443 + p1445 = 1
inv : p1044 + p1046 = 1
inv : p425 + p427 + p429 + p431 = 1
inv : p1283 + p1286 + p1287 = 1
inv : p1261 + p1264 + p1266 + p1268 = 1
inv : p1529 + p1531 = 1
inv : p682 + p684 + p693 + p698 + p699 = 1
inv : p290 + p292 = 1
inv : p303 + p305 = 1
inv : p929 + p932 + p933 = 1
inv : p929 + p934 + p935 = 1
inv : p1290 + p1292 = 1
inv : p457 + p460 + p461 = 1
inv : p54 + p56 = 1
inv : p526 + p528 = 1
inv : p634 + p637 + p638 = 1
inv : p1637 + p1640 + p1641 = 1
inv : p113 + p115 = 1
inv : p789 + p792 + p794 + p796 = 1
inv : p480 + p482 = 1
inv : p1084 + p1087 + p1089 + p1091 = 1
inv : p258 + p261 + p263 + p265 = 1
inv : p1369 + p1371 + p1373 + p1375 = 1
inv : -p578 - p579 + p580 + p581 = 0
inv : p1752 + p1754 = 1
inv : p988 + p991 + p992 = 1
inv : p218 + p220 = 1
inv : p1532 + p1534 + p1536 + p1538 = 1
inv : p159 + p161 = 1
inv : p1310 + p1312 + p1314 + p1316 = 1
inv : p759 + p761 = 1
inv : p398 + p403 + p404 = 1
inv : p1526 + p1528 = 1
inv : p362 + p364 = 1
inv : p1047 + p1050 + p1051 = 1
inv : p231 + p233 = 1
inv : p1349 + p1351 = 1
inv : p1792 + p1795 + p1797 + p1799 = 1
inv : p516 + p519 + p520 = 1
inv : p336 + p338 = 1
inv : p1634 + p1636 = 1
inv : p1143 + p1146 + p1148 + p1150 = 1
inv : p41 + p43 = 1
inv : p1650 + p1652 + p1654 + p1656 = 1
inv : p1428 + p1430 + p1432 + p1434 = 1
inv : p1025 + p1028 + p1030 + p1032 = 1
inv : p376 + p379 + p381 + p383 = 1
inv : p749 + p751 = 1
inv : p199 + p202 + p204 + p206 = 1
inv : p1516 + p1518 = 1
inv : p612 + p615 + p617 + p619 = 1
inv : p682 + p730 + p733 + p735 + p737 = 1
inv : p988 + p993 + p994 = 1
inv : p398 + p401 + p402 = 1
inv : p1644 + p1646 = 1
inv : p516 + p521 + p522 = 1
inv : p1664 + p1666 + p1668 + p1670 = 1
inv : p1696 + p1699 + p1700 = 1
inv : p575 + p578 + p579 = 1
inv : p893 + p895 = 1
inv : p1487 + p1489 + p1491 + p1493 = 1
inv : p926 + p928 = 1
inv : p553 + p556 + p558 + p560 = 1
inv : p1709 + p1711 + p1713 + p1715 = 1
inv : p185 + p187 = 1
inv : p682 + p684 + p706 + p708 + p710 + p712 = 1
inv : p1723 + p1725 + p1727 + p1729 = 1
inv : p1247 + p1249 = 1
inv : p966 + p969 + p971 + p973 = 1
inv : p339 + p344 + p345 = 1
inv : p408 + p410 = 1
inv : p1411 + p1413 = 1
inv : p44 + p47 + p48 = 1
inv : p936 + p938 = 1
inv : p1546 + p1548 + p1550 + p1552 = 1
inv : p51 + p53 = 1
inv : p1113 + p1115 = 1
inv : p682 + p684 + p720 + p722 + p724 + p726 = 1
inv : p1070 + p1072 = 1
inv : p1591 + p1593 + p1595 + p1597 + p1598 = 1
inv : p1460 + p1465 + p1466 = 1
inv : p1601 + p1603 = 1
inv : p671 + p674 + p676 + p678 = 1
inv : p1519 + p1522 + p1523 = 1
inv : p317 + p320 + p322 + p324 = 1
inv : p339 + p342 + p343 = 1
inv : p998 + p1000 = 1
inv : p939 + p941 = 1
inv : p1342 + p1344 + p1347 + p1348 = 1
inv : p821 + p823 = 1
inv : p1578 + p1583 + p1584 = 1
inv : p1175 + p1177 = 1
inv : p1637 + p1642 + p1643 = 1
inv : p1414 + p1416 + p1418 + p1420 = 1
inv : p1320 + p1323 + p1325 + p1327 = 1
inv : p880 + p882 = 1
inv : p779 + p781 + p783 + p785 = 1
inv : p1234 + p1236 = 1
inv : p366 + p368 + p370 + p372 = 1
inv : p1192 + p1194 + p1196 + p1198 = 1
inv : p221 + p226 + p227 = 1
inv : p582 + p584 = 1
inv : p1060 + p1062 + p1064 + p1066 = 1
inv : p647 + p649 + p651 + p653 = 1
inv : p1293 + p1295 = 1
inv : p116 + p118 + p120 + p122 = 1
inv : p907 + p910 + p912 + p914 = 1
inv : p1733 + p1736 + p1738 + p1740 = 1
inv : p682 + p684 + p703 + p705 = 1
inv : p1116 + p1118 = 1
inv : p1647 + p1649 = 1
inv : p1605 + p1607 + p1609 + p1611 = 1
inv : p1575 + p1577 = 1
inv : p1703 + p1705 = 1
inv : p1483 + p1485 = 1
inv : p1202 + p1205 + p1207 + p1209 = 1
inv : p513 + p515 = 1
inv : p30 + p32 = 1
inv : p1762 + p1764 = 1
inv : p280 + p283 + p284 = 1
inv : p1365 + p1367 = 1
inv : p572 + p574 = 1
inv : p1542 + p1544 = 1
inv : p1457 + p1459 = 1
inv : p1706 + p1708 = 1
inv : p1074 + p1076 + p1078 + p1080 = 1
inv : p644 + p646 = 1
inv : p1578 + p1581 + p1582 = 1
inv : p1398 + p1400 = 1
inv : p1519 + p1524 + p1525 = 1
inv : p1778 + p1780 = 1
inv : p1237 + p1239 + p1241 + p1243 = 1
inv : p411 + p413 + p415 + p417 = 1
inv : p280 + p285 + p286 = 1
inv : p1379 + p1382 + p1384 + p1386 = 1
inv : p523 + p525 = 1
inv : p818 + p820 = 1
inv : p485 + p486 + p488 + p490 + p492 = 1
inv : p81 + p84 + p86 + p88 = 1
inv : p752 + p755 + p756 = 1
inv : p762 + p764 = 1
inv : p1755 + p1758 + p1759 = 1
inv : p1047 + p1052 + p1053 = 1
inv : p1106 + p1109 + p1110 = 1
inv : p1178 + p1180 + p1182 + p1184 = 1
inv : p1696 + p1701 + p1702 = 1
inv : p1615 + p1618 + p1620 + p1622 = 1
inv : p824 + p826 + p828 + p830 = 1
inv : -p1758 - p1759 + p1760 + p1761 = 0
inv : p1497 + p1500 + p1502 + p1504 = 1
inv : p1231 + p1233 = 1
inv : p1015 + p1017 + p1019 + p1021 = 1
inv : p682 + p684 + p700 + p702 = 1
inv : p454 + p456 = 1
inv : p1224 + p1227 + p1228 = 1
inv : p221 + p224 + p225 = 1
inv : p421 + p423 = 1
inv : p172 + p174 = 1
inv : p602 + p604 + p606 + p608 = 1
inv : p811 + p814 + p815 = 1
inv : p1054 + p1056 = 1
inv : p995 + p997 = 1
inv : p543 + p545 + p547 + p549 = 1
inv : p585 + p587 = 1
inv : p349 + p351 = 1
inv : p877 + p879 = 1
inv : p244 + p246 = 1
inv : p67 + p69 = 1
inv : p1556 + p1559 + p1561 + p1563 = 1
inv : p1165 + p1170 + p1171 = 1
inv : p956 + p958 + p960 + p962 = 1
inv : p1342 + p1344 + p1345 + p1346 = 1
inv : p1660 + p1662 = 1
inv : p661 + p663 + p665 + p667 = 1
inv : p57 + p59 + p61 + p63 = 1
inv : p588 + p590 + p591 + p592 + p594 = 1
inv : p1172 + p1174 = 1
inv : p352 + p354 + p356 + p358 = 1
inv : p765 + p767 + p769 + p771 = 1
inv : p641 + p643 = 1
inv : p1424 + p1426 = 1
inv : p834 + p836 = 1
inv : p1782 + p1784 + p1786 + p1788 = 1
inv : p897 + p899 + p901 + p903 = 1
inv : p71 + p73 + p75 + p77 = 1
inv : p1106 + p1111 + p1112 = 1
inv : p1165 + p1168 + p1169 = 1
inv : p942 + p944 + p946 + p948 = 1
inv : p985 + p987 = 1
inv : p293 + p295 + p297 + p299 = 1
inv : p752 + p757 + p758 = 1
inv : p248 + p250 + p252 + p254 = 1
inv : p1467 + p1469 = 1
inv : p539 + p541 = 1
inv : p1693 + p1695 = 1
inv : p1162 + p1164 = 1
inv : p234 + p236 + p238 + p240 = 1
inv : p1339 + p1341 = 1
inv : p162 + p167 + p168 = 1
inv : p100 + p102 = 1
inv : p631 + p633 = 1
inv : p130 + p132 + p134 + p136 = 1
inv : p277 + p279 = 1
inv : p464 + p466 = 1
inv : p189 + p191 + p193 + p195 = 1
inv : p838 + p840 + p842 + p844 = 1
inv : p1057 + p1059 = 1
inv : p883 + p885 + p887 + p889 = 1
Total of 270 invariants.
[2020-05-27 09:35:22] [INFO ] Computed 270 place invariants in 20 ms
[2020-05-27 09:35:22] [INFO ] Ran tautology test, simplified 0 / 1 in 465 ms.
[2020-05-27 09:35:22] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(UNSAT) depth K=0 took 30 ms
[2020-05-27 09:35:22] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(UNSAT) depth K=1 took 7 ms
[2020-05-27 09:35:22] [INFO ] Removed a total of 565 redundant transitions.
[2020-05-27 09:35:22] [INFO ] Flatten gal took : 136 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 726 rows 755 cols
[2020-05-27 09:35:22] [INFO ] Computed 270 place invariants in 6 ms
inv : p494 + p497 + p499 + p501 = 1
inv : p287 + p289 = 1
inv : p228 + p230 = 1
inv : p169 + p171 = 1
inv : p1001 + p1003 + p1005 + p1007 = 1
inv : p175 + p177 + p179 + p181 = 1
inv : p346 + p348 = 1
inv : p811 + p816 + p817 = 1
inv : p1588 + p1590 = 1
inv : p634 + p639 + p640 = 1
inv : p682 + p684 + p693 + p696 + p697 = 1
inv : p1674 + p1677 + p1679 + p1681 = 1
inv : p1352 + p1354 = 1
inv : p1280 + p1282 = 1
inv : p457 + p462 + p463 = 1
inv : p657 + p659 = 1
inv : p1283 + p1288 + p1289 = 1
inv : p1460 + p1463 + p1464 = 1
inv : p1221 + p1223 = 1
inv : p682 + p684 + p690 + p692 = 1
inv : p307 + p309 + p311 + p313 = 1
inv : p1401 + p1404 + p1405 = 1
inv : p870 + p873 + p874 = 1
inv : p140 + p143 + p145 + p147 = 1
inv : p435 + p438 + p440 + p442 = 1
inv : p1129 + p1131 = 1
inv : p598 + p600 = 1
inv : p1306 + p1308 = 1
inv : p682 + p684 + p716 + p718 = 1
inv : p44 + p49 + p50 = 1
inv : p1011 + p1013 = 1
inv : p103 + p106 + p107 = 1
inv : p1296 + p1298 + p1300 + p1302 = 1
inv : p1251 + p1253 + p1255 + p1257 = 1
inv : p1470 + p1472 = 1
inv : p1473 + p1475 + p1477 + p1479 = 1
inv : p1103 + p1105 = 1
inv : p405 + p407 = 1
inv : p529 + p531 + p533 + p535 = 1
inv : p110 + p112 = 1
inv : p808 + p810 = 1
inv : p775 + p777 = 1
inv : p870 + p875 + p876 = 1
inv : p848 + p851 + p853 + p855 = 1
inv : p1401 + p1406 + p1407 = 1
inv : p867 + p869 = 1
inv : p952 + p954 = 1
inv : p1121 + p1123 + p1125 + p1127 = 1
inv : p162 + p165 + p166 = 1
inv : p1408 + p1410 = 1
inv : p467 + p469 = 1
inv : p103 + p108 + p109 = 1
inv : p126 + p128 = 1
inv : p1188 + p1190 = 1
inv : p1719 + p1721 = 1
inv : p1133 + p1135 + p1137 + p1139 = 1
inv : p1585 + p1587 = 1
inv : p1355 + p1357 + p1359 + p1361 = 1
inv : p1768 + p1772 + p1774 = 1
inv : p1224 + p1229 + p1230 = 1
inv : p395 + p397 = 1
inv : p470 + p472 + p474 + p476 = 1
inv : p1438 + p1441 + p1443 + p1445 = 1
inv : p1044 + p1046 = 1
inv : p425 + p427 + p429 + p431 = 1
inv : p1283 + p1286 + p1287 = 1
inv : p1261 + p1264 + p1266 + p1268 = 1
inv : p1529 + p1531 = 1
inv : p682 + p684 + p693 + p698 + p699 = 1
inv : p290 + p292 = 1
inv : p303 + p305 = 1
inv : p929 + p932 + p933 = 1
inv : p929 + p934 + p935 = 1
inv : p1290 + p1292 = 1
inv : p457 + p460 + p461 = 1
inv : p54 + p56 = 1
inv : p526 + p528 = 1
inv : p634 + p637 + p638 = 1
inv : p1637 + p1640 + p1641 = 1
inv : p113 + p115 = 1
inv : p789 + p792 + p794 + p796 = 1
inv : p480 + p482 = 1
inv : p1084 + p1087 + p1089 + p1091 = 1
inv : p258 + p261 + p263 + p265 = 1
inv : p1369 + p1371 + p1373 + p1375 = 1
inv : -p578 - p579 + p580 + p581 = 0
inv : p1752 + p1754 = 1
inv : p988 + p991 + p992 = 1
inv : p218 + p220 = 1
inv : p1532 + p1534 + p1536 + p1538 = 1
inv : p159 + p161 = 1
inv : p1310 + p1312 + p1314 + p1316 = 1
inv : p759 + p761 = 1
inv : p398 + p403 + p404 = 1
inv : p1526 + p1528 = 1
inv : p362 + p364 = 1
inv : p1047 + p1050 + p1051 = 1
inv : p231 + p233 = 1
inv : p1349 + p1351 = 1
inv : p1792 + p1795 + p1797 + p1799 = 1
inv : p516 + p519 + p520 = 1
inv : p336 + p338 = 1
inv : p1634 + p1636 = 1
inv : p1143 + p1146 + p1148 + p1150 = 1
inv : p41 + p43 = 1
inv : p1650 + p1652 + p1654 + p1656 = 1
inv : p1428 + p1430 + p1432 + p1434 = 1
inv : p1025 + p1028 + p1030 + p1032 = 1
inv : p376 + p379 + p381 + p383 = 1
inv : p749 + p751 = 1
inv : p199 + p202 + p204 + p206 = 1
inv : p1516 + p1518 = 1
inv : p612 + p615 + p617 + p619 = 1
inv : p682 + p730 + p733 + p735 + p737 = 1
inv : p988 + p993 + p994 = 1
inv : p398 + p401 + p402 = 1
inv : p1644 + p1646 = 1
inv : p516 + p521 + p522 = 1
inv : p1664 + p1666 + p1668 + p1670 = 1
inv : p1696 + p1699 + p1700 = 1
inv : p575 + p578 + p579 = 1
inv : p893 + p895 = 1
inv : p1487 + p1489 + p1491 + p1493 = 1
inv : p926 + p928 = 1
inv : p553 + p556 + p558 + p560 = 1
inv : p1709 + p1711 + p1713 + p1715 = 1
inv : p185 + p187 = 1
inv : p682 + p684 + p706 + p708 + p710 + p712 = 1
inv : p1723 + p1725 + p1727 + p1729 = 1
inv : p1247 + p1249 = 1
inv : p966 + p969 + p971 + p973 = 1
inv : p339 + p344 + p345 = 1
inv : p408 + p410 = 1
inv : p1411 + p1413 = 1
inv : p44 + p47 + p48 = 1
inv : p936 + p938 = 1
inv : p1546 + p1548 + p1550 + p1552 = 1
inv : p51 + p53 = 1
inv : p1113 + p1115 = 1
inv : p682 + p684 + p720 + p722 + p724 + p726 = 1
inv : p1070 + p1072 = 1
inv : p1591 + p1593 + p1595 + p1597 + p1598 = 1
inv : p1460 + p1465 + p1466 = 1
inv : p1601 + p1603 = 1
inv : p671 + p674 + p676 + p678 = 1
inv : p1519 + p1522 + p1523 = 1
inv : p317 + p320 + p322 + p324 = 1
inv : p339 + p342 + p343 = 1
inv : p998 + p1000 = 1
inv : p939 + p941 = 1
inv : p1342 + p1344 + p1347 + p1348 = 1
inv : p821 + p823 = 1
inv : p1578 + p1583 + p1584 = 1
inv : p1175 + p1177 = 1
inv : p1637 + p1642 + p1643 = 1
inv : p1414 + p1416 + p1418 + p1420 = 1
inv : p1320 + p1323 + p1325 + p1327 = 1
inv : p880 + p882 = 1
inv : p779 + p781 + p783 + p785 = 1
inv : p1234 + p1236 = 1
inv : p366 + p368 + p370 + p372 = 1
inv : p1192 + p1194 + p1196 + p1198 = 1
inv : p221 + p226 + p227 = 1
inv : p582 + p584 = 1
inv : p1060 + p1062 + p1064 + p1066 = 1
inv : p647 + p649 + p651 + p653 = 1
inv : p1293 + p1295 = 1
inv : p116 + p118 + p120 + p122 = 1
inv : p907 + p910 + p912 + p914 = 1
inv : p1733 + p1736 + p1738 + p1740 = 1
inv : p682 + p684 + p703 + p705 = 1
inv : p1116 + p1118 = 1
inv : p1647 + p1649 = 1
inv : p1605 + p1607 + p1609 + p1611 = 1
inv : p1575 + p1577 = 1
inv : p1703 + p1705 = 1
inv : p1483 + p1485 = 1
inv : p1202 + p1205 + p1207 + p1209 = 1
inv : p513 + p515 = 1
inv : p30 + p32 = 1
inv : p1762 + p1764 = 1
inv : p280 + p283 + p284 = 1
inv : p1365 + p1367 = 1
inv : p572 + p574 = 1
inv : p1542 + p1544 = 1
inv : p1457 + p1459 = 1
inv : p1706 + p1708 = 1
inv : p1074 + p1076 + p1078 + p1080 = 1
inv : p644 + p646 = 1
inv : p1578 + p1581 + p1582 = 1
inv : p1398 + p1400 = 1
inv : p1519 + p1524 + p1525 = 1
inv : p1778 + p1780 = 1
inv : p1237 + p1239 + p1241 + p1243 = 1
inv : p411 + p413 + p415 + p417 = 1
inv : p280 + p285 + p286 = 1
inv : p1379 + p1382 + p1384 + p1386 = 1
inv : p523 + p525 = 1
inv : p818 + p820 = 1
inv : p485 + p486 + p488 + p490 + p492 = 1
inv : p81 + p84 + p86 + p88 = 1
inv : p752 + p755 + p756 = 1
inv : p762 + p764 = 1
inv : p1755 + p1758 + p1759 = 1
inv : p1047 + p1052 + p1053 = 1
inv : p1106 + p1109 + p1110 = 1
inv : p1178 + p1180 + p1182 + p1184 = 1
inv : p1696 + p1701 + p1702 = 1
inv : p1615 + p1618 + p1620 + p1622 = 1
inv : p824 + p826 + p828 + p830 = 1
inv : -p1758 - p1759 + p1760 + p1761 = 0
inv : p1497 + p1500 + p1502 + p1504 = 1
inv : p1231 + p1233 = 1
inv : p1015 + p1017 + p1019 + p1021 = 1
inv : p682 + p684 + p700 + p702 = 1
inv : p454 + p456 = 1
inv : p1224 + p1227 + p1228 = 1
inv : p221 + p224 + p225 = 1
inv : p421 + p423 = 1
inv : p172 + p174 = 1
inv : p602 + p604 + p606 + p608 = 1
inv : p811 + p814 + p815 = 1
inv : p1054 + p1056 = 1
inv : p995 + p997 = 1
inv : p543 + p545 + p547 + p549 = 1
inv : p585 + p587 = 1
inv : p349 + p351 = 1
inv : p877 + p879 = 1
inv : p244 + p246 = 1
inv : p67 + p69 = 1
inv : p1556 + p1559 + p1561 + p1563 = 1
inv : p1165 + p1170 + p1171 = 1
inv : p956 + p958 + p960 + p962 = 1
inv : p1342 + p1344 + p1345 + p1346 = 1
inv : p1660 + p1662 = 1
inv : p661 + p663 + p665 + p667 = 1
inv : p57 + p59 + p61 + p63 = 1
inv : p588 + p590 + p591 + p592 + p594 = 1
inv : p1172 + p1174 = 1
inv : p352 + p354 + p356 + p358 = 1
inv : p765 + p767 + p769 + p771 = 1
inv : p641 + p643 = 1
inv : p1424 + p1426 = 1
inv : p834 + p836 = 1
inv : p1782 + p1784 + p1786 + p1788 = 1
inv : p897 + p899 + p901 + p903 = 1
inv : p71 + p73 + p75 + p77 = 1
inv : p1106 + p1111 + p1112 = 1
inv : p1165 + p1168 + p1169 = 1
inv : p942 + p944 + p946 + p948 = 1
inv : p985 + p987 = 1
inv : p293 + p295 + p297 + p299 = 1
inv : p752 + p757 + p758 = 1
inv : p248 + p250 + p252 + p254 = 1
inv : p1467 + p1469 = 1
inv : p539 + p541 = 1
inv : p1693 + p1695 = 1
inv : p1162 + p1164 = 1
inv : p234 + p236 + p238 + p240 = 1
inv : p1339 + p1341 = 1
inv : p162 + p167 + p168 = 1
inv : p100 + p102 = 1
inv : p631 + p633 = 1
inv : p130 + p132 + p134 + p136 = 1
inv : p277 + p279 = 1
inv : p464 + p466 = 1
inv : p189 + p191 + p193 + p195 = 1
inv : p838 + p840 + p842 + p844 = 1
inv : p1057 + p1059 = 1
inv : p883 + p885 + p887 + p889 = 1
Total of 270 invariants.
[2020-05-27 09:35:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 743 labels/synchronizations in 52 ms.
[2020-05-27 09:35:22] [INFO ] Computed 270 place invariants in 28 ms
[2020-05-27 09:35:22] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(UNSAT) depth K=2 took 197 ms
[2020-05-27 09:35:22] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 15 ms
[2020-05-27 09:35:22] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 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/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : ShieldIIPs-PT-030B-ReachabilityCardinality-13 with value :(((i4.i1.i0.u79.p684!=0)&&(i10.i1.i1.u199.p1598!=1))&&(((i3.i0.i2.u57.p485!=0)&&(i7.u132.p1089!=1))||((i3.i1.i0.u71.p590!=0)&&(i8.i1.i2.u164.p1344!=1))))
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 21 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 20 ordering constraints for composite.
built 18 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 21 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 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
[2020-05-27 09:35:23] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(UNSAT) depth K=3 took 1007 ms
[2020-05-27 09:35:23] [INFO ] Proved 755 variables to be positive in 1733 ms
[2020-05-27 09:35:23] [INFO ] Computing symmetric may disable matrix : 726 transitions.
[2020-05-27 09:35:23] [INFO ] Computation of disable matrix completed :0/726 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 09:35:24] [INFO ] Computation of Complete disable matrix. took 83 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 09:35:24] [INFO ] Computing symmetric may enable matrix : 726 transitions.
[2020-05-27 09:35:24] [INFO ] Proved 755 variables to be positive in 1527 ms
[2020-05-27 09:35:24] [INFO ] Computation of Complete enable matrix. took 66 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 09:35:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityCardinality-13
[2020-05-27 09:35:24] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(SAT) depth K=0 took 46 ms
[2020-05-27 09:35:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityCardinality-13
[2020-05-27 09:35:24] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(SAT) depth K=1 took 129 ms
[2020-05-27 09:35:24] [INFO ] Computing symmetric co enabling matrix : 726 transitions.
SDD proceeding with computation, new max is 8192
[2020-05-27 09:35:27] [INFO ] Computation of co-enabling matrix(38/726) took 2817 ms. Total solver calls (SAT/UNSAT): 439(6/433)
SDD proceeding with computation, new max is 16384
[2020-05-27 09:35:30] [INFO ] Computation of co-enabling matrix(77/726) took 5873 ms. Total solver calls (SAT/UNSAT): 889(12/877)
[2020-05-27 09:35:33] [INFO ] Computation of co-enabling matrix(119/726) took 8877 ms. Total solver calls (SAT/UNSAT): 1325(52/1273)
[2020-05-27 09:35:36] [INFO ] Computation of co-enabling matrix(233/726) took 11886 ms. Total solver calls (SAT/UNSAT): 2289(223/2066)
[2020-05-27 09:35:39] [INFO ] Computation of co-enabling matrix(293/726) took 14941 ms. Total solver calls (SAT/UNSAT): 2779(292/2487)
[2020-05-27 09:35:42] [INFO ] Computation of co-enabling matrix(370/726) took 17957 ms. Total solver calls (SAT/UNSAT): 3386(380/3006)
[2020-05-27 09:35:45] [INFO ] Computation of co-enabling matrix(601/726) took 20962 ms. Total solver calls (SAT/UNSAT): 4570(550/4020)
[2020-05-27 09:35:46] [INFO ] Computation of Finished co-enabling matrix. took 22044 ms. Total solver calls (SAT/UNSAT): 4658(555/4103)
[2020-05-27 09:35:46] [INFO ] Computing Do-Not-Accords matrix : 726 transitions.
[2020-05-27 09:35:46] [INFO ] Computation of Completed DNA matrix. took 166 ms. Total solver calls (SAT/UNSAT): 8(0/8)
[2020-05-27 09:35:46] [INFO ] Built C files in 24964ms 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]
[2020-05-27 09:35:51] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(UNSAT) depth K=4 took 27684 ms
SDD proceeding with computation, new max is 32768
Compilation finished in 8635 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 58 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPsPT030BReachabilityCardinality13==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, ShieldIIPsPT030BReachabilityCardinality13==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, ShieldIIPsPT030BReachabilityCardinality13==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 09:36:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityCardinality-13
[2020-05-27 09:36:05] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(SAT) depth K=2 took 41359 ms
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
[2020-05-27 09:37:39] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(UNSAT) depth K=5 took 107962 ms
[2020-05-27 09:39:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityCardinality-13
[2020-05-27 09:39:39] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(SAT) depth K=3 took 213355 ms
[2020-05-27 09:42:54] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(UNSAT) depth K=6 took 315513 ms
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
Detected timeout of ITS tools.
[2020-05-27 09:56:23] [INFO ] Applying decomposition
[2020-05-27 09:56:23] [INFO ] Flatten gal took : 170 ms
[2020-05-27 09:56:24] [INFO ] Decomposing Gal with order
[2020-05-27 09:56:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 09:56:24] [INFO ] Removed a total of 683 redundant transitions.
[2020-05-27 09:56:24] [INFO ] Flatten gal took : 158 ms
[2020-05-27 09:56:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1464 labels/synchronizations in 63 ms.
[2020-05-27 09:56:24] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 50 ms
[2020-05-27 09:56:24] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : ShieldIIPs-PT-030B-ReachabilityCardinality-13 with value :(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u646.p684!=0)&&(i0.i0.i0.i1.i0.i0.i0.u486.p1598!=1))&&(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u165.p485!=0)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u336.p1089!=1))||((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u197.p590!=0)&&(i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u580.p1344!=1))))
built 1 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
[2020-05-27 10:02:59] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(UNSAT) depth K=7 took 1204619 ms
SDD proceeding with computation, new max is 524288
[2020-05-27 10:08:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityCardinality-13
[2020-05-27 10:08:06] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(SAT) depth K=4 took 1707105 ms
ITS-tools command line returned an error code 137
[2020-05-27 10:17:06] [INFO ] Flatten gal took : 110 ms
[2020-05-27 10:17:07] [INFO ] Input system was already deterministic with 726 transitions.
[2020-05-27 10:17:08] [INFO ] Transformed 755 places.
[2020-05-27 10:17:08] [INFO ] Transformed 726 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 10:17:08] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 16 ms
[2020-05-27 10:17:08] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 18 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/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.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 ReachabilityCardinality.prop.
Read [reachable] property : ShieldIIPs-PT-030B-ReachabilityCardinality-13 with value :(((p684!=0)&&(p1598!=1))&&(((p485!=0)&&(p1089!=1))||((p590!=0)&&(p1344!=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
[2020-05-27 10:31:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityCardinality-13
[2020-05-27 10:31:10] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityCardinality-13(SAT) depth K=5 took 1384031 ms
SDD proceeding with computation, new max is 4194304
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ShieldIIPs-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldIIPs-PT-030B, examination is ReachabilityCardinality"
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-159033475300166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030B.tgz
mv ShieldIIPs-PT-030B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;