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.r211-tajo-159033477400375.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 ShieldIIPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477400375
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 4.1K May 14 01:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 01:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 18:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 860K May 12 20:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591302610172

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:30:11] [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-04 20:30:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:30:12] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2020-06-04 20:30:12] [INFO ] Transformed 3503 places.
[2020-06-04 20:30:12] [INFO ] Transformed 3253 transitions.
[2020-06-04 20:30:12] [INFO ] Found NUPN structural information;
[2020-06-04 20:30:12] [INFO ] Parsed PT model containing 3503 places and 3253 transitions in 528 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 168 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 104 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1]
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 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 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 3253 rows 3503 cols
[2020-06-04 20:30:13] [INFO ] Computed 451 place invariants in 115 ms
[2020-06-04 20:30:14] [INFO ] [Real]Absence check using 451 positive place invariants in 731 ms returned sat
[2020-06-04 20:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:30:18] [INFO ] [Real]Absence check using state equation in 3485 ms returned (error "Failed to check-sat")
[2020-06-04 20:30:19] [INFO ] [Real]Absence check using 451 positive place invariants in 757 ms returned sat
[2020-06-04 20:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:30:23] [INFO ] [Real]Absence check using state equation in 3798 ms returned (error "Failed to check-sat")
[2020-06-04 20:30:24] [INFO ] [Real]Absence check using 451 positive place invariants in 720 ms returned sat
[2020-06-04 20:30:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:30:28] [INFO ] [Real]Absence check using state equation in 3897 ms returned (error "Failed to check-sat")
[2020-06-04 20:30:29] [INFO ] [Real]Absence check using 451 positive place invariants in 696 ms returned sat
[2020-06-04 20:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:30:33] [INFO ] [Real]Absence check using state equation in 3932 ms returned (error "Failed to check-sat")
[2020-06-04 20:30:34] [INFO ] [Real]Absence check using 451 positive place invariants in 762 ms returned sat
[2020-06-04 20:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:30:38] [INFO ] [Real]Absence check using state equation in 3800 ms returned (error "Failed to check-sat")
[2020-06-04 20:30:39] [INFO ] [Real]Absence check using 451 positive place invariants in 859 ms returned sat
[2020-06-04 20:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= s872 (- t2150 t2151))") while checking expression at index 5
[2020-06-04 20:30:44] [INFO ] [Real]Absence check using 451 positive place invariants in 647 ms returned sat
[2020-06-04 20:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:30:48] [INFO ] [Real]Absence check using state equation in 3974 ms returned (error "Failed to check-sat")
[2020-06-04 20:30:49] [INFO ] [Real]Absence check using 451 positive place invariants in 985 ms returned sat
[2020-06-04 20:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:30:53] [INFO ] [Real]Absence check using state equation in 3586 ms returned (error "Failed to check-sat")
[2020-06-04 20:30:54] [INFO ] [Real]Absence check using 451 positive place invariants in 780 ms returned sat
[2020-06-04 20:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:30:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:30:58] [INFO ] [Real]Absence check using state equation in 3725 ms returned (error "Failed to check-sat")
[2020-06-04 20:30:59] [INFO ] [Real]Absence check using 451 positive place invariants in 676 ms returned sat
[2020-06-04 20:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:31:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:31:03] [INFO ] [Real]Absence check using state equation in 3904 ms returned unknown
Support contains 53 out of 3503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Performed 828 Post agglomeration using F-continuation condition.Transition count delta: 828
Iterating post reduction 0 with 828 rules applied. Total rules applied 828 place count 3503 transition count 2425
Reduce places removed 828 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 830 rules applied. Total rules applied 1658 place count 2675 transition count 2423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1659 place count 2674 transition count 2423
Performed 208 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 208 Pre rules applied. Total rules applied 1659 place count 2674 transition count 2215
Deduced a syphon composed of 208 places in 23 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 3 with 416 rules applied. Total rules applied 2075 place count 2466 transition count 2215
Symmetric choice reduction at 3 with 339 rule applications. Total rules 2414 place count 2466 transition count 2215
Deduced a syphon composed of 339 places in 44 ms
Reduce places removed 339 places and 339 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 3092 place count 2127 transition count 1876
Performed 137 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 137 Pre rules applied. Total rules applied 3092 place count 2127 transition count 1739
Deduced a syphon composed of 137 places in 8 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 3366 place count 1990 transition count 1739
Performed 825 Post agglomeration using F-continuation condition.Transition count delta: 825
Deduced a syphon composed of 825 places in 4 ms
Reduce places removed 825 places and 0 transitions.
Iterating global reduction 3 with 1650 rules applied. Total rules applied 5016 place count 1165 transition count 914
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5218 place count 1064 transition count 972
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 5302 place count 1022 transition count 998
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5303 place count 1022 transition count 997
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5304 place count 1022 transition count 996
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5305 place count 1021 transition count 996
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 5 with 49 rules applied. Total rules applied 5354 place count 1021 transition count 996
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5355 place count 1020 transition count 995
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 5357 place count 1018 transition count 995
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 5357 place count 1018 transition count 994
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5359 place count 1017 transition count 994
Applied a total of 5359 rules in 1968 ms. Remains 1017 /3503 variables (removed 2486) and now considering 994/3253 (removed 2259) transitions.
Finished structural reductions, in 1 iterations. Remains : 1017/3503 places, 994/3253 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7675 ms. (steps per millisecond=130 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 1]
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 899281 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=179 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 947364 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 977759 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0]
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4852 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 991008 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 958775 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 905417 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 994 rows 1017 cols
[2020-06-04 20:31:47] [INFO ] Computed 449 place invariants in 9 ms
[2020-06-04 20:31:48] [INFO ] [Real]Absence check using 449 positive place invariants in 312 ms returned sat
[2020-06-04 20:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:31:50] [INFO ] [Real]Absence check using state equation in 1961 ms returned sat
[2020-06-04 20:31:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:31:50] [INFO ] [Nat]Absence check using 449 positive place invariants in 322 ms returned sat
[2020-06-04 20:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:31:52] [INFO ] [Nat]Absence check using state equation in 1833 ms returned sat
[2020-06-04 20:31:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-04 20:31:52] [INFO ] [Nat]Added 50 Read/Feed constraints in 15 ms returned sat
[2020-06-04 20:31:52] [INFO ] Deduced a trap composed of 5 places in 106 ms
[2020-06-04 20:31:53] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-04 20:31:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2020-06-04 20:31:53] [INFO ] Computed and/alt/rep : 968/2120/968 causal constraints in 107 ms.
[2020-06-04 20:32:12] [INFO ] Added : 883 causal constraints over 177 iterations in 19658 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 63 ms.
[2020-06-04 20:32:13] [INFO ] [Real]Absence check using 449 positive place invariants in 308 ms returned sat
[2020-06-04 20:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:32:15] [INFO ] [Real]Absence check using state equation in 1990 ms returned sat
[2020-06-04 20:32:15] [INFO ] [Real]Added 50 Read/Feed constraints in 13 ms returned sat
[2020-06-04 20:32:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:32:15] [INFO ] [Nat]Absence check using 449 positive place invariants in 288 ms returned sat
[2020-06-04 20:32:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:32:17] [INFO ] [Nat]Absence check using state equation in 1981 ms returned sat
[2020-06-04 20:32:17] [INFO ] [Nat]Added 50 Read/Feed constraints in 17 ms returned sat
[2020-06-04 20:32:18] [INFO ] Deduced a trap composed of 5 places in 115 ms
[2020-06-04 20:32:18] [INFO ] Deduced a trap composed of 5 places in 85 ms
[2020-06-04 20:32:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2020-06-04 20:32:18] [INFO ] Computed and/alt/rep : 968/2120/968 causal constraints in 56 ms.
[2020-06-04 20:32:38] [INFO ] Added : 910 causal constraints over 182 iterations in 20276 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-06-04 20:32:39] [INFO ] [Real]Absence check using 449 positive place invariants in 285 ms returned sat
[2020-06-04 20:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:32:41] [INFO ] [Real]Absence check using state equation in 1938 ms returned sat
[2020-06-04 20:32:41] [INFO ] [Real]Added 50 Read/Feed constraints in 12 ms returned sat
[2020-06-04 20:32:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:32:41] [INFO ] [Nat]Absence check using 449 positive place invariants in 213 ms returned sat
[2020-06-04 20:32:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:32:43] [INFO ] [Nat]Absence check using state equation in 1878 ms returned sat
[2020-06-04 20:32:43] [INFO ] [Nat]Added 50 Read/Feed constraints in 21 ms returned sat
[2020-06-04 20:32:43] [INFO ] Deduced a trap composed of 6 places in 65 ms
[2020-06-04 20:32:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2020-06-04 20:32:43] [INFO ] Computed and/alt/rep : 968/2120/968 causal constraints in 66 ms.
[2020-06-04 20:33:03] [INFO ] Added : 888 causal constraints over 178 iterations in 20201 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
[2020-06-04 20:33:04] [INFO ] [Real]Absence check using 449 positive place invariants in 292 ms returned sat
[2020-06-04 20:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:06] [INFO ] [Real]Absence check using state equation in 1998 ms returned sat
[2020-06-04 20:33:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:33:06] [INFO ] [Nat]Absence check using 449 positive place invariants in 250 ms returned sat
[2020-06-04 20:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:08] [INFO ] [Nat]Absence check using state equation in 2001 ms returned sat
[2020-06-04 20:33:08] [INFO ] [Nat]Added 50 Read/Feed constraints in 34 ms returned sat
[2020-06-04 20:33:08] [INFO ] Computed and/alt/rep : 968/2120/968 causal constraints in 60 ms.
[2020-06-04 20:33:29] [INFO ] Added : 895 causal constraints over 179 iterations in 20277 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-06-04 20:33:29] [INFO ] [Real]Absence check using 449 positive place invariants in 299 ms returned sat
[2020-06-04 20:33:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:31] [INFO ] [Real]Absence check using state equation in 2088 ms returned sat
[2020-06-04 20:33:31] [INFO ] [Real]Added 50 Read/Feed constraints in 23 ms returned sat
[2020-06-04 20:33:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:33:32] [INFO ] [Nat]Absence check using 449 positive place invariants in 304 ms returned sat
[2020-06-04 20:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:34] [INFO ] [Nat]Absence check using state equation in 1873 ms returned sat
[2020-06-04 20:33:34] [INFO ] [Nat]Added 50 Read/Feed constraints in 38 ms returned sat
[2020-06-04 20:33:34] [INFO ] Computed and/alt/rep : 968/2120/968 causal constraints in 66 ms.
[2020-06-04 20:33:53] [INFO ] Added : 892 causal constraints over 179 iterations in 18765 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 63 ms.
[2020-06-04 20:33:53] [INFO ] [Real]Absence check using 449 positive place invariants in 293 ms returned sat
[2020-06-04 20:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:55] [INFO ] [Real]Absence check using state equation in 2150 ms returned sat
[2020-06-04 20:33:55] [INFO ] [Real]Added 50 Read/Feed constraints in 27 ms returned sat
[2020-06-04 20:33:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:33:56] [INFO ] [Nat]Absence check using 449 positive place invariants in 283 ms returned sat
[2020-06-04 20:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:33:58] [INFO ] [Nat]Absence check using state equation in 1924 ms returned sat
[2020-06-04 20:33:58] [INFO ] [Nat]Added 50 Read/Feed constraints in 15 ms returned sat
[2020-06-04 20:33:58] [INFO ] Computed and/alt/rep : 968/2120/968 causal constraints in 85 ms.
[2020-06-04 20:34:19] [INFO ] Added : 890 causal constraints over 178 iterations in 20669 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 83 ms.
[2020-06-04 20:34:19] [INFO ] [Real]Absence check using 449 positive place invariants in 293 ms returned sat
[2020-06-04 20:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:34:21] [INFO ] [Real]Absence check using state equation in 1946 ms returned sat
[2020-06-04 20:34:21] [INFO ] [Real]Added 50 Read/Feed constraints in 22 ms returned sat
[2020-06-04 20:34:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:34:22] [INFO ] [Nat]Absence check using 449 positive place invariants in 227 ms returned sat
[2020-06-04 20:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:34:24] [INFO ] [Nat]Absence check using state equation in 2251 ms returned sat
[2020-06-04 20:34:24] [INFO ] [Nat]Added 50 Read/Feed constraints in 17 ms returned sat
[2020-06-04 20:34:24] [INFO ] Computed and/alt/rep : 968/2120/968 causal constraints in 62 ms.
[2020-06-04 20:34:44] [INFO ] Added : 865 causal constraints over 173 iterations in 20131 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 53 ms.
Incomplete Parikh walk after 190300 steps, including 1000 resets, run finished after 1645 ms. (steps per millisecond=115 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 198800 steps, including 922 resets, run finished after 1724 ms. (steps per millisecond=115 ) properties seen :[0, 0, 1, 1, 1, 1, 0] could not realise parikh vector
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 170000 steps, including 256 resets, run finished after 1686 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 294500 steps, including 1000 resets, run finished after 1962 ms. (steps per millisecond=150 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 136500 steps, including 1000 resets, run finished after 957 ms. (steps per millisecond=142 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 206400 steps, including 1000 resets, run finished after 1438 ms. (steps per millisecond=143 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 211800 steps, including 392 resets, run finished after 1563 ms. (steps per millisecond=135 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 26 out of 1017 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1017/1017 places, 994/994 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 1017 transition count 985
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 1008 transition count 985
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 46 place count 994 transition count 971
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 60 place count 987 transition count 977
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 986 transition count 976
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 985 transition count 975
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 984 transition count 974
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 983 transition count 973
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 982 transition count 972
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 981 transition count 971
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 67 place count 980 transition count 970
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 979 transition count 969
Applied a total of 68 rules in 364 ms. Remains 979 /1017 variables (removed 38) and now considering 969/994 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 979/1017 places, 969/994 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6818 ms. (steps per millisecond=146 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 960688 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 944808 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 821063 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 2492827 steps, run timeout after 30001 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0]
Probabilistic random walk after 2492827 steps, saw 362865 distinct states, run finished after 30001 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0]
// Phase 1: matrix 969 rows 979 cols
[2020-06-04 20:35:48] [INFO ] Computed 449 place invariants in 3 ms
[2020-06-04 20:35:48] [INFO ] [Real]Absence check using 449 positive place invariants in 267 ms returned sat
[2020-06-04 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:35:50] [INFO ] [Real]Absence check using state equation in 1882 ms returned sat
[2020-06-04 20:35:50] [INFO ] State equation strengthened by 27 read => feed constraints.
[2020-06-04 20:35:50] [INFO ] [Real]Added 27 Read/Feed constraints in 16 ms returned sat
[2020-06-04 20:35:50] [INFO ] Deduced a trap composed of 3 places in 110 ms
[2020-06-04 20:35:50] [INFO ] Deduced a trap composed of 3 places in 89 ms
[2020-06-04 20:35:50] [INFO ] Deduced a trap composed of 3 places in 70 ms
[2020-06-04 20:35:50] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-06-04 20:35:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 504 ms
[2020-06-04 20:35:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:35:51] [INFO ] [Nat]Absence check using 449 positive place invariants in 200 ms returned sat
[2020-06-04 20:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:35:53] [INFO ] [Nat]Absence check using state equation in 1979 ms returned sat
[2020-06-04 20:35:53] [INFO ] [Nat]Added 27 Read/Feed constraints in 12 ms returned sat
[2020-06-04 20:35:53] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-06-04 20:35:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2020-06-04 20:35:53] [INFO ] Computed and/alt/rep : 953/1894/953 causal constraints in 57 ms.
[2020-06-04 20:36:11] [INFO ] Added : 866 causal constraints over 174 iterations in 18084 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 75 ms.
[2020-06-04 20:36:12] [INFO ] [Real]Absence check using 449 positive place invariants in 284 ms returned sat
[2020-06-04 20:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:36:13] [INFO ] [Real]Absence check using state equation in 1862 ms returned sat
[2020-06-04 20:36:13] [INFO ] [Real]Added 27 Read/Feed constraints in 10 ms returned sat
[2020-06-04 20:36:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:36:14] [INFO ] [Nat]Absence check using 449 positive place invariants in 204 ms returned sat
[2020-06-04 20:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:36:16] [INFO ] [Nat]Absence check using state equation in 1763 ms returned sat
[2020-06-04 20:36:16] [INFO ] [Nat]Added 27 Read/Feed constraints in 10 ms returned sat
[2020-06-04 20:36:16] [INFO ] Deduced a trap composed of 3 places in 99 ms
[2020-06-04 20:36:16] [INFO ] Deduced a trap composed of 5 places in 104 ms
[2020-06-04 20:36:16] [INFO ] Deduced a trap composed of 5 places in 77 ms
[2020-06-04 20:36:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 420 ms
[2020-06-04 20:36:16] [INFO ] Computed and/alt/rep : 953/1894/953 causal constraints in 41 ms.
[2020-06-04 20:36:35] [INFO ] Added : 890 causal constraints over 180 iterations in 18947 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 50 ms.
[2020-06-04 20:36:36] [INFO ] [Real]Absence check using 449 positive place invariants in 272 ms returned sat
[2020-06-04 20:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:36:38] [INFO ] [Real]Absence check using state equation in 1993 ms returned sat
[2020-06-04 20:36:38] [INFO ] [Real]Added 27 Read/Feed constraints in 19 ms returned sat
[2020-06-04 20:36:38] [INFO ] Deduced a trap composed of 3 places in 159 ms
[2020-06-04 20:36:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2020-06-04 20:36:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:36:38] [INFO ] [Nat]Absence check using 449 positive place invariants in 269 ms returned sat
[2020-06-04 20:36:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:36:40] [INFO ] [Nat]Absence check using state equation in 1828 ms returned sat
[2020-06-04 20:36:40] [INFO ] [Nat]Added 27 Read/Feed constraints in 11 ms returned sat
[2020-06-04 20:36:40] [INFO ] Computed and/alt/rep : 953/1894/953 causal constraints in 75 ms.
[2020-06-04 20:37:04] [INFO ] Added : 870 causal constraints over 174 iterations in 23985 ms.(timeout) Result :unknown
Incomplete Parikh walk after 195400 steps, including 1000 resets, run finished after 1318 ms. (steps per millisecond=148 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 146700 steps, including 881 resets, run finished after 1084 ms. (steps per millisecond=135 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 231100 steps, including 934 resets, run finished after 1671 ms. (steps per millisecond=138 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 26 out of 979 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 979/979 places, 969/969 transitions.
Applied a total of 0 rules in 15 ms. Remains 979 /979 variables (removed 0) and now considering 969/969 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 979/979 places, 969/969 transitions.
Starting structural reductions, iteration 0 : 979/979 places, 969/969 transitions.
Applied a total of 0 rules in 14 ms. Remains 979 /979 variables (removed 0) and now considering 969/969 (removed 0) transitions.
// Phase 1: matrix 969 rows 979 cols
[2020-06-04 20:37:08] [INFO ] Computed 449 place invariants in 2 ms
[2020-06-04 20:37:11] [INFO ] Implicit Places using invariants in 2513 ms returned [968]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2517 ms to find 1 implicit places.
[2020-06-04 20:37:11] [INFO ] Redundant transitions in 116 ms returned []
// Phase 1: matrix 969 rows 978 cols
[2020-06-04 20:37:11] [INFO ] Computed 448 place invariants in 7 ms
[2020-06-04 20:37:13] [INFO ] Dead Transitions using invariants and state equation in 2495 ms returned []
Starting structural reductions, iteration 1 : 978/979 places, 969/969 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 978 transition count 969
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 977 transition count 968
Applied a total of 3 rules in 54 ms. Remains 977 /978 variables (removed 1) and now considering 968/969 (removed 1) transitions.
// Phase 1: matrix 968 rows 977 cols
[2020-06-04 20:37:13] [INFO ] Computed 448 place invariants in 4 ms
[2020-06-04 20:37:16] [INFO ] Implicit Places using invariants in 2508 ms returned []
// Phase 1: matrix 968 rows 977 cols
[2020-06-04 20:37:16] [INFO ] Computed 448 place invariants in 2 ms
[2020-06-04 20:37:18] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-06-04 20:37:25] [INFO ] Implicit Places using invariants and state equation in 9537 ms returned []
Implicit Place search using SMT with State Equation took 12046 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 977/979 places, 968/969 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6804 ms. (steps per millisecond=146 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 977985 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 978447 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 859478 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 2470062 steps, run timeout after 30001 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0]
Probabilistic random walk after 2470062 steps, saw 359401 distinct states, run finished after 30001 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0]
// Phase 1: matrix 968 rows 977 cols
[2020-06-04 20:38:17] [INFO ] Computed 448 place invariants in 2 ms
[2020-06-04 20:38:18] [INFO ] [Real]Absence check using 448 positive place invariants in 261 ms returned sat
[2020-06-04 20:38:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:38:20] [INFO ] [Real]Absence check using state equation in 1969 ms returned sat
[2020-06-04 20:38:20] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-06-04 20:38:20] [INFO ] [Real]Added 26 Read/Feed constraints in 18 ms returned sat
[2020-06-04 20:38:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:38:20] [INFO ] [Nat]Absence check using 448 positive place invariants in 279 ms returned sat
[2020-06-04 20:38:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:38:22] [INFO ] [Nat]Absence check using state equation in 1843 ms returned sat
[2020-06-04 20:38:22] [INFO ] [Nat]Added 26 Read/Feed constraints in 25 ms returned sat
[2020-06-04 20:38:22] [INFO ] Computed and/alt/rep : 952/1888/952 causal constraints in 110 ms.
[2020-06-04 20:38:37] [INFO ] Added : 865 causal constraints over 174 iterations in 15097 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 84 ms.
[2020-06-04 20:38:38] [INFO ] [Real]Absence check using 448 positive place invariants in 292 ms returned sat
[2020-06-04 20:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:38:40] [INFO ] [Real]Absence check using state equation in 1890 ms returned sat
[2020-06-04 20:38:40] [INFO ] [Real]Added 26 Read/Feed constraints in 11 ms returned sat
[2020-06-04 20:38:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:38:40] [INFO ] [Nat]Absence check using 448 positive place invariants in 290 ms returned sat
[2020-06-04 20:38:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:38:42] [INFO ] [Nat]Absence check using state equation in 1856 ms returned sat
[2020-06-04 20:38:42] [INFO ] [Nat]Added 26 Read/Feed constraints in 11 ms returned sat
[2020-06-04 20:38:42] [INFO ] Computed and/alt/rep : 952/1888/952 causal constraints in 102 ms.
[2020-06-04 20:38:59] [INFO ] Added : 866 causal constraints over 174 iterations in 17066 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 74 ms.
[2020-06-04 20:39:00] [INFO ] [Real]Absence check using 448 positive place invariants in 295 ms returned sat
[2020-06-04 20:39:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:39:02] [INFO ] [Real]Absence check using state equation in 1958 ms returned sat
[2020-06-04 20:39:02] [INFO ] [Real]Added 26 Read/Feed constraints in 14 ms returned sat
[2020-06-04 20:39:02] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-06-04 20:39:02] [INFO ] Deduced a trap composed of 3 places in 72 ms
[2020-06-04 20:39:02] [INFO ] Deduced a trap composed of 4 places in 77 ms
[2020-06-04 20:39:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 399 ms
[2020-06-04 20:39:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:39:03] [INFO ] [Nat]Absence check using 448 positive place invariants in 291 ms returned sat
[2020-06-04 20:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:39:05] [INFO ] [Nat]Absence check using state equation in 2015 ms returned sat
[2020-06-04 20:39:05] [INFO ] [Nat]Added 26 Read/Feed constraints in 10 ms returned sat
[2020-06-04 20:39:05] [INFO ] Computed and/alt/rep : 952/1888/952 causal constraints in 62 ms.
[2020-06-04 20:39:29] [INFO ] Added : 870 causal constraints over 174 iterations in 23885 ms.(timeout) Result :unknown
Incomplete Parikh walk after 157400 steps, including 845 resets, run finished after 1404 ms. (steps per millisecond=112 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 170300 steps, including 325 resets, run finished after 1220 ms. (steps per millisecond=139 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 183100 steps, including 546 resets, run finished after 1476 ms. (steps per millisecond=124 ) properties seen :[0, 0] could not realise parikh vector
Support contains 20 out of 977 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 977/977 places, 968/968 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 977 transition count 967
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 976 transition count 967
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 0 with 4 rules applied. Total rules applied 6 place count 974 transition count 965
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 972 transition count 965
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 971 transition count 964
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 970 transition count 963
Applied a total of 12 rules in 72 ms. Remains 970 /977 variables (removed 7) and now considering 963/968 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 970/977 places, 963/968 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7192 ms. (steps per millisecond=139 ) properties seen :[0, 0]
Interrupted Best-First random walk after 952909 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=190 ) properties seen :[0, 0]
Interrupted Best-First random walk after 931496 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 2669267 steps, run timeout after 30001 ms. (steps per millisecond=88 ) properties seen :[0, 0]
Probabilistic random walk after 2669267 steps, saw 386637 distinct states, run finished after 30001 ms. (steps per millisecond=88 ) properties seen :[0, 0]
// Phase 1: matrix 963 rows 970 cols
[2020-06-04 20:40:20] [INFO ] Computed 448 place invariants in 3 ms
[2020-06-04 20:40:21] [INFO ] [Real]Absence check using 448 positive place invariants in 263 ms returned sat
[2020-06-04 20:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:23] [INFO ] [Real]Absence check using state equation in 1981 ms returned sat
[2020-06-04 20:40:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-06-04 20:40:23] [INFO ] [Real]Added 12 Read/Feed constraints in 14 ms returned sat
[2020-06-04 20:40:23] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-04 20:40:23] [INFO ] Deduced a trap composed of 3 places in 54 ms
[2020-06-04 20:40:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2020-06-04 20:40:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:40:23] [INFO ] [Nat]Absence check using 448 positive place invariants in 291 ms returned sat
[2020-06-04 20:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:25] [INFO ] [Nat]Absence check using state equation in 1692 ms returned sat
[2020-06-04 20:40:25] [INFO ] [Nat]Added 12 Read/Feed constraints in 19 ms returned sat
[2020-06-04 20:40:25] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-04 20:40:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2020-06-04 20:40:25] [INFO ] Computed and/alt/rep : 950/1796/950 causal constraints in 62 ms.
[2020-06-04 20:40:41] [INFO ] Added : 879 causal constraints over 177 iterations in 15388 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 69 ms.
[2020-06-04 20:40:41] [INFO ] [Real]Absence check using 448 positive place invariants in 290 ms returned sat
[2020-06-04 20:40:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:43] [INFO ] [Real]Absence check using state equation in 2025 ms returned sat
[2020-06-04 20:40:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:40:44] [INFO ] [Nat]Absence check using 448 positive place invariants in 195 ms returned sat
[2020-06-04 20:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:46] [INFO ] [Nat]Absence check using state equation in 1980 ms returned sat
[2020-06-04 20:40:46] [INFO ] [Nat]Added 12 Read/Feed constraints in 9 ms returned sat
[2020-06-04 20:40:46] [INFO ] Computed and/alt/rep : 950/1796/950 causal constraints in 62 ms.
[2020-06-04 20:41:07] [INFO ] Added : 850 causal constraints over 170 iterations in 21286 ms. Result :unknown
Incomplete Parikh walk after 184300 steps, including 558 resets, run finished after 1624 ms. (steps per millisecond=113 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 190000 steps, including 1000 resets, run finished after 1300 ms. (steps per millisecond=146 ) properties seen :[0, 0] could not realise parikh vector
Support contains 20 out of 970 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 970/970 places, 963/963 transitions.
Applied a total of 0 rules in 14 ms. Remains 970 /970 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 970/970 places, 963/963 transitions.
Starting structural reductions, iteration 0 : 970/970 places, 963/963 transitions.
Applied a total of 0 rules in 14 ms. Remains 970 /970 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 970 cols
[2020-06-04 20:41:10] [INFO ] Computed 448 place invariants in 4 ms
[2020-06-04 20:41:12] [INFO ] Implicit Places using invariants in 2186 ms returned []
// Phase 1: matrix 963 rows 970 cols
[2020-06-04 20:41:12] [INFO ] Computed 448 place invariants in 3 ms
[2020-06-04 20:41:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-06-04 20:41:21] [INFO ] Implicit Places using invariants and state equation in 9161 ms returned []
Implicit Place search using SMT with State Equation took 11349 ms to find 0 implicit places.
[2020-06-04 20:41:21] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 963 rows 970 cols
[2020-06-04 20:41:21] [INFO ] Computed 448 place invariants in 2 ms
[2020-06-04 20:41:24] [INFO ] Dead Transitions using invariants and state equation in 2362 ms returned []
Finished structural reductions, in 1 iterations. Remains : 970/970 places, 963/963 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 733 ms. (steps per millisecond=136 ) properties seen :[0, 0]
// Phase 1: matrix 963 rows 970 cols
[2020-06-04 20:41:24] [INFO ] Computed 448 place invariants in 1 ms
[2020-06-04 20:41:25] [INFO ] [Real]Absence check using 448 positive place invariants in 261 ms returned sat
[2020-06-04 20:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:26] [INFO ] [Real]Absence check using state equation in 1776 ms returned sat
[2020-06-04 20:41:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-06-04 20:41:27] [INFO ] [Real]Added 12 Read/Feed constraints in 10 ms returned sat
[2020-06-04 20:41:27] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-04 20:41:27] [INFO ] Deduced a trap composed of 3 places in 81 ms
[2020-06-04 20:41:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2020-06-04 20:41:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:41:27] [INFO ] [Nat]Absence check using 448 positive place invariants in 270 ms returned sat
[2020-06-04 20:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:29] [INFO ] [Nat]Absence check using state equation in 2157 ms returned sat
[2020-06-04 20:41:29] [INFO ] [Nat]Added 12 Read/Feed constraints in 13 ms returned sat
[2020-06-04 20:41:30] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-06-04 20:41:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2020-06-04 20:41:30] [INFO ] Computed and/alt/rep : 950/1796/950 causal constraints in 53 ms.
[2020-06-04 20:41:47] [INFO ] Added : 865 causal constraints over 173 iterations in 17261 ms. Result :unknown
[2020-06-04 20:41:47] [INFO ] [Real]Absence check using 448 positive place invariants in 302 ms returned sat
[2020-06-04 20:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:49] [INFO ] [Real]Absence check using state equation in 1806 ms returned sat
[2020-06-04 20:41:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:41:49] [INFO ] [Nat]Absence check using 448 positive place invariants in 205 ms returned sat
[2020-06-04 20:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:52] [INFO ] [Nat]Absence check using state equation in 2038 ms returned sat
[2020-06-04 20:41:52] [INFO ] [Nat]Added 12 Read/Feed constraints in 20 ms returned sat
[2020-06-04 20:41:52] [INFO ] Computed and/alt/rep : 950/1796/950 causal constraints in 84 ms.
[2020-06-04 20:42:09] [INFO ] Added : 850 causal constraints over 170 iterations in 17536 ms. Result :unknown
Partial Free-agglomeration rule applied 104 times.
Drop transitions removed 104 transitions
Iterating global reduction 0 with 104 rules applied. Total rules applied 104 place count 970 transition count 963
Partial Post-agglomeration rule applied 131 times.
Drop transitions removed 131 transitions
Iterating global reduction 0 with 131 rules applied. Total rules applied 235 place count 970 transition count 963
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 236 place count 970 transition count 962
Applied a total of 236 rules in 97 ms. Remains 970 /970 variables (removed 0) and now considering 962/963 (removed 1) transitions.
// Phase 1: matrix 962 rows 970 cols
[2020-06-04 20:42:09] [INFO ] Computed 448 place invariants in 3 ms
[2020-06-04 20:42:10] [INFO ] [Real]Absence check using 448 positive place invariants in 267 ms returned sat
[2020-06-04 20:42:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:12] [INFO ] [Real]Absence check using state equation in 2074 ms returned sat
[2020-06-04 20:42:12] [INFO ] State equation strengthened by 98 read => feed constraints.
[2020-06-04 20:42:12] [INFO ] [Real]Added 98 Read/Feed constraints in 47 ms returned sat
[2020-06-04 20:42:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:42:12] [INFO ] [Nat]Absence check using 448 positive place invariants in 271 ms returned sat
[2020-06-04 20:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:14] [INFO ] [Nat]Absence check using state equation in 1835 ms returned sat
[2020-06-04 20:42:14] [INFO ] [Nat]Added 98 Read/Feed constraints in 26 ms returned sat
[2020-06-04 20:42:14] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-04 20:42:14] [INFO ] Deduced a trap composed of 3 places in 16 ms
[2020-06-04 20:42:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2020-06-04 20:42:14] [INFO ] Computed and/alt/rep : 949/2375/949 causal constraints in 70 ms.
[2020-06-04 20:42:33] [INFO ] Added : 866 causal constraints over 174 iterations in 18686 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2020-06-04 20:42:34] [INFO ] [Real]Absence check using 448 positive place invariants in 311 ms returned sat
[2020-06-04 20:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:36] [INFO ] [Real]Absence check using state equation in 2035 ms returned sat
[2020-06-04 20:42:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:42:36] [INFO ] [Nat]Absence check using 448 positive place invariants in 278 ms returned sat
[2020-06-04 20:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:38] [INFO ] [Nat]Absence check using state equation in 2101 ms returned sat
[2020-06-04 20:42:38] [INFO ] [Nat]Added 98 Read/Feed constraints in 25 ms returned sat
[2020-06-04 20:42:38] [INFO ] Deduced a trap composed of 3 places in 12 ms
[2020-06-04 20:42:39] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-04 20:42:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2020-06-04 20:42:39] [INFO ] Computed and/alt/rep : 949/2375/949 causal constraints in 70 ms.
[2020-06-04 20:43:01] [INFO ] Added : 850 causal constraints over 170 iterations in 22427 ms. Result :unknown
[2020-06-04 20:43:01] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-04 20:43:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 50 ms.
[2020-06-04 20:43:01] [INFO ] Flatten gal took : 214 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldIIPt-PT-050B @ 3570 seconds

FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050B-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ ShieldIIPt-PT-050B

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 20:43:02 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p193) AND (1 <= p32) AND (1 <= p561) AND (1 <= p587))))",
"processed_size": 68,
"rewrites": 1
},
"result":
{
"edges": 144,
"markings": 145,
"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": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 5,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (F ((((p739 <= 0)) AND ((p336 <= 0)) AND (1 <= p649) AND (1 <= p638) AND (1 <= p643) AND (1 <= p652) AND ((p70 <= 0) OR (p77 <= 0) OR (p80 <= 0)) AND (((1 <= p395)) OR ((1 <= p237))) AND (((1 <= p275)) OR ((1 <= p98)) OR ((1 <= p529)) OR ((1 <= p307) AND (1 <= p324))))))",
"processed_size": 279,
"rewrites": 1
},
"result":
{
"edges": 300,
"markings": 171,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 222,
"problems": 24
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 30584,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 4715,
"conflict_clusters": 326,
"places": 970,
"places_significant": 522,
"singleton_clusters": 0,
"transitions": 963
},
"result":
{
"preliminary_value": "yes no ",
"value": "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: 1933/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 31040
lola: finding significant places
lola: 970 places, 963 transitions, 522 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: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p561 <= 1)
lola: LP says that atomic proposition is always true: (p587 <= 1)
lola: LP says that atomic proposition is always true: (p739 <= 1)
lola: LP says that atomic proposition is always true: (p336 <= 1)
lola: LP says that atomic proposition is always true: (p649 <= 1)
lola: LP says that atomic proposition is always true: (p638 <= 1)
lola: LP says that atomic proposition is always true: (p643 <= 1)
lola: LP says that atomic proposition is always true: (p652 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p395 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p529 <= 1)
lola: LP says that atomic proposition is always true: (p307 <= 1)
lola: LP says that atomic proposition is always true: (p324 <= 1)
lola: E (F (((1 <= p193) AND (1 <= p32) AND (1 <= p561) AND (1 <= p587)))) : E (F ((((p739 <= 0)) AND ((p336 <= 0)) AND (1 <= p649) AND (1 <= p638) AND (1 <= p643) AND (1 <= p652) AND ((p70 <= 0) OR (p77 <= 0) OR (p80 <= 0)) AND (((1 <= p395)) OR ((1 <= p237))) AND (((1 <= p275)) OR ((1 <= p98)) OR ((1 <= p529)) OR ((1 <= p307) AND (1 <= p324))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p193) AND (1 <= p32) AND (1 <= p561) AND (1 <= p587))))
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 <= p193) AND (1 <= p32) AND (1 <= p561) AND (1 <= p587))))
lola: processed formula length: 68
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 <= p193) AND (1 <= p32) AND (1 <= p561) AND (1 <= p587))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 145 markings, 144 edges
lola: ========================================
lola: subprocess 1 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p739 <= 0)) AND ((p336 <= 0)) AND (1 <= p649) AND (1 <= p638) AND (1 <= p643) AND (1 <= p652) AND ((p70 <= 0) OR (p77 <= 0) OR (p80 <= 0)) AND (((1 <= p395)) OR ((1 <= p237))) AND (((1 <= p275)) OR ((1 <= p98)) OR ((1 <= p529)) OR ((1 <= p307) AND (1 <= p324))))))
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 ((((p739 <= 0)) AND ((p336 <= 0)) AND (1 <= p649) AND (1 <= p638) AND (1 <= p643) AND (1 <= p652) AND ((p70 <= 0) OR (p77 <= 0) OR (p80 <= 0)) AND (((1 <= p395)) OR ((1 <= p237))) AND (((1 <= p275)) OR ((1 <= p98)) OR ((1 <= p529)) OR ((1 <= p307) AND (1 <= p324))))))
lola: processed formula length: 279
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: (((p739 <= 0)) AND ((p336 <= 0)) AND (1 <= p649) AND (1 <= p638) AND (1 <= p643) AND (1 <= p652) AND ((p70 <= 0) OR (p77 <= 0) OR (p80 <= 0)) AND (((1 <= p395)) OR ((1 <= p237))) AND (((1 <= p275)) OR ((1 <= p98)) OR ((1 <= p529)) OR ((1 <= p307) AND (1 <= p324))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 222 literals and 24 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 171 markings, 300 edges
lola: RESULT
lola:
SUMMARY: yes no
lola:
preliminary result: yes no
lola: ========================================
lola: memory consumption: 30584 KB
lola: time consumption: 6 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="ShieldIIPt-PT-050B"
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 ShieldIIPt-PT-050B, 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 r211-tajo-159033477400375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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