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.r180-ebro-158987900000319.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 itslola
Input is DES-PT-50b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:20 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.2K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:18 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 127K 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-50b-ReachabilityFireability-00
FORMULA_NAME DES-PT-50b-ReachabilityFireability-01
FORMULA_NAME DES-PT-50b-ReachabilityFireability-02
FORMULA_NAME DES-PT-50b-ReachabilityFireability-03
FORMULA_NAME DES-PT-50b-ReachabilityFireability-04
FORMULA_NAME DES-PT-50b-ReachabilityFireability-05
FORMULA_NAME DES-PT-50b-ReachabilityFireability-06
FORMULA_NAME DES-PT-50b-ReachabilityFireability-07
FORMULA_NAME DES-PT-50b-ReachabilityFireability-08
FORMULA_NAME DES-PT-50b-ReachabilityFireability-09
FORMULA_NAME DES-PT-50b-ReachabilityFireability-10
FORMULA_NAME DES-PT-50b-ReachabilityFireability-11
FORMULA_NAME DES-PT-50b-ReachabilityFireability-12
FORMULA_NAME DES-PT-50b-ReachabilityFireability-13
FORMULA_NAME DES-PT-50b-ReachabilityFireability-14
FORMULA_NAME DES-PT-50b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591199040453

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:44:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 15:44:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:44:03] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2020-06-03 15:44:03] [INFO ] Transformed 479 places.
[2020-06-03 15:44:03] [INFO ] Transformed 430 transitions.
[2020-06-03 15:44:03] [INFO ] Found NUPN structural information;
[2020-06-03 15:44:03] [INFO ] Parsed PT model containing 479 places and 430 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 89 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 85 resets, run finished after 131 ms. (steps per millisecond=76 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0]
FORMULA DES-PT-50b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA DES-PT-50b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA DES-PT-50b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 430 rows 479 cols
[2020-06-03 15:44:04] [INFO ] Computed 65 place invariants in 68 ms
[2020-06-03 15:44:04] [INFO ] [Real]Absence check using 40 positive place invariants in 56 ms returned unsat
[2020-06-03 15:44:04] [INFO ] [Real]Absence check using 40 positive place invariants in 56 ms returned sat
[2020-06-03 15:44:05] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 54 ms returned sat
[2020-06-03 15:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:06] [INFO ] [Real]Absence check using state equation in 1562 ms returned sat
[2020-06-03 15:44:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:44:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 186 ms returned sat
[2020-06-03 15:44:07] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 102 ms returned sat
[2020-06-03 15:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:08] [INFO ] [Nat]Absence check using state equation in 1635 ms returned sat
[2020-06-03 15:44:09] [INFO ] Deduced a trap composed of 12 places in 336 ms
[2020-06-03 15:44:09] [INFO ] Deduced a trap composed of 38 places in 183 ms
[2020-06-03 15:44:09] [INFO ] Deduced a trap composed of 15 places in 184 ms
[2020-06-03 15:44:09] [INFO ] Deduced a trap composed of 19 places in 190 ms
[2020-06-03 15:44:10] [INFO ] Deduced a trap composed of 13 places in 179 ms
[2020-06-03 15:44:10] [INFO ] Deduced a trap composed of 21 places in 162 ms
[2020-06-03 15:44:10] [INFO ] Deduced a trap composed of 18 places in 169 ms
[2020-06-03 15:44:10] [INFO ] Deduced a trap composed of 58 places in 199 ms
[2020-06-03 15:44:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2025 ms
[2020-06-03 15:44:10] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 61 ms.
[2020-06-03 15:44:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t71 0) (and (> t70 0) (< o70 o71)))") while checking expression at index 1
[2020-06-03 15:44:11] [INFO ] [Real]Absence check using 40 positive place invariants in 60 ms returned sat
[2020-06-03 15:44:11] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 15:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:13] [INFO ] [Real]Absence check using state equation in 1469 ms returned sat
[2020-06-03 15:44:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:44:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 170 ms returned sat
[2020-06-03 15:44:13] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 65 ms returned sat
[2020-06-03 15:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:15] [INFO ] [Nat]Absence check using state equation in 1379 ms returned sat
[2020-06-03 15:44:15] [INFO ] Deduced a trap composed of 14 places in 393 ms
[2020-06-03 15:44:16] [INFO ] Deduced a trap composed of 16 places in 343 ms
[2020-06-03 15:44:16] [INFO ] Deduced a trap composed of 8 places in 307 ms
[2020-06-03 15:44:16] [INFO ] Deduced a trap composed of 12 places in 277 ms
[2020-06-03 15:44:17] [INFO ] Deduced a trap composed of 10 places in 268 ms
[2020-06-03 15:44:17] [INFO ] Deduced a trap composed of 13 places in 255 ms
[2020-06-03 15:44:17] [INFO ] Deduced a trap composed of 30 places in 230 ms
[2020-06-03 15:44:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2529 ms
[2020-06-03 15:44:17] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 54 ms.
[2020-06-03 15:44:18] [INFO ] Added : 45 causal constraints over 9 iterations in 755 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 15:44:18] [INFO ] [Real]Absence check using 40 positive place invariants in 44 ms returned unsat
[2020-06-03 15:44:18] [INFO ] [Real]Absence check using 40 positive place invariants in 55 ms returned sat
[2020-06-03 15:44:18] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 67 ms returned sat
[2020-06-03 15:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:20] [INFO ] [Real]Absence check using state equation in 2092 ms returned sat
[2020-06-03 15:44:21] [INFO ] Deduced a trap composed of 12 places in 350 ms
[2020-06-03 15:44:21] [INFO ] Deduced a trap composed of 8 places in 340 ms
[2020-06-03 15:44:21] [INFO ] Deduced a trap composed of 17 places in 94 ms
[2020-06-03 15:44:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 993 ms
[2020-06-03 15:44:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:44:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 158 ms returned sat
[2020-06-03 15:44:22] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 91 ms returned sat
[2020-06-03 15:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:24] [INFO ] [Nat]Absence check using state equation in 2072 ms returned sat
[2020-06-03 15:44:24] [INFO ] Deduced a trap composed of 8 places in 363 ms
[2020-06-03 15:44:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 464 ms
[2020-06-03 15:44:24] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 48 ms.
[2020-06-03 15:44:27] [INFO ] Added : 135 causal constraints over 27 iterations in 2154 ms. Result :(error "Failed to check-sat")
[2020-06-03 15:44:27] [INFO ] [Real]Absence check using 40 positive place invariants in 54 ms returned sat
[2020-06-03 15:44:27] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 56 ms returned sat
[2020-06-03 15:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:28] [INFO ] [Real]Absence check using state equation in 1539 ms returned sat
[2020-06-03 15:44:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:44:29] [INFO ] [Nat]Absence check using 40 positive place invariants in 157 ms returned sat
[2020-06-03 15:44:29] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 105 ms returned sat
[2020-06-03 15:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:30] [INFO ] [Nat]Absence check using state equation in 1672 ms returned sat
[2020-06-03 15:44:31] [INFO ] Deduced a trap composed of 8 places in 380 ms
[2020-06-03 15:44:31] [INFO ] Deduced a trap composed of 12 places in 237 ms
[2020-06-03 15:44:31] [INFO ] Deduced a trap composed of 23 places in 172 ms
[2020-06-03 15:44:32] [INFO ] Deduced a trap composed of 19 places in 144 ms
[2020-06-03 15:44:32] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-06-03 15:44:32] [INFO ] Deduced a trap composed of 20 places in 187 ms
[2020-06-03 15:44:32] [INFO ] Deduced a trap composed of 24 places in 152 ms
[2020-06-03 15:44:32] [INFO ] Deduced a trap composed of 28 places in 68 ms
[2020-06-03 15:44:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1891 ms
[2020-06-03 15:44:32] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 166 ms.
[2020-06-03 15:44:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t77 0) (or (and (> t39 0) (< o39 o77)) (and (> t78 0) (< o78 o77))))") while checking expression at index 5
[2020-06-03 15:44:34] [INFO ] [Real]Absence check using 40 positive place invariants in 54 ms returned sat
[2020-06-03 15:44:34] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 56 ms returned sat
[2020-06-03 15:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:35] [INFO ] [Real]Absence check using state equation in 1822 ms returned sat
[2020-06-03 15:44:36] [INFO ] Deduced a trap composed of 16 places in 339 ms
[2020-06-03 15:44:36] [INFO ] Deduced a trap composed of 13 places in 311 ms
[2020-06-03 15:44:36] [INFO ] Deduced a trap composed of 18 places in 224 ms
[2020-06-03 15:44:37] [INFO ] Deduced a trap composed of 18 places in 170 ms
[2020-06-03 15:44:37] [INFO ] Deduced a trap composed of 22 places in 189 ms
[2020-06-03 15:44:37] [INFO ] Deduced a trap composed of 22 places in 164 ms
[2020-06-03 15:44:37] [INFO ] Deduced a trap composed of 32 places in 155 ms
[2020-06-03 15:44:38] [INFO ] Deduced a trap composed of 31 places in 182 ms
[2020-06-03 15:44:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2125 ms
[2020-06-03 15:44:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:44:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 152 ms returned sat
[2020-06-03 15:44:38] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 59 ms returned sat
[2020-06-03 15:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:40] [INFO ] [Nat]Absence check using state equation in 2217 ms returned sat
[2020-06-03 15:44:41] [INFO ] Deduced a trap composed of 12 places in 344 ms
[2020-06-03 15:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 721 ms
[2020-06-03 15:44:41] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 64 ms.
[2020-06-03 15:44:43] [INFO ] Added : 110 causal constraints over 22 iterations in 1751 ms. Result :unknown
[2020-06-03 15:44:43] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned unsat
FORMULA DES-PT-50b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 390700 steps, including 4084 resets, run finished after 1551 ms. (steps per millisecond=251 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 479 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 479/479 places, 430/430 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 1098 edges and 479 vertex of which 468 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.21 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 468 transition count 405
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 450 transition count 405
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 450 transition count 397
Deduced a syphon composed of 8 places in 20 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 442 transition count 397
Symmetric choice reduction at 2 with 19 rule applications. Total rules 74 place count 442 transition count 397
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 112 place count 423 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 112 place count 423 transition count 377
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 422 transition count 377
Symmetric choice reduction at 2 with 15 rule applications. Total rules 129 place count 422 transition count 377
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 159 place count 407 transition count 362
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 174 place count 407 transition count 347
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 177 place count 405 transition count 346
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 177 place count 405 transition count 343
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 183 place count 402 transition count 343
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 309 place count 339 transition count 280
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 313 place count 337 transition count 282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 314 place count 337 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 315 place count 336 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 316 place count 335 transition count 280
Applied a total of 316 rules in 441 ms. Remains 335 /479 variables (removed 144) and now considering 280/430 (removed 150) transitions.
Finished structural reductions, in 1 iterations. Remains : 335/479 places, 280/430 transitions.
Incomplete random walk after 1000000 steps, including 29095 resets, run finished after 4170 ms. (steps per millisecond=239 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5565 resets, run finished after 1870 ms. (steps per millisecond=534 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5590 resets, run finished after 1685 ms. (steps per millisecond=593 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6178 resets, run finished after 2395 ms. (steps per millisecond=417 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5628 resets, run finished after 1788 ms. (steps per millisecond=559 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5631 resets, run finished after 2149 ms. (steps per millisecond=465 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 7717067 steps, run timeout after 30001 ms. (steps per millisecond=257 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 7717067 steps, saw 975833 distinct states, run finished after 30001 ms. (steps per millisecond=257 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 280 rows 335 cols
[2020-06-03 15:45:29] [INFO ] Computed 61 place invariants in 19 ms
[2020-06-03 15:45:29] [INFO ] [Real]Absence check using 37 positive place invariants in 39 ms returned sat
[2020-06-03 15:45:29] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 29 ms returned sat
[2020-06-03 15:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:30] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2020-06-03 15:45:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:30] [INFO ] [Nat]Absence check using 37 positive place invariants in 44 ms returned sat
[2020-06-03 15:45:30] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 112 ms returned sat
[2020-06-03 15:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:31] [INFO ] [Nat]Absence check using state equation in 1020 ms returned sat
[2020-06-03 15:45:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2020-06-03 15:45:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2020-06-03 15:45:31] [INFO ] Deduced a trap composed of 7 places in 207 ms
[2020-06-03 15:45:31] [INFO ] Deduced a trap composed of 7 places in 58 ms
[2020-06-03 15:45:32] [INFO ] Deduced a trap composed of 22 places in 153 ms
[2020-06-03 15:45:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 695 ms
[2020-06-03 15:45:32] [INFO ] Computed and/alt/rep : 277/1561/277 causal constraints in 30 ms.
[2020-06-03 15:45:36] [INFO ] Added : 230 causal constraints over 46 iterations in 4788 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 52 ms.
[2020-06-03 15:45:37] [INFO ] [Real]Absence check using 37 positive place invariants in 49 ms returned sat
[2020-06-03 15:45:37] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 43 ms returned sat
[2020-06-03 15:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:38] [INFO ] [Real]Absence check using state equation in 915 ms returned sat
[2020-06-03 15:45:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:38] [INFO ] [Nat]Absence check using 37 positive place invariants in 101 ms returned sat
[2020-06-03 15:45:38] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 54 ms returned sat
[2020-06-03 15:45:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:39] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2020-06-03 15:45:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 37 ms returned sat
[2020-06-03 15:45:39] [INFO ] Deduced a trap composed of 7 places in 117 ms
[2020-06-03 15:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2020-06-03 15:45:39] [INFO ] Computed and/alt/rep : 277/1561/277 causal constraints in 33 ms.
[2020-06-03 15:45:40] [INFO ] Added : 35 causal constraints over 7 iterations in 590 ms. Result :unsat
[2020-06-03 15:45:40] [INFO ] [Real]Absence check using 37 positive place invariants in 36 ms returned sat
[2020-06-03 15:45:40] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 53 ms returned sat
[2020-06-03 15:45:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:42] [INFO ] [Real]Absence check using state equation in 1647 ms returned sat
[2020-06-03 15:45:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 50 ms returned sat
[2020-06-03 15:45:42] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 49 ms returned sat
[2020-06-03 15:45:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:43] [INFO ] [Nat]Absence check using state equation in 1368 ms returned sat
[2020-06-03 15:45:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2020-06-03 15:45:43] [INFO ] Deduced a trap composed of 9 places in 61 ms
[2020-06-03 15:45:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2020-06-03 15:45:43] [INFO ] Computed and/alt/rep : 277/1561/277 causal constraints in 32 ms.
[2020-06-03 15:45:47] [INFO ] Added : 271 causal constraints over 55 iterations in 3428 ms. Result :sat
[2020-06-03 15:45:47] [INFO ] Deduced a trap composed of 15 places in 116 ms
[2020-06-03 15:45:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
Attempting to minimize the solution found.
Minimization took 43 ms.
[2020-06-03 15:45:47] [INFO ] [Real]Absence check using 37 positive place invariants in 48 ms returned sat
[2020-06-03 15:45:47] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 15:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:48] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2020-06-03 15:45:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 46 ms returned sat
[2020-06-03 15:45:49] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 114 ms returned sat
[2020-06-03 15:45:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:49] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2020-06-03 15:45:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2020-06-03 15:45:49] [INFO ] Computed and/alt/rep : 277/1561/277 causal constraints in 40 ms.
[2020-06-03 15:45:54] [INFO ] Added : 252 causal constraints over 51 iterations in 4509 ms. Result :sat
[2020-06-03 15:45:54] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-06-03 15:45:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-06-03 15:45:54] [INFO ] [Real]Absence check using 37 positive place invariants in 35 ms returned sat
[2020-06-03 15:45:54] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 36 ms returned sat
[2020-06-03 15:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:55] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2020-06-03 15:45:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:56] [INFO ] [Nat]Absence check using 37 positive place invariants in 51 ms returned sat
[2020-06-03 15:45:56] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 83 ms returned sat
[2020-06-03 15:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:57] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2020-06-03 15:45:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2020-06-03 15:45:57] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2020-06-03 15:45:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2020-06-03 15:45:57] [INFO ] Computed and/alt/rep : 277/1561/277 causal constraints in 30 ms.
[2020-06-03 15:46:02] [INFO ] Added : 145 causal constraints over 29 iterations in 4737 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
FORMULA DES-PT-50b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 35200 steps, including 1206 resets, run finished after 164 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 280400 steps, including 9791 resets, run finished after 1345 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 276000 steps, including 9555 resets, run finished after 1283 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 256900 steps, including 8865 resets, run finished after 1220 ms. (steps per millisecond=210 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 22 out of 335 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 335/335 places, 280/280 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 334 transition count 279
Applied a total of 2 rules in 65 ms. Remains 334 /335 variables (removed 1) and now considering 279/280 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 334/335 places, 279/280 transitions.
Incomplete random walk after 1000000 steps, including 29945 resets, run finished after 4497 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5900 resets, run finished after 1904 ms. (steps per millisecond=525 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6440 resets, run finished after 2582 ms. (steps per millisecond=387 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5728 resets, run finished after 1832 ms. (steps per millisecond=545 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5768 resets, run finished after 2248 ms. (steps per millisecond=444 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 8039322 steps, run timeout after 30001 ms. (steps per millisecond=267 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 8039322 steps, saw 1012457 distinct states, run finished after 30001 ms. (steps per millisecond=267 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 279 rows 334 cols
[2020-06-03 15:46:49] [INFO ] Computed 61 place invariants in 12 ms
[2020-06-03 15:46:49] [INFO ] [Real]Absence check using 37 positive place invariants in 42 ms returned sat
[2020-06-03 15:46:49] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 37 ms returned sat
[2020-06-03 15:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:50] [INFO ] [Real]Absence check using state equation in 874 ms returned sat
[2020-06-03 15:46:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:46:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 38 ms returned sat
[2020-06-03 15:46:50] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 77 ms returned sat
[2020-06-03 15:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:51] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2020-06-03 15:46:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2020-06-03 15:46:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2020-06-03 15:46:51] [INFO ] Computed and/alt/rep : 276/1560/276 causal constraints in 44 ms.
[2020-06-03 15:46:56] [INFO ] Added : 224 causal constraints over 45 iterations in 4257 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 15:46:56] [INFO ] [Real]Absence check using 37 positive place invariants in 34 ms returned sat
[2020-06-03 15:46:56] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 53 ms returned sat
[2020-06-03 15:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:57] [INFO ] [Real]Absence check using state equation in 1229 ms returned sat
[2020-06-03 15:46:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:46:57] [INFO ] [Nat]Absence check using 37 positive place invariants in 48 ms returned sat
[2020-06-03 15:46:57] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 49 ms returned sat
[2020-06-03 15:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:58] [INFO ] [Nat]Absence check using state equation in 1081 ms returned sat
[2020-06-03 15:46:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2020-06-03 15:46:59] [INFO ] Computed and/alt/rep : 276/1560/276 causal constraints in 35 ms.
[2020-06-03 15:47:02] [INFO ] Added : 273 causal constraints over 55 iterations in 3356 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-06-03 15:47:02] [INFO ] [Real]Absence check using 37 positive place invariants in 35 ms returned sat
[2020-06-03 15:47:02] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 35 ms returned sat
[2020-06-03 15:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:03] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2020-06-03 15:47:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:03] [INFO ] [Nat]Absence check using 37 positive place invariants in 58 ms returned sat
[2020-06-03 15:47:03] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 105 ms returned sat
[2020-06-03 15:47:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:04] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2020-06-03 15:47:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2020-06-03 15:47:04] [INFO ] Computed and/alt/rep : 276/1560/276 causal constraints in 43 ms.
[2020-06-03 15:47:08] [INFO ] Added : 274 causal constraints over 55 iterations in 4028 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
[2020-06-03 15:47:09] [INFO ] [Real]Absence check using 37 positive place invariants in 36 ms returned sat
[2020-06-03 15:47:09] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 43 ms returned sat
[2020-06-03 15:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:10] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2020-06-03 15:47:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:10] [INFO ] [Nat]Absence check using 37 positive place invariants in 42 ms returned sat
[2020-06-03 15:47:10] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 76 ms returned sat
[2020-06-03 15:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:11] [INFO ] [Nat]Absence check using state equation in 961 ms returned sat
[2020-06-03 15:47:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2020-06-03 15:47:11] [INFO ] Deduced a trap composed of 7 places in 87 ms
[2020-06-03 15:47:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2020-06-03 15:47:11] [INFO ] Computed and/alt/rep : 276/1560/276 causal constraints in 35 ms.
[2020-06-03 15:47:14] [INFO ] Added : 138 causal constraints over 28 iterations in 2902 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
Incomplete Parikh walk after 28000 steps, including 841 resets, run finished after 161 ms. (steps per millisecond=173 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 281200 steps, including 10103 resets, run finished after 1258 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 288800 steps, including 10472 resets, run finished after 1287 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 198800 steps, including 7056 resets, run finished after 891 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 22 out of 334 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 334/334 places, 279/279 transitions.
Applied a total of 0 rules in 24 ms. Remains 334 /334 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 334/334 places, 279/279 transitions.
Starting structural reductions, iteration 0 : 334/334 places, 279/279 transitions.
Applied a total of 0 rules in 21 ms. Remains 334 /334 variables (removed 0) and now considering 279/279 (removed 0) transitions.
// Phase 1: matrix 279 rows 334 cols
[2020-06-03 15:47:18] [INFO ] Computed 61 place invariants in 8 ms
[2020-06-03 15:47:19] [INFO ] Implicit Places using invariants in 1486 ms returned [214]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1495 ms to find 1 implicit places.
[2020-06-03 15:47:19] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 279 rows 333 cols
[2020-06-03 15:47:19] [INFO ] Computed 60 place invariants in 21 ms
[2020-06-03 15:47:21] [INFO ] Dead Transitions using invariants and state equation in 1315 ms returned []
Starting structural reductions, iteration 1 : 333/334 places, 279/279 transitions.
Applied a total of 0 rules in 24 ms. Remains 333 /333 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2020-06-03 15:47:21] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 279 rows 333 cols
[2020-06-03 15:47:21] [INFO ] Computed 60 place invariants in 11 ms
[2020-06-03 15:47:22] [INFO ] Dead Transitions using invariants and state equation in 1143 ms returned []
Finished structural reductions, in 2 iterations. Remains : 333/334 places, 279/279 transitions.
Incomplete random walk after 1000000 steps, including 30050 resets, run finished after 4176 ms. (steps per millisecond=239 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5899 resets, run finished after 1798 ms. (steps per millisecond=556 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6354 resets, run finished after 2403 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5915 resets, run finished after 1847 ms. (steps per millisecond=541 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5642 resets, run finished after 2118 ms. (steps per millisecond=472 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 7962017 steps, run timeout after 30001 ms. (steps per millisecond=265 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 7962017 steps, saw 1004017 distinct states, run finished after 30001 ms. (steps per millisecond=265 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 279 rows 333 cols
[2020-06-03 15:48:04] [INFO ] Computed 60 place invariants in 11 ms
[2020-06-03 15:48:04] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 15:48:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 15:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:05] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2020-06-03 15:48:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:48:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-06-03 15:48:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 120 ms returned sat
[2020-06-03 15:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:07] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2020-06-03 15:48:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 15:48:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 15 ms returned sat
[2020-06-03 15:48:07] [INFO ] Deduced a trap composed of 13 places in 148 ms
[2020-06-03 15:48:07] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-06-03 15:48:07] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-06-03 15:48:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 522 ms
[2020-06-03 15:48:07] [INFO ] Computed and/alt/rep : 276/1552/276 causal constraints in 35 ms.
[2020-06-03 15:48:10] [INFO ] Added : 209 causal constraints over 42 iterations in 3178 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-06-03 15:48:11] [INFO ] [Real]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 15:48:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 42 ms returned sat
[2020-06-03 15:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:12] [INFO ] [Real]Absence check using state equation in 1525 ms returned sat
[2020-06-03 15:48:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:48:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 51 ms returned sat
[2020-06-03 15:48:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2020-06-03 15:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:14] [INFO ] [Nat]Absence check using state equation in 1159 ms returned sat
[2020-06-03 15:48:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2020-06-03 15:48:14] [INFO ] Computed and/alt/rep : 276/1552/276 causal constraints in 37 ms.
[2020-06-03 15:48:18] [INFO ] Added : 261 causal constraints over 53 iterations in 3891 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 15:48:18] [INFO ] [Real]Absence check using 36 positive place invariants in 39 ms returned sat
[2020-06-03 15:48:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2020-06-03 15:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:19] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2020-06-03 15:48:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:48:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 46 ms returned sat
[2020-06-03 15:48:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 126 ms returned sat
[2020-06-03 15:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:20] [INFO ] [Nat]Absence check using state equation in 1060 ms returned sat
[2020-06-03 15:48:20] [INFO ] [Nat]Added 6 Read/Feed constraints in 12 ms returned sat
[2020-06-03 15:48:20] [INFO ] Deduced a trap composed of 7 places in 81 ms
[2020-06-03 15:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2020-06-03 15:48:20] [INFO ] Computed and/alt/rep : 276/1552/276 causal constraints in 32 ms.
[2020-06-03 15:48:25] [INFO ] Added : 275 causal constraints over 55 iterations in 5023 ms. Result :sat
[2020-06-03 15:48:25] [INFO ] Deduced a trap composed of 15 places in 79 ms
[2020-06-03 15:48:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-06-03 15:48:25] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 15:48:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 15:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:27] [INFO ] [Real]Absence check using state equation in 1199 ms returned sat
[2020-06-03 15:48:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:48:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 49 ms returned sat
[2020-06-03 15:48:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 237 ms returned sat
[2020-06-03 15:48:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:29] [INFO ] [Nat]Absence check using state equation in 1593 ms returned sat
[2020-06-03 15:48:29] [INFO ] [Nat]Added 6 Read/Feed constraints in 24 ms returned sat
[2020-06-03 15:48:29] [INFO ] Deduced a trap composed of 9 places in 191 ms
[2020-06-03 15:48:29] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-06-03 15:48:29] [INFO ] Deduced a trap composed of 5 places in 153 ms
[2020-06-03 15:48:30] [INFO ] Deduced a trap composed of 6 places in 147 ms
[2020-06-03 15:48:30] [INFO ] Deduced a trap composed of 5 places in 98 ms
[2020-06-03 15:48:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1469 ms
[2020-06-03 15:48:30] [INFO ] Computed and/alt/rep : 276/1552/276 causal constraints in 32 ms.
[2020-06-03 15:48:33] [INFO ] Added : 146 causal constraints over 30 iterations in 3054 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
Incomplete Parikh walk after 41600 steps, including 1538 resets, run finished after 212 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 281600 steps, including 10171 resets, run finished after 1441 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 293500 steps, including 10505 resets, run finished after 1303 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 189900 steps, including 6830 resets, run finished after 841 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 22 out of 333 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 333/333 places, 279/279 transitions.
Applied a total of 0 rules in 23 ms. Remains 333 /333 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 333/333 places, 279/279 transitions.
Starting structural reductions, iteration 0 : 333/333 places, 279/279 transitions.
Applied a total of 0 rules in 22 ms. Remains 333 /333 variables (removed 0) and now considering 279/279 (removed 0) transitions.
// Phase 1: matrix 279 rows 333 cols
[2020-06-03 15:48:37] [INFO ] Computed 60 place invariants in 7 ms
[2020-06-03 15:48:38] [INFO ] Implicit Places using invariants in 1269 ms returned []
// Phase 1: matrix 279 rows 333 cols
[2020-06-03 15:48:38] [INFO ] Computed 60 place invariants in 8 ms
[2020-06-03 15:48:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 15:48:43] [INFO ] Implicit Places using invariants and state equation in 4485 ms returned []
Implicit Place search using SMT with State Equation took 5758 ms to find 0 implicit places.
[2020-06-03 15:48:43] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 279 rows 333 cols
[2020-06-03 15:48:43] [INFO ] Computed 60 place invariants in 12 ms
[2020-06-03 15:48:44] [INFO ] Dead Transitions using invariants and state equation in 1104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 333/333 places, 279/279 transitions.
Incomplete random walk after 100000 steps, including 3041 resets, run finished after 462 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 279 rows 333 cols
[2020-06-03 15:48:45] [INFO ] Computed 60 place invariants in 7 ms
[2020-06-03 15:48:45] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 15:48:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 30 ms returned sat
[2020-06-03 15:48:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:45] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-06-03 15:48:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:48:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 48 ms returned sat
[2020-06-03 15:48:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 125 ms returned sat
[2020-06-03 15:48:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:47] [INFO ] [Nat]Absence check using state equation in 1223 ms returned sat
[2020-06-03 15:48:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 15:48:47] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2020-06-03 15:48:47] [INFO ] Deduced a trap composed of 13 places in 161 ms
[2020-06-03 15:48:47] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-06-03 15:48:47] [INFO ] Deduced a trap composed of 9 places in 71 ms
[2020-06-03 15:48:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 500 ms
[2020-06-03 15:48:47] [INFO ] Computed and/alt/rep : 276/1552/276 causal constraints in 31 ms.
[2020-06-03 15:48:51] [INFO ] Added : 209 causal constraints over 42 iterations in 3112 ms. Result :sat
[2020-06-03 15:48:51] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 15:48:51] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2020-06-03 15:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:52] [INFO ] [Real]Absence check using state equation in 1096 ms returned sat
[2020-06-03 15:48:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:48:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 49 ms returned sat
[2020-06-03 15:48:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2020-06-03 15:48:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:53] [INFO ] [Nat]Absence check using state equation in 1260 ms returned sat
[2020-06-03 15:48:53] [INFO ] [Nat]Added 6 Read/Feed constraints in 9 ms returned sat
[2020-06-03 15:48:53] [INFO ] Computed and/alt/rep : 276/1552/276 causal constraints in 38 ms.
[2020-06-03 15:48:57] [INFO ] Added : 261 causal constraints over 53 iterations in 3950 ms. Result :sat
[2020-06-03 15:48:57] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 15:48:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2020-06-03 15:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:58] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2020-06-03 15:48:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:48:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 15:48:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 122 ms returned sat
[2020-06-03 15:48:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:00] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2020-06-03 15:49:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 11 ms returned sat
[2020-06-03 15:49:00] [INFO ] Deduced a trap composed of 7 places in 82 ms
[2020-06-03 15:49:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2020-06-03 15:49:00] [INFO ] Computed and/alt/rep : 276/1552/276 causal constraints in 30 ms.
[2020-06-03 15:49:04] [INFO ] Added : 275 causal constraints over 55 iterations in 4736 ms. Result :sat
[2020-06-03 15:49:05] [INFO ] Deduced a trap composed of 15 places in 122 ms
[2020-06-03 15:49:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2020-06-03 15:49:05] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 15:49:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2020-06-03 15:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:06] [INFO ] [Real]Absence check using state equation in 1253 ms returned sat
[2020-06-03 15:49:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 15:49:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 206 ms returned sat
[2020-06-03 15:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:08] [INFO ] [Nat]Absence check using state equation in 1521 ms returned sat
[2020-06-03 15:49:08] [INFO ] [Nat]Added 6 Read/Feed constraints in 24 ms returned sat
[2020-06-03 15:49:08] [INFO ] Deduced a trap composed of 9 places in 157 ms
[2020-06-03 15:49:08] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 15:49:09] [INFO ] Deduced a trap composed of 5 places in 119 ms
[2020-06-03 15:49:09] [INFO ] Deduced a trap composed of 6 places in 168 ms
[2020-06-03 15:49:09] [INFO ] Deduced a trap composed of 5 places in 99 ms
[2020-06-03 15:49:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1462 ms
[2020-06-03 15:49:10] [INFO ] Computed and/alt/rep : 276/1552/276 causal constraints in 29 ms.
[2020-06-03 15:49:12] [INFO ] Added : 146 causal constraints over 30 iterations in 2942 ms. Result :sat
Applied a total of 0 rules in 49 ms. Remains 333 /333 variables (removed 0) and now considering 279/279 (removed 0) transitions.
// Phase 1: matrix 279 rows 333 cols
[2020-06-03 15:49:13] [INFO ] Computed 60 place invariants in 8 ms
[2020-06-03 15:49:13] [INFO ] [Real]Absence check using 36 positive place invariants in 46 ms returned sat
[2020-06-03 15:49:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 15:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:13] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2020-06-03 15:49:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 44 ms returned sat
[2020-06-03 15:49:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 122 ms returned sat
[2020-06-03 15:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:15] [INFO ] [Nat]Absence check using state equation in 1166 ms returned sat
[2020-06-03 15:49:15] [INFO ] Deduced a trap composed of 5 places in 229 ms
[2020-06-03 15:49:15] [INFO ] Deduced a trap composed of 8 places in 141 ms
[2020-06-03 15:49:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2020-06-03 15:49:15] [INFO ] Computed and/alt/rep : 276/1532/276 causal constraints in 35 ms.
[2020-06-03 15:49:18] [INFO ] Added : 229 causal constraints over 46 iterations in 3103 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 15:49:19] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 15:49:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 41 ms returned sat
[2020-06-03 15:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:20] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2020-06-03 15:49:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 47 ms returned sat
[2020-06-03 15:49:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2020-06-03 15:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:21] [INFO ] [Nat]Absence check using state equation in 1188 ms returned sat
[2020-06-03 15:49:21] [INFO ] Computed and/alt/rep : 276/1532/276 causal constraints in 39 ms.
[2020-06-03 15:49:26] [INFO ] Added : 261 causal constraints over 53 iterations in 4364 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
[2020-06-03 15:49:26] [INFO ] [Real]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-06-03 15:49:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 30 ms returned sat
[2020-06-03 15:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:27] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2020-06-03 15:49:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 50 ms returned sat
[2020-06-03 15:49:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 118 ms returned sat
[2020-06-03 15:49:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:28] [INFO ] [Nat]Absence check using state equation in 1172 ms returned sat
[2020-06-03 15:49:28] [INFO ] Deduced a trap composed of 6 places in 216 ms
[2020-06-03 15:49:29] [INFO ] Deduced a trap composed of 5 places in 172 ms
[2020-06-03 15:49:29] [INFO ] Deduced a trap composed of 5 places in 107 ms
[2020-06-03 15:49:29] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2020-06-03 15:49:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 743 ms
[2020-06-03 15:49:29] [INFO ] Computed and/alt/rep : 276/1532/276 causal constraints in 30 ms.
[2020-06-03 15:49:35] [INFO ] Added : 273 causal constraints over 55 iterations in 5638 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
[2020-06-03 15:49:35] [INFO ] [Real]Absence check using 36 positive place invariants in 39 ms returned sat
[2020-06-03 15:49:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 41 ms returned sat
[2020-06-03 15:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:36] [INFO ] [Real]Absence check using state equation in 1258 ms returned sat
[2020-06-03 15:49:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 15:49:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 210 ms returned sat
[2020-06-03 15:49:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:38] [INFO ] [Nat]Absence check using state equation in 1473 ms returned sat
[2020-06-03 15:49:38] [INFO ] Deduced a trap composed of 4 places in 185 ms
[2020-06-03 15:49:38] [INFO ] Deduced a trap composed of 7 places in 140 ms
[2020-06-03 15:49:38] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-06-03 15:49:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 524 ms
[2020-06-03 15:49:38] [INFO ] Computed and/alt/rep : 276/1532/276 causal constraints in 31 ms.
[2020-06-03 15:49:42] [INFO ] Added : 148 causal constraints over 30 iterations in 3311 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-06-03 15:49:42] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2020-06-03 15:49:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
[2020-06-03 15:49:42] [INFO ] Flatten gal took : 138 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-50b @ 3570 seconds

FORMULA DES-PT-50b-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3301
rslt: Output for ReachabilityFireability @ DES-PT-50b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 15:49:43 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p66) AND (1 <= p328))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 17435036,
"markings": 15322599,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1155
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p50) AND (1 <= p328))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 29034380,
"markings": 25460071,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1653
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G (((p142 <= 0) OR ((1 <= p249)) OR (p235 <= 0) OR (p312 <= 0) OR (((p280 <= 0)) AND ((p259 <= 0) OR (p276 <= 0)) AND ((p200 <= 0) OR (p26 <= 0) OR (p239 <= 0))))))",
"processed_size": 174,
"rewrites": 2
},
"result":
{
"edges": 20436,
"markings": 18316,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 18,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3306
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p152) AND (1 <= p206) AND ((p304 <= 0) OR (p314 <= 0) OR (p16 <= 0) OR (p239 <= 0)) AND (((1 <= p220) AND (1 <= p231)) OR ((1 <= p141) AND (1 <= p235)) OR ((1 <= p28) AND (1 <= p239))))))",
"processed_size": 205,
"rewrites": 1
},
"result":
{
"edges": 976400,
"markings": 659390,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 55,
"problems": 11
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 27312,
"runtime": 269.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 1289,
"conflict_clusters": 65,
"places": 333,
"places_significant": 273,
"singleton_clusters": 0,
"transitions": 279
},
"result":
{
"preliminary_value": "yes yes yes no ",
"value": "yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 612/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 333
lola: finding significant places
lola: 333 places, 279 transitions, 273 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p328 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p304 <= 1)
lola: LP says that atomic proposition is always true: (p314 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p328 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p312 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p276 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: E (F (((1 <= p66) AND (1 <= p328)))) : E (F (((1 <= p152) AND (1 <= p206) AND ((p304 <= 0) OR (p314 <= 0) OR (p16 <= 0) OR (p239 <= 0)) AND (((1 <= p220) AND (1 <= p231)) OR ((1 <= p141) AND (1 <= p235)) OR ((1 <= p28) AND (1 <= p239)))))) : E (F (((1 <= p50) AND (1 <= p328)))) : A (G (((p142 <= 0) OR ((1 <= p249)) OR (p235 <= 0) OR (p312 <= 0) OR (((p280 <= 0)) AND ((p259 <= 0) OR (p276 <= 0)) AND ((p200 <= 0) OR (p26 <= 0) OR (p239 <= 0))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p66) AND (1 <= p328))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p66) AND (1 <= p328))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p66) AND (1 <= p328))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 873380 markings, 938789 edges, 174676 markings/sec, 0 secs
lola: sara is running 5 secs || 1685638 markings, 1849922 edges, 162452 markings/sec, 5 secs
lola: sara is running 10 secs || 2500519 markings, 2763161 edges, 162976 markings/sec, 10 secs
lola: sara is running 15 secs || 3293818 markings, 3670952 edges, 158660 markings/sec, 15 secs
lola: sara is running 20 secs || 4081346 markings, 4568660 edges, 157506 markings/sec, 20 secs
lola: sara is running 25 secs || 4865409 markings, 5472090 edges, 156813 markings/sec, 25 secs
lola: sara is running 30 secs || 5641907 markings, 6358628 edges, 155300 markings/sec, 30 secs
lola: sara is running 35 secs || 6436063 markings, 7267626 edges, 158831 markings/sec, 35 secs
lola: sara is running 40 secs || 7246178 markings, 8189728 edges, 162023 markings/sec, 40 secs
lola: sara is running 45 secs || 8049406 markings, 9114908 edges, 160646 markings/sec, 45 secs
lola: sara is running 50 secs || 8766244 markings, 9935971 edges, 143368 markings/sec, 50 secs
lola: sara is running 55 secs || 9572065 markings, 10851353 edges, 161164 markings/sec, 55 secs
lola: sara is running 60 secs || 10380732 markings, 11776447 edges, 161733 markings/sec, 60 secs
lola: sara is running 65 secs || 11164350 markings, 12680666 edges, 156724 markings/sec, 65 secs
lola: sara is running 70 secs || 11972759 markings, 13602413 edges, 161682 markings/sec, 70 secs
lola: sara is running 75 secs || 12777975 markings, 14523807 edges, 161043 markings/sec, 75 secs
lola: sara is running 80 secs || 13571620 markings, 15427365 edges, 158729 markings/sec, 80 secs
lola: sara is running 85 secs || 14365593 markings, 16342074 edges, 158795 markings/sec, 85 secs
lola: sara is running 90 secs || 15147800 markings, 17235253 edges, 156441 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15322599 markings, 17435036 edges
lola: ========================================
lola: subprocess 1 will run for 1155 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p50) AND (1 <= p328))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p50) AND (1 <= p328))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p50) AND (1 <= p328))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 875839 markings, 941431 edges, 175168 markings/sec, 0 secs
lola: sara is running 5 secs || 1701302 markings, 1866997 edges, 165093 markings/sec, 5 secs
lola: sara is running 10 secs || 2519464 markings, 2785957 edges, 163632 markings/sec, 10 secs
lola: sara is running 15 secs || 3306891 markings, 3684935 edges, 157485 markings/sec, 15 secs
lola: sara is running 20 secs || 4099538 markings, 4592014 edges, 158529 markings/sec, 20 secs
lola: sara is running 25 secs || 4893694 markings, 5505114 edges, 158831 markings/sec, 25 secs
lola: sara is running 30 secs || 5691975 markings, 6415815 edges, 159656 markings/sec, 30 secs
lola: sara is running 35 secs || 6483248 markings, 7318899 edges, 158255 markings/sec, 35 secs
lola: sara is running 40 secs || 7281253 markings, 8233469 edges, 159601 markings/sec, 40 secs
lola: sara is running 45 secs || 8077212 markings, 9150352 edges, 159192 markings/sec, 45 secs
lola: sara is running 50 secs || 8878498 markings, 10061777 edges, 160257 markings/sec, 50 secs
lola: sara is running 55 secs || 9682233 markings, 10977350 edges, 160747 markings/sec, 55 secs
lola: sara is running 60 secs || 10478773 markings, 11896275 edges, 159308 markings/sec, 60 secs
lola: sara is running 65 secs || 11280021 markings, 12814114 edges, 160250 markings/sec, 65 secs
lola: sara is running 70 secs || 12077900 markings, 13720485 edges, 159576 markings/sec, 70 secs
lola: sara is running 75 secs || 12881245 markings, 14636936 edges, 160669 markings/sec, 75 secs
lola: sara is running 80 secs || 13668488 markings, 15547634 edges, 157449 markings/sec, 80 secs
lola: sara is running 85 secs || 14453967 markings, 16445218 edges, 157096 markings/sec, 85 secs
lola: sara is running 90 secs || 15251556 markings, 17351255 edges, 159518 markings/sec, 90 secs
lola: sara is running 95 secs || 16054612 markings, 18267506 edges, 160611 markings/sec, 95 secs
lola: sara is running 100 secs || 16824156 markings, 19156338 edges, 153909 markings/sec, 100 secs
lola: sara is running 105 secs || 17618904 markings, 20066860 edges, 158950 markings/sec, 105 secs
lola: sara is running 110 secs || 18417029 markings, 20973391 edges, 159625 markings/sec, 110 secs
lola: sara is running 115 secs || 19209833 markings, 21878128 edges, 158561 markings/sec, 115 secs
lola: sara is running 120 secs || 19991088 markings, 22779970 edges, 156251 markings/sec, 120 secs
lola: sara is running 125 secs || 20767142 markings, 23670644 edges, 155211 markings/sec, 125 secs
lola: sara is running 130 secs || 21555500 markings, 24566519 edges, 157672 markings/sec, 130 secs
lola: sara is running 135 secs || 22354148 markings, 25476607 edges, 159730 markings/sec, 135 secs
lola: sara is running 140 secs || 23133851 markings, 26374398 edges, 155941 markings/sec, 140 secs
lola: sara is running 145 secs || 23933962 markings, 27294180 edges, 160022 markings/sec, 145 secs
lola: sara is running 150 secs || 24739109 markings, 28208093 edges, 161029 markings/sec, 150 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25460071 markings, 29034380 edges
lola: ========================================
lola: subprocess 2 will run for 1653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p142 <= 0) OR ((1 <= p249)) OR (p235 <= 0) OR (p312 <= 0) OR (((p280 <= 0)) AND ((p259 <= 0) OR (p276 <= 0)) AND ((p200 <= 0) OR (p26 <= 0) OR (p239 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p142 <= 0) OR ((1 <= p249)) OR (p235 <= 0) OR (p312 <= 0) OR (((p280 <= 0)) AND ((p259 <= 0) OR (p276 <= 0)) AND ((p200 <= 0) OR (p26 <= 0) OR (p239 <= 0))))))
lola: processed formula length: 174
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p142) AND ((p249 <= 0)) AND (1 <= p235) AND (1 <= p312) AND (((1 <= p280)) OR ((1 <= p259) AND (1 <= p276)) OR ((1 <= p200) AND (1 <= p26) AND (1 <= p239))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18316 markings, 20436 edges
lola: ========================================
lola: subprocess 3 will run for 3306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p152) AND (1 <= p206) AND ((p304 <= 0) OR (p314 <= 0) OR (p16 <= 0) OR (p239 <= 0)) AND (((1 <= p220) AND (1 <= p231)) OR ((1 <= p141) AND (1 <= p235)) OR ((1 <= p28) AND (1 <= p239))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p152) AND (1 <= p206) AND ((p304 <= 0) OR (p314 <= 0) OR (p16 <= 0) OR (p239 <= 0)) AND (((1 <= p220) AND (1 <= p231)) OR ((1 <= p141) AND (1 <= p235)) OR ((1 <= p28) AND (1 <= p239))))))
lola: processed formula length: 205
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p152) AND (1 <= p206) AND ((p304 <= 0) OR (p314 <= 0) OR (p16 <= 0) OR (p239 <= 0)) AND (((1 <= p220) AND (1 <= p231)) OR ((1 <= p141) AND (1 <= p235)) OR ((1 <= p28) AND (1 <= p239))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 55 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 651068 markings, 965280 edges, 130214 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 659390 markings, 976400 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no
lola:
preliminary result: yes yes yes no
lola: memory consumption: 27312 KB
lola: time consumption: 269 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is DES-PT-50b, 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 r180-ebro-158987900000319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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