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.r051-ebro-158902545900239.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 DES-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.0K Mar 30 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 30 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 73K Mar 24 05:37 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 DES-PT-05b-ReachabilityFireability-00
FORMULA_NAME DES-PT-05b-ReachabilityFireability-01
FORMULA_NAME DES-PT-05b-ReachabilityFireability-02
FORMULA_NAME DES-PT-05b-ReachabilityFireability-03
FORMULA_NAME DES-PT-05b-ReachabilityFireability-04
FORMULA_NAME DES-PT-05b-ReachabilityFireability-05
FORMULA_NAME DES-PT-05b-ReachabilityFireability-06
FORMULA_NAME DES-PT-05b-ReachabilityFireability-07
FORMULA_NAME DES-PT-05b-ReachabilityFireability-08
FORMULA_NAME DES-PT-05b-ReachabilityFireability-09
FORMULA_NAME DES-PT-05b-ReachabilityFireability-10
FORMULA_NAME DES-PT-05b-ReachabilityFireability-11
FORMULA_NAME DES-PT-05b-ReachabilityFireability-12
FORMULA_NAME DES-PT-05b-ReachabilityFireability-13
FORMULA_NAME DES-PT-05b-ReachabilityFireability-14
FORMULA_NAME DES-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589532573259

[2020-05-15 08:49:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-15 08:49:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 08:49:36] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2020-05-15 08:49:36] [INFO ] Transformed 300 places.
[2020-05-15 08:49:36] [INFO ] Transformed 251 transitions.
[2020-05-15 08:49:36] [INFO ] Found NUPN structural information;
[2020-05-15 08:49:36] [INFO ] Parsed PT model containing 300 places and 251 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 68 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 84 resets, run finished after 117 ms. (steps per millisecond=85 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1]
FORMULA DES-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[1, 0, 0, 0, 0]
FORMULA DES-PT-05b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 73 ms. (steps per millisecond=137 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 251 rows 300 cols
[2020-05-15 08:49:37] [INFO ] Computed 65 place invariants in 43 ms
[2020-05-15 08:49:37] [INFO ] [Real]Absence check using 40 positive place invariants in 69 ms returned sat
[2020-05-15 08:49:37] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 08:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:49:38] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2020-05-15 08:49:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:49:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 81 ms returned sat
[2020-05-15 08:49:38] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 29 ms returned sat
[2020-05-15 08:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:49:38] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2020-05-15 08:49:39] [INFO ] Deduced a trap composed of 21 places in 331 ms
[2020-05-15 08:49:39] [INFO ] Deduced a trap composed of 14 places in 138 ms
[2020-05-15 08:49:39] [INFO ] Deduced a trap composed of 14 places in 379 ms
[2020-05-15 08:49:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1037 ms
[2020-05-15 08:49:40] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 29 ms.
[2020-05-15 08:49:42] [INFO ] Added : 239 causal constraints over 49 iterations in 2729 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-15 08:49:42] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2020-05-15 08:49:42] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 30 ms returned sat
[2020-05-15 08:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:49:43] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2020-05-15 08:49:43] [INFO ] Deduced a trap composed of 10 places in 85 ms
[2020-05-15 08:49:43] [INFO ] Deduced a trap composed of 31 places in 84 ms
[2020-05-15 08:49:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2020-05-15 08:49:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:49:43] [INFO ] [Nat]Absence check using 40 positive place invariants in 57 ms returned sat
[2020-05-15 08:49:43] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 31 ms returned sat
[2020-05-15 08:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:49:44] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2020-05-15 08:49:44] [INFO ] Deduced a trap composed of 8 places in 70 ms
[2020-05-15 08:49:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2020-05-15 08:49:44] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 33 ms.
[2020-05-15 08:49:47] [INFO ] Added : 235 causal constraints over 47 iterations in 2473 ms. Result :sat
[2020-05-15 08:49:47] [INFO ] Deduced a trap composed of 31 places in 115 ms
[2020-05-15 08:49:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-05-15 08:49:47] [INFO ] [Real]Absence check using 40 positive place invariants in 32 ms returned unsat
[2020-05-15 08:49:47] [INFO ] [Real]Absence check using 40 positive place invariants in 49 ms returned sat
[2020-05-15 08:49:47] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 37 ms returned sat
[2020-05-15 08:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:49:48] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2020-05-15 08:49:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:49:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 72 ms returned sat
[2020-05-15 08:49:48] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 35 ms returned sat
[2020-05-15 08:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:49:49] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2020-05-15 08:49:49] [INFO ] Deduced a trap composed of 8 places in 158 ms
[2020-05-15 08:49:49] [INFO ] Deduced a trap composed of 43 places in 173 ms
[2020-05-15 08:49:49] [INFO ] Deduced a trap composed of 23 places in 94 ms
[2020-05-15 08:49:50] [INFO ] Deduced a trap composed of 12 places in 62 ms
[2020-05-15 08:49:50] [INFO ] Deduced a trap composed of 34 places in 178 ms
[2020-05-15 08:49:50] [INFO ] Deduced a trap composed of 32 places in 51 ms
[2020-05-15 08:49:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 919 ms
[2020-05-15 08:49:50] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 33 ms.
[2020-05-15 08:49:52] [INFO ] Added : 241 causal constraints over 49 iterations in 2554 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
FORMULA DES-PT-05b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 59100 steps, including 682 resets, run finished after 365 ms. (steps per millisecond=161 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 59200 steps, including 664 resets, run finished after 227 ms. (steps per millisecond=260 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 25300 steps, including 255 resets, run finished after 101 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 28 out of 300 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 300/300 places, 251/251 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 561 edges and 300 vertex of which 289 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.18 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 289 transition count 229
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 273 transition count 229
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 34 place count 273 transition count 224
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 268 transition count 224
Symmetric choice reduction at 2 with 17 rule applications. Total rules 61 place count 268 transition count 224
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 95 place count 251 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 95 place count 251 transition count 206
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 250 transition count 206
Symmetric choice reduction at 2 with 11 rule applications. Total rules 108 place count 250 transition count 206
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 130 place count 239 transition count 195
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 142 place count 239 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 237 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 144 place count 237 transition count 182
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 236 transition count 182
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 268 place count 175 transition count 121
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 274 place count 172 transition count 122
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 172 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 171 transition count 121
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 277 place count 171 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 278 place count 170 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 279 place count 169 transition count 120
Applied a total of 279 rules in 220 ms. Remains 169 /300 variables (removed 131) and now considering 120/251 (removed 131) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/300 places, 120/251 transitions.
Incomplete random walk after 1000000 steps, including 23852 resets, run finished after 3582 ms. (steps per millisecond=279 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3875 resets, run finished after 2141 ms. (steps per millisecond=467 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3323 resets, run finished after 2064 ms. (steps per millisecond=484 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4253 resets, run finished after 2690 ms. (steps per millisecond=371 ) properties seen :[0, 0, 1]
FORMULA DES-PT-05b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 120 rows 169 cols
[2020-05-15 08:50:04] [INFO ] Computed 59 place invariants in 15 ms
[2020-05-15 08:50:04] [INFO ] [Real]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-05-15 08:50:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2020-05-15 08:50:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:04] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-05-15 08:50:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:50:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 26 ms returned sat
[2020-05-15 08:50:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 67 ms returned sat
[2020-05-15 08:50:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:05] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2020-05-15 08:50:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 08:50:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2020-05-15 08:50:05] [INFO ] Computed and/alt/rep : 114/346/114 causal constraints in 16 ms.
[2020-05-15 08:50:05] [INFO ] Added : 94 causal constraints over 19 iterations in 624 ms. Result :sat
[2020-05-15 08:50:05] [INFO ] Deduced a trap composed of 11 places in 76 ms
[2020-05-15 08:50:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-15 08:50:06] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2020-05-15 08:50:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2020-05-15 08:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:06] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-05-15 08:50:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:50:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 08:50:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 102 ms returned sat
[2020-05-15 08:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:06] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-05-15 08:50:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2020-05-15 08:50:06] [INFO ] Computed and/alt/rep : 114/346/114 causal constraints in 19 ms.
[2020-05-15 08:50:07] [INFO ] Added : 104 causal constraints over 21 iterations in 535 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 29300 steps, including 886 resets, run finished after 130 ms. (steps per millisecond=225 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 13800 steps, including 309 resets, run finished after 54 ms. (steps per millisecond=255 ) properties seen :[0, 0] could not realise parikh vector
Support contains 15 out of 169 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 169/169 places, 120/120 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 169 transition count 116
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 166 transition count 116
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 166 transition count 116
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 165 transition count 115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 161 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 20 place count 160 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 159 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 158 transition count 108
Applied a total of 22 rules in 60 ms. Remains 158 /169 variables (removed 11) and now considering 108/120 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/169 places, 108/120 transitions.
Incomplete random walk after 1000000 steps, including 26845 resets, run finished after 3370 ms. (steps per millisecond=296 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4494 resets, run finished after 1969 ms. (steps per millisecond=507 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3595 resets, run finished after 1923 ms. (steps per millisecond=520 ) properties seen :[0, 1]
FORMULA DES-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 108 rows 158 cols
[2020-05-15 08:50:14] [INFO ] Computed 60 place invariants in 8 ms
[2020-05-15 08:50:14] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-05-15 08:50:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2020-05-15 08:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:15] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2020-05-15 08:50:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:50:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 45 ms returned sat
[2020-05-15 08:50:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2020-05-15 08:50:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:15] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-05-15 08:50:15] [INFO ] Computed and/alt/rep : 104/277/104 causal constraints in 24 ms.
[2020-05-15 08:50:16] [INFO ] Added : 103 causal constraints over 21 iterations in 654 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Incomplete Parikh walk after 35500 steps, including 1312 resets, run finished after 168 ms. (steps per millisecond=211 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 108/108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 158 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 157 transition count 107
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 157 transition count 107
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 156 transition count 106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 153 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 152 transition count 108
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 152 transition count 107
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 151 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 151 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 151 transition count 104
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 151 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 150 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 150 transition count 99
Applied a total of 26 rules in 53 ms. Remains 150 /158 variables (removed 8) and now considering 99/108 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/158 places, 99/108 transitions.
Incomplete random walk after 1000000 steps, including 34296 resets, run finished after 3513 ms. (steps per millisecond=284 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 6066 resets, run finished after 2066 ms. (steps per millisecond=484 ) properties seen :[0]
Interrupted probabilistic random walk after 9986617 steps, run timeout after 30001 ms. (steps per millisecond=332 ) properties seen :[0]
Probabilistic random walk after 9986617 steps, saw 1254143 distinct states, run finished after 30001 ms. (steps per millisecond=332 ) properties seen :[0]
// Phase 1: matrix 99 rows 150 cols
[2020-05-15 08:50:51] [INFO ] Computed 60 place invariants in 4 ms
[2020-05-15 08:50:51] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned sat
[2020-05-15 08:50:51] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2020-05-15 08:50:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:52] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2020-05-15 08:50:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:50:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 26 ms returned sat
[2020-05-15 08:50:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2020-05-15 08:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:52] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-05-15 08:50:52] [INFO ] Computed and/alt/rep : 95/304/95 causal constraints in 12 ms.
[2020-05-15 08:50:53] [INFO ] Added : 94 causal constraints over 19 iterations in 556 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 36300 steps, including 1572 resets, run finished after 136 ms. (steps per millisecond=266 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 99/99 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 99/99 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 99/99 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 150 cols
[2020-05-15 08:50:53] [INFO ] Computed 60 place invariants in 3 ms
[2020-05-15 08:50:53] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 99 rows 150 cols
[2020-05-15 08:50:53] [INFO ] Computed 60 place invariants in 6 ms
[2020-05-15 08:50:54] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2020-05-15 08:50:54] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 99 rows 150 cols
[2020-05-15 08:50:54] [INFO ] Computed 60 place invariants in 7 ms
[2020-05-15 08:50:54] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 99/99 transitions.
Incomplete random walk after 100000 steps, including 3499 resets, run finished after 365 ms. (steps per millisecond=273 ) properties seen :[0]
// Phase 1: matrix 99 rows 150 cols
[2020-05-15 08:50:54] [INFO ] Computed 60 place invariants in 3 ms
[2020-05-15 08:50:55] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-05-15 08:50:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2020-05-15 08:50:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:55] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2020-05-15 08:50:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:50:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-05-15 08:50:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2020-05-15 08:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:55] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2020-05-15 08:50:55] [INFO ] Computed and/alt/rep : 95/304/95 causal constraints in 16 ms.
[2020-05-15 08:50:56] [INFO ] Added : 94 causal constraints over 19 iterations in 570 ms. Result :sat
Applied a total of 0 rules in 12 ms. Remains 150 /150 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 150 cols
[2020-05-15 08:50:56] [INFO ] Computed 60 place invariants in 3 ms
[2020-05-15 08:50:56] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-05-15 08:50:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2020-05-15 08:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:56] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2020-05-15 08:50:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:50:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-05-15 08:50:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2020-05-15 08:50:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:50:56] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2020-05-15 08:50:56] [INFO ] Computed and/alt/rep : 95/304/95 causal constraints in 11 ms.
[2020-05-15 08:50:57] [INFO ] Added : 94 causal constraints over 19 iterations in 548 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2020-05-15 08:50:57] [INFO ] Flatten gal took : 101 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 08:50:58] [INFO ] Flatten gal took : 52 ms
[2020-05-15 08:50:58] [INFO ] Applying decomposition
[2020-05-15 08:50:58] [INFO ] Flatten gal took : 57 ms
[2020-05-15 08:50:58] [INFO ] Input system was already deterministic with 99 transitions.
[2020-05-15 08:50:58] [INFO ] Input system was already deterministic with 99 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/graph1784023103199886337.txt, -o, /tmp/graph1784023103199886337.bin, -w, /tmp/graph1784023103199886337.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 99 rows 150 cols
[2020-05-15 08:50:58] [INFO ] Computed 60 place invariants in 3 ms
inv : p75 + p77 + p80 + p81 = 1
inv : p172 + p173 + p184 + p193 - p212 + p224 + p242 - p250 = 1
inv : p172 + p190 + p193 - p221 + p224 + p248 - p250 = 1
inv : p255 + p257 = 1
inv : p192 + p193 = 1
inv : p230 + p231 + p241 + p242 + p253 + p254 = 1
inv : p258 + p260 + p261 + p264 + p267 + p271 + p272 + p277 + p278 = 1
inv : p251 + p252 - p253 - p254 = 0
inv : p122 + p123 - p124 - p125 = 0
inv : p213 + p215 = 1
inv : p230 + p231 + p237 + p238 + p253 + p254 = 1
inv : p230 + p245 + p246 + p253 + p254 = 1
inv : -5*p5 - p7 - 2*p8 - 3*p9 - 4*p10 + 5*p11 + p13 + 2*p14 + 3*p15 + 4*p16 + p67 + p77 + p81 + p155 + p165 + p258 + p260 + p271 + p272 + p277 + p278 + p281 + p282 + p284 + p285 + p288 - p292 - p297 = 1
inv : p279 + p281 + p282 + p284 + p285 + p288 = 1
inv : p187 - p193 + p215 - p224 - p244 + p250 = 0
inv : p230 + p231 + p239 + p240 + p253 + p254 = 1
inv : p88 + p90 + p92 = 1
inv : p88 + p116 + p117 + p118 + p119 + p124 + p125 = 1
inv : p210 + p212 = 1
inv : p43 + p46 = 1
inv : p185 - p193 + p212 - p224 - p242 + p250 = 0
inv : p230 + p231 + p235 + p236 + p253 + p254 = 1
inv : -10*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 + 5*p11 + p13 + 2*p14 + 3*p15 + 4*p16 + 5*p23 + p25 + 2*p26 + 3*p27 + 4*p28 + p51 + p77 + p81 + p88 - p92 + p121 - p123 + p124 + p125 - p128 - p138 - p139 - p143 + p153 + p155 + p165 - p252 + p254 + p257 + p260 + p271 + p275 + p281 + p282 + p284 + p285 + p288 - p292 - p297 = 0
inv : p201 + p203 = 1
inv : p183 - p193 + p209 - p224 - p240 + p250 = 0
inv : p172 + p173 + p188 + p193 - p218 + p224 + p246 - p250 = 1
inv : 10*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 - 10*p11 - 2*p13 - 4*p14 - 6*p15 - 8*p16 - p153 - p155 - p165 - p260 - p271 - p272 + p274 - p277 - p281 - p284 + 2*p292 + p297 + p299 = 2
inv : p172 + p173 + p186 + p193 - p215 + p224 + p244 - p250 = 1
inv : p249 + p250 + p253 + p254 = 1
inv : 5*p5 + p7 + 2*p8 + 3*p9 + 4*p10 - 5*p11 - p13 - 2*p14 - 3*p15 - 4*p16 - p153 + p162 - p193 - p224 + p250 + p253 - p257 - p260 - p271 - p275 + p292 + p297 = 3
inv : p164 + p165 = 1
inv : p219 + p221 = 1
inv : p292 + p296 + p297 = 1
inv : p36 + p42 = 1
inv : p88 + p144 + p145 + p146 = 1
inv : p172 + p173 + p178 + p193 - p203 + p224 + p236 - p250 = 1
inv : p152 + p153 = 1
inv : p88 + p95 + p97 + p103 + p105 = 1
inv : -10*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 + 10*p11 + 2*p13 + 4*p14 + 6*p15 + 8*p16 + p153 + p155 + p165 + p260 + p273 + p277 + p281 + p284 - 2*p292 - p297 - p299 = -2
inv : p88 + p128 + p138 + p139 + p140 + p141 = 1
inv : p222 + p224 = 1
inv : p292 + p298 + p299 = 1
inv : p181 - p193 + p206 - p224 - p238 + p250 = 0
inv : p207 + p209 = 1
inv : p154 + p155 = 1
inv : p179 - p193 + p203 - p224 - p236 + p250 = 0
inv : p50 + p51 + p52 = 1
inv : p216 + p218 = 1
inv : p88 + p116 + p117 + p120 + p121 + p124 + p125 = 1
inv : p230 + p231 + p243 + p244 + p253 + p254 = 1
inv : p172 + p173 + p182 + p193 - p209 + p224 + p240 - p250 = 1
inv : p172 + p173 + p180 + p193 - p206 + p224 + p238 - p250 = 1
inv : p189 - p193 + p218 - p224 - p246 + p250 = 0
inv : p275 + p276 - p277 - p278 = 0
inv : p191 - p193 + p221 - p224 - p248 + p250 = 0
inv : p204 + p206 = 1
inv : p88 + p128 + p138 + p139 + p142 + p143 = 1
inv : p247 + p248 + p253 + p254 = 1
inv : -5*p5 - p7 - 2*p8 - 3*p9 - 4*p10 + 5*p11 + p13 + 2*p14 + 3*p15 + 4*p16 + p153 + p163 + p193 + p224 - p250 - p253 + p257 + p260 + p271 + p275 - p292 - p297 = -2
inv : 5*p5 + p7 + 2*p8 + 3*p9 + 4*p10 - 5*p11 - p13 - 2*p14 - 3*p15 - 4*p16 + p74 - p77 - p81 - p155 - p165 - p258 - p260 - p271 - p272 - p277 - p278 - p281 - p282 - p284 - p285 - p288 + p292 + p297 = 0
Total of 60 invariants.
[2020-05-15 08:50:58] [INFO ] Computed 60 place invariants in 23 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1784023103199886337.bin, -l, -1, -v, -w, /tmp/graph1784023103199886337.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 08:50:58] [INFO ] Ran tautology test, simplified 0 / 1 in 331 ms.
[2020-05-15 08:50:58] [INFO ] Decomposing Gal with order
[2020-05-15 08:50:58] [INFO ] BMC solution for property DES-PT-05b-ReachabilityFireability-06(UNSAT) depth K=0 took 26 ms
[2020-05-15 08:50:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 08:50:58] [INFO ] BMC solution for property DES-PT-05b-ReachabilityFireability-06(UNSAT) depth K=1 took 8 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 99 rows 150 cols
[2020-05-15 08:50:58] [INFO ] Computed 60 place invariants in 2 ms
inv : p75 + p77 + p80 + p81 = 1
inv : p172 + p173 + p184 + p193 - p212 + p224 + p242 - p250 = 1
inv : p172 + p190 + p193 - p221 + p224 + p248 - p250 = 1
inv : p255 + p257 = 1
inv : p192 + p193 = 1
inv : p230 + p231 + p241 + p242 + p253 + p254 = 1
inv : p258 + p260 + p261 + p264 + p267 + p271 + p272 + p277 + p278 = 1
inv : p251 + p252 - p253 - p254 = 0
inv : p122 + p123 - p124 - p125 = 0
inv : p213 + p215 = 1
inv : p230 + p231 + p237 + p238 + p253 + p254 = 1
inv : p230 + p245 + p246 + p253 + p254 = 1
inv : -5*p5 - p7 - 2*p8 - 3*p9 - 4*p10 + 5*p11 + p13 + 2*p14 + 3*p15 + 4*p16 + p67 + p77 + p81 + p155 + p165 + p258 + p260 + p271 + p272 + p277 + p278 + p281 + p282 + p284 + p285 + p288 - p292 - p297 = 1
inv : p279 + p281 + p282 + p284 + p285 + p288 = 1
inv : p187 - p193 + p215 - p224 - p244 + p250 = 0
inv : p230 + p231 + p239 + p240 + p253 + p254 = 1
inv : p88 + p90 + p92 = 1
inv : p88 + p116 + p117 + p118 + p119 + p124 + p125 = 1
inv : p210 + p212 = 1
inv : p43 + p46 = 1
inv : p185 - p193 + p212 - p224 - p242 + p250 = 0
inv : p230 + p231 + p235 + p236 + p253 + p254 = 1
inv : -10*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 + 5*p11 + p13 + 2*p14 + 3*p15 + 4*p16 + 5*p23 + p25 + 2*p26 + 3*p27 + 4*p28 + p51 + p77 + p81 + p88 - p92 + p121 - p123 + p124 + p125 - p128 - p138 - p139 - p143 + p153 + p155 + p165 - p252 + p254 + p257 + p260 + p271 + p275 + p281 + p282 + p284 + p285 + p288 - p292 - p297 = 0
inv : p201 + p203 = 1
inv : p183 - p193 + p209 - p224 - p240 + p250 = 0
inv : p172 + p173 + p188 + p193 - p218 + p224 + p246 - p250 = 1
inv : 10*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 - 10*p11 - 2*p13 - 4*p14 - 6*p15 - 8*p16 - p153 - p155 - p165 - p260 - p271 - p272 + p274 - p277 - p281 - p284 + 2*p292 + p297 + p299 = 2
inv : p172 + p173 + p186 + p193 - p215 + p224 + p244 - p250 = 1
inv : p249 + p250 + p253 + p254 = 1
inv : 5*p5 + p7 + 2*p8 + 3*p9 + 4*p10 - 5*p11 - p13 - 2*p14 - 3*p15 - 4*p16 - p153 + p162 - p193 - p224 + p250 + p253 - p257 - p260 - p271 - p275 + p292 + p297 = 3
inv : p164 + p165 = 1
inv : p219 + p221 = 1
inv : p292 + p296 + p297 = 1
inv : p36 + p42 = 1
inv : p88 + p144 + p145 + p146 = 1
inv : p172 + p173 + p178 + p193 - p203 + p224 + p236 - p250 = 1
inv : p152 + p153 = 1
inv : p88 + p95 + p97 + p103 + p105 = 1
inv : -10*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 + 10*p11 + 2*p13 + 4*p14 + 6*p15 + 8*p16 + p153 + p155 + p165 + p260 + p273 + p277 + p281 + p284 - 2*p292 - p297 - p299 = -2
inv : p88 + p128 + p138 + p139 + p140 + p141 = 1
inv : p222 + p224 = 1
inv : p292 + p298 + p299 = 1
inv : p181 - p193 + p206 - p224 - p238 + p250 = 0
inv : p207 + p209 = 1
inv : p154 + p155 = 1
inv : p179 - p193 + p203 - p224 - p236 + p250 = 0
inv : p50 + p51 + p52 = 1
inv : p216 + p218 = 1
inv : p88 + p116 + p117 + p120 + p121 + p124 + p125 = 1
inv : p230 + p231 + p243 + p244 + p253 + p254 = 1
inv : p172 + p173 + p182 + p193 - p209 + p224 + p240 - p250 = 1
inv : p172 + p173 + p180 + p193 - p206 + p224 + p238 - p250 = 1
inv : p189 - p193 + p218 - p224 - p246 + p250 = 0
inv : p275 + p276 - p277 - p278 = 0
inv : p191 - p193 + p221 - p224 - p248 + p250 = 0
inv : p204 + p206 = 1
inv : p88 + p128 + p138 + p139 + p142 + p143 = 1
inv : p247 + p248 + p253 + p254 = 1
inv : -5*p5 - p7 - 2*p8 - 3*p9 - 4*p10 + 5*p11 + p13 + 2*p14 + 3*p15 + 4*p16 + p153 + p163 + p193 + p224 - p250 - p253 + p257 + p260 + p271 + p275 - p292 - p297 = -2
inv : 5*p5 + p7 + 2*p8 + 3*p9 + 4*p10 - 5*p11 - p13 - 2*p14 - 3*p15 - 4*p16 + p74 - p77 - p81 - p155 - p165 - p258 - p260 - p271 - p272 - p277 - p278 - p281 - p282 - p284 - p285 - p288 + p292 + p297 = 0
Total of 60 invariants.
[2020-05-15 08:50:58] [INFO ] Computed 60 place invariants in 6 ms
[2020-05-15 08:50:58] [INFO ] BMC solution for property DES-PT-05b-ReachabilityFireability-06(UNSAT) depth K=2 took 123 ms
[2020-05-15 08:50:58] [INFO ] Removed a total of 42 redundant transitions.
[2020-05-15 08:50:58] [INFO ] Flatten gal took : 143 ms
[2020-05-15 08:50:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 24 ms.
[2020-05-15 08:50:58] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 46 ms
[2020-05-15 08:50:58] [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 : DES-PT-05b-ReachabilityFireability-06 with value :((((((i3.u7.p117==1)&&(i4.u8.p138!=1))&&(i6.u4.p80==1))&&(i4.u8.p139==1))&&(i12.i1.u14.p173==1))&&(((i11.i1.u30.p231!=1)||(u9.p20!=1))||(u9.p144!=1)))
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 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
Reachability property DES-PT-05b-ReachabilityFireability-06 is true.
FORMULA DES-PT-05b-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.43198e+09,0.124579,6160,790,219,5245,543,352,4851,132,1144,0
Total reachable state count : 6431982264

Verifying 1 reachability properties.
Reachability property DES-PT-05b-ReachabilityFireability-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-05b-ReachabilityFireability-06,54,0.126661,6424,61,61,5245,543,396,4851,150,1144,74
[2020-05-15 08:50:58] [WARNING] Interrupting SMT solver.
[2020-05-15 08:50:58] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Error adding positive variable constraint (error "Failed to assert expression: java.io.IOException: Broken pipe (>= (select (select s 0) 50) 0)")
[2020-05-15 08:50:59] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-05b-ReachabilityFireability-06 SMT depth 3
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
Exception in thread "Thread-5" java.lang.RuntimeException: SMT assertion produced unexpected response success
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:159)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:282)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 08:50:59] [INFO ] During BMC, SMT solver timed out at depth 3
[2020-05-15 08:50:59] [INFO ] BMC solving timed out (3600000 secs) at depth 3
[2020-05-15 08:50:59] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
[2020-05-15 08:50:59] [INFO ] Built C files in 1016ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589532659375

--------------------
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="DES-PT-05b"
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 DES-PT-05b, 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 r051-ebro-158902545900239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b 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 ;