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-159033477900735.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 ShieldPPPt-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477900735
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 3.4K May 14 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 19:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 19:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 14:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:02 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 685K 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 ShieldPPPt-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591324827945

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 02:40:30] [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-05 02:40:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 02:40:30] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2020-06-05 02:40:31] [INFO ] Transformed 2503 places.
[2020-06-05 02:40:31] [INFO ] Transformed 1803 transitions.
[2020-06-05 02:40:31] [INFO ] Found NUPN structural information;
[2020-06-05 02:40:31] [INFO ] Parsed PT model containing 2503 places and 1803 transitions in 602 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 200 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 250 ms. (steps per millisecond=40 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 110 ms. (steps per millisecond=90 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 91 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 112 ms. (steps per millisecond=89 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 97 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 109 ms. (steps per millisecond=91 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 108 ms. (steps per millisecond=92 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 105 ms. (steps per millisecond=95 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 112 ms. (steps per millisecond=89 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1802 rows 2503 cols
[2020-06-05 02:40:33] [INFO ] Computed 1101 place invariants in 55 ms
[2020-06-05 02:40:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 1799 ms returned sat
[2020-06-05 02:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:40:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:40:38] [INFO ] [Real]Absence check using state equation in 2800 ms returned (error "Failed to check-sat")
[2020-06-05 02:40:43] [INFO ] [Real]Absence check using 1101 positive place invariants in 4169 ms returned sat
[2020-06-05 02:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:40:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2020-06-05 02:40:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:40:48] [INFO ] [Real]Absence check using 1101 positive place invariants in 4593 ms returned (error "Failed to check-sat")
[2020-06-05 02:40:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:40:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-06-05 02:40:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 1371 ms returned sat
[2020-06-05 02:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:40:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:40:53] [INFO ] [Real]Absence check using state equation in 3239 ms returned (error "Failed to check-sat")
[2020-06-05 02:40:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 1201 ms returned sat
[2020-06-05 02:40:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:40:58] [INFO ] [Real]Absence check using state equation in 3415 ms returned (error "Failed to check-sat")
[2020-06-05 02:41:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 3477 ms returned sat
[2020-06-05 02:41:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:03] [INFO ] [Real]Absence check using state equation in 957 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:41:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 1695 ms returned sat
[2020-06-05 02:41:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:41:08] [INFO ] [Real]Absence check using state equation in 3007 ms returned (error "Failed to check-sat")
[2020-06-05 02:41:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 1941 ms returned sat
[2020-06-05 02:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= s565 (- (+ t68 t300) t824))") while checking expression at index 7
[2020-06-05 02:41:15] [INFO ] [Real]Absence check using 1101 positive place invariants in 1834 ms returned sat
[2020-06-05 02:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:18] [INFO ] [Real]Absence check using state equation in 2761 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:41:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 1441 ms returned sat
[2020-06-05 02:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:23] [INFO ] [Real]Absence check using state equation in 3242 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:41:25] [INFO ] [Real]Absence check using 1101 positive place invariants in 1284 ms returned sat
[2020-06-05 02:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:41:28] [INFO ] [Real]Absence check using state equation in 3413 ms returned (error "Failed to check-sat")
[2020-06-05 02:41:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 1497 ms returned sat
[2020-06-05 02:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:41:33] [INFO ] [Real]Absence check using state equation in 3062 ms returned (error "Failed to check-sat")
[2020-06-05 02:41:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 1643 ms returned sat
[2020-06-05 02:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:41:38] [INFO ] [Real]Absence check using state equation in 2932 ms returned unknown
[2020-06-05 02:41:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 1860 ms returned sat
[2020-06-05 02:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:43] [INFO ] [Real]Absence check using state equation in 2842 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:41:45] [INFO ] [Real]Absence check using 1101 positive place invariants in 1249 ms returned sat
[2020-06-05 02:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:41:48] [INFO ] [Real]Absence check using state equation in 3320 ms returned (error "Solver has unexpectedly terminated")
Support contains 101 out of 2503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 376 times.
Drop transitions removed 376 transitions
Iterating global reduction 0 with 376 rules applied. Total rules applied 380 place count 2501 transition count 1800
Applied a total of 380 rules in 828 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 16038 ms. (steps per millisecond=62 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0]
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 465460 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 472601 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 419636 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 456382 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 452621 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 432299 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 416568 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 434758 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 410218 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 474106 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 452253 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1800 rows 2501 cols
[2020-06-05 02:43:00] [INFO ] Computed 1101 place invariants in 34 ms
[2020-06-05 02:43:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 1448 ms returned sat
[2020-06-05 02:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:43:14] [INFO ] [Real]Absence check using state equation in 11620 ms returned sat
[2020-06-05 02:43:14] [INFO ] State equation strengthened by 94 read => feed constraints.
[2020-06-05 02:43:14] [INFO ] [Real]Added 94 Read/Feed constraints in 47 ms returned sat
[2020-06-05 02:43:14] [INFO ] Deduced a trap composed of 7 places in 304 ms
[2020-06-05 02:43:15] [INFO ] Deduced a trap composed of 8 places in 310 ms
[2020-06-05 02:43:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 996 ms
[2020-06-05 02:43:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:43:17] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1668 ms returned sat
[2020-06-05 02:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:43:38] [INFO ] [Nat]Absence check using state equation in 20398 ms returned sat
[2020-06-05 02:43:38] [INFO ] [Nat]Added 94 Read/Feed constraints in 29 ms returned sat
[2020-06-05 02:43:38] [INFO ] Deduced a trap composed of 7 places in 148 ms
[2020-06-05 02:43:38] [INFO ] Deduced a trap composed of 6 places in 174 ms
[2020-06-05 02:43:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 579 ms
[2020-06-05 02:43:38] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 145 ms.
[2020-06-05 02:43:58] [INFO ] Added : 520 causal constraints over 104 iterations in 20101 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 70 ms.
[2020-06-05 02:44:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 1264 ms returned sat
[2020-06-05 02:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:44:16] [INFO ] [Real]Absence check using state equation in 15874 ms returned sat
[2020-06-05 02:44:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:44:18] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1136 ms returned sat
[2020-06-05 02:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:44:32] [INFO ] [Nat]Absence check using state equation in 13761 ms returned sat
[2020-06-05 02:44:32] [INFO ] [Nat]Added 94 Read/Feed constraints in 82 ms returned sat
[2020-06-05 02:44:32] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 162 ms.
[2020-06-05 02:44:52] [INFO ] Added : 485 causal constraints over 97 iterations in 20177 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 94 ms.
[2020-06-05 02:44:54] [INFO ] [Real]Absence check using 1101 positive place invariants in 1479 ms returned sat
[2020-06-05 02:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:45:07] [INFO ] [Real]Absence check using state equation in 13188 ms returned sat
[2020-06-05 02:45:08] [INFO ] [Real]Added 94 Read/Feed constraints in 70 ms returned sat
[2020-06-05 02:45:08] [INFO ] Deduced a trap composed of 7 places in 210 ms
[2020-06-05 02:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 429 ms
[2020-06-05 02:45:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:45:12] [INFO ] [Nat]Absence check using 1101 positive place invariants in 3680 ms returned sat
[2020-06-05 02:45:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:45:30] [INFO ] [Nat]Absence check using state equation in 17153 ms returned sat
[2020-06-05 02:45:30] [INFO ] [Nat]Added 94 Read/Feed constraints in 53 ms returned sat
[2020-06-05 02:45:30] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 164 ms.
[2020-06-05 02:45:50] [INFO ] Added : 510 causal constraints over 102 iterations in 20514 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 177 ms.
[2020-06-05 02:45:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 1310 ms returned sat
[2020-06-05 02:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:46:04] [INFO ] [Real]Absence check using state equation in 11189 ms returned sat
[2020-06-05 02:46:04] [INFO ] [Real]Added 94 Read/Feed constraints in 35 ms returned sat
[2020-06-05 02:46:04] [INFO ] Deduced a trap composed of 6 places in 529 ms
[2020-06-05 02:46:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 666 ms
[2020-06-05 02:46:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:46:07] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1613 ms returned sat
[2020-06-05 02:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:46:19] [INFO ] [Nat]Absence check using state equation in 11994 ms returned sat
[2020-06-05 02:46:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 83 ms returned sat
[2020-06-05 02:46:19] [INFO ] Deduced a trap composed of 7 places in 309 ms
[2020-06-05 02:46:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2020-06-05 02:46:19] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 120 ms.
[2020-06-05 02:46:39] [INFO ] Added : 610 causal constraints over 122 iterations in 20236 ms.(timeout) Result :sat
[2020-06-05 02:46:40] [INFO ] Deduced a trap composed of 7 places in 134 ms
[2020-06-05 02:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-06-05 02:46:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 1217 ms returned sat
[2020-06-05 02:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:46:54] [INFO ] [Real]Absence check using state equation in 12324 ms returned sat
[2020-06-05 02:46:54] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2020-06-05 02:46:54] [INFO ] Deduced a trap composed of 7 places in 180 ms
[2020-06-05 02:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2020-06-05 02:46:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:46:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1064 ms returned sat
[2020-06-05 02:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:08] [INFO ] [Nat]Absence check using state equation in 12166 ms returned sat
[2020-06-05 02:47:08] [INFO ] [Nat]Added 94 Read/Feed constraints in 38 ms returned sat
[2020-06-05 02:47:08] [INFO ] Deduced a trap composed of 6 places in 110 ms
[2020-06-05 02:47:09] [INFO ] Deduced a trap composed of 7 places in 388 ms
[2020-06-05 02:47:09] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2020-06-05 02:47:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 976 ms
[2020-06-05 02:47:09] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 144 ms.
[2020-06-05 02:47:29] [INFO ] Added : 535 causal constraints over 107 iterations in 20179 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 103 ms.
[2020-06-05 02:47:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 1289 ms returned sat
[2020-06-05 02:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:42] [INFO ] [Real]Absence check using state equation in 10791 ms returned sat
[2020-06-05 02:47:42] [INFO ] [Real]Added 94 Read/Feed constraints in 53 ms returned sat
[2020-06-05 02:47:42] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 136 ms.
[2020-06-05 02:47:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:47:45] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1249 ms returned sat
[2020-06-05 02:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:56] [INFO ] [Nat]Absence check using state equation in 11303 ms returned sat
[2020-06-05 02:47:56] [INFO ] [Nat]Added 94 Read/Feed constraints in 80 ms returned sat
[2020-06-05 02:47:56] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 135 ms.
[2020-06-05 02:48:17] [INFO ] Added : 540 causal constraints over 108 iterations in 20409 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 93 ms.
[2020-06-05 02:48:19] [INFO ] [Real]Absence check using 1101 positive place invariants in 1409 ms returned sat
[2020-06-05 02:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:48:30] [INFO ] [Real]Absence check using state equation in 11479 ms returned sat
[2020-06-05 02:48:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:48:32] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1236 ms returned sat
[2020-06-05 02:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:48:43] [INFO ] [Nat]Absence check using state equation in 11136 ms returned sat
[2020-06-05 02:48:43] [INFO ] [Nat]Added 94 Read/Feed constraints in 27 ms returned sat
[2020-06-05 02:48:43] [INFO ] Deduced a trap composed of 7 places in 133 ms
[2020-06-05 02:48:43] [INFO ] Deduced a trap composed of 7 places in 127 ms
[2020-06-05 02:48:44] [INFO ] Deduced a trap composed of 6 places in 135 ms
[2020-06-05 02:48:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 671 ms
[2020-06-05 02:48:44] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 114 ms.
[2020-06-05 02:49:04] [INFO ] Added : 545 causal constraints over 109 iterations in 20238 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 74 ms.
[2020-06-05 02:49:06] [INFO ] [Real]Absence check using 1101 positive place invariants in 1633 ms returned sat
[2020-06-05 02:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:49:19] [INFO ] [Real]Absence check using state equation in 12620 ms returned sat
[2020-06-05 02:49:19] [INFO ] [Real]Added 94 Read/Feed constraints in 48 ms returned sat
[2020-06-05 02:49:20] [INFO ] Deduced a trap composed of 6 places in 418 ms
[2020-06-05 02:49:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 567 ms
[2020-06-05 02:49:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:49:22] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1545 ms returned sat
[2020-06-05 02:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:49:32] [INFO ] [Nat]Absence check using state equation in 10341 ms returned sat
[2020-06-05 02:49:32] [INFO ] [Nat]Added 94 Read/Feed constraints in 74 ms returned sat
[2020-06-05 02:49:32] [INFO ] Deduced a trap composed of 7 places in 126 ms
[2020-06-05 02:49:33] [INFO ] Deduced a trap composed of 6 places in 139 ms
[2020-06-05 02:49:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 598 ms
[2020-06-05 02:49:33] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 147 ms.
[2020-06-05 02:49:53] [INFO ] Added : 575 causal constraints over 115 iterations in 20132 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 69 ms.
[2020-06-05 02:49:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 1293 ms returned sat
[2020-06-05 02:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:50:06] [INFO ] [Real]Absence check using state equation in 10853 ms returned sat
[2020-06-05 02:50:06] [INFO ] [Real]Added 94 Read/Feed constraints in 55 ms returned sat
[2020-06-05 02:50:06] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 122 ms.
[2020-06-05 02:50:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:50:08] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1323 ms returned sat
[2020-06-05 02:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:50:19] [INFO ] [Nat]Absence check using state equation in 11133 ms returned sat
[2020-06-05 02:50:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 27 ms returned sat
[2020-06-05 02:50:19] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 115 ms.
[2020-06-05 02:50:39] [INFO ] Added : 510 causal constraints over 102 iterations in 20145 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 99 ms.
[2020-06-05 02:50:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 1240 ms returned sat
[2020-06-05 02:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:50:52] [INFO ] [Real]Absence check using state equation in 11031 ms returned sat
[2020-06-05 02:50:52] [INFO ] [Real]Added 94 Read/Feed constraints in 53 ms returned sat
[2020-06-05 02:50:53] [INFO ] Deduced a trap composed of 7 places in 209 ms
[2020-06-05 02:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2020-06-05 02:50:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:50:55] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1288 ms returned sat
[2020-06-05 02:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:51:06] [INFO ] [Nat]Absence check using state equation in 10994 ms returned sat
[2020-06-05 02:51:06] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2020-06-05 02:51:06] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2020-06-05 02:51:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2020-06-05 02:51:06] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 106 ms.
[2020-06-05 02:51:26] [INFO ] Added : 530 causal constraints over 106 iterations in 20163 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 109 ms.
[2020-06-05 02:51:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 1256 ms returned sat
[2020-06-05 02:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:51:39] [INFO ] [Real]Absence check using state equation in 10739 ms returned sat
[2020-06-05 02:51:39] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2020-06-05 02:51:39] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2020-06-05 02:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2020-06-05 02:51:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:51:41] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1300 ms returned sat
[2020-06-05 02:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:51:51] [INFO ] [Nat]Absence check using state equation in 10237 ms returned sat
[2020-06-05 02:51:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 34 ms returned sat
[2020-06-05 02:51:52] [INFO ] Computed and/alt/rep : 1799/6917/1799 causal constraints in 130 ms.
[2020-06-05 02:52:12] [INFO ] Added : 620 causal constraints over 124 iterations in 20082 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
Incomplete Parikh walk after 224400 steps, including 1000 resets, run finished after 4055 ms. (steps per millisecond=55 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 173700 steps, including 991 resets, run finished after 2753 ms. (steps per millisecond=63 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 219700 steps, including 997 resets, run finished after 3391 ms. (steps per millisecond=64 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 189800 steps, including 1000 resets, run finished after 2954 ms. (steps per millisecond=64 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 189300 steps, including 868 resets, run finished after 2688 ms. (steps per millisecond=70 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 194700 steps, including 1000 resets, run finished after 3181 ms. (steps per millisecond=61 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 245300 steps, including 1000 resets, run finished after 3921 ms. (steps per millisecond=62 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 312900 steps, including 1000 resets, run finished after 5262 ms. (steps per millisecond=59 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 179800 steps, including 958 resets, run finished after 2681 ms. (steps per millisecond=67 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 209000 steps, including 1000 resets, run finished after 3249 ms. (steps per millisecond=64 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 185100 steps, including 994 resets, run finished after 2933 ms. (steps per millisecond=63 ) properties seen :[0, 0] could not realise parikh vector
Support contains 25 out of 2501 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 2501 transition count 1800
Applied a total of 19 rules in 236 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 14621 ms. (steps per millisecond=68 ) properties seen :[0, 0]
Interrupted Best-First random walk after 455476 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen :[0, 0]
Interrupted Best-First random walk after 467199 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 1234132 steps, run timeout after 30001 ms. (steps per millisecond=41 ) properties seen :[0, 0]
Probabilistic random walk after 1234132 steps, saw 18514 distinct states, run finished after 30001 ms. (steps per millisecond=41 ) properties seen :[0, 0]
// Phase 1: matrix 1800 rows 2501 cols
[2020-06-05 02:53:44] [INFO ] Computed 1101 place invariants in 8 ms
[2020-06-05 02:53:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 1326 ms returned sat
[2020-06-05 02:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:53:57] [INFO ] [Real]Absence check using state equation in 11650 ms returned sat
[2020-06-05 02:53:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:53:59] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1248 ms returned sat
[2020-06-05 02:53:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:54:10] [INFO ] [Nat]Absence check using state equation in 11503 ms returned sat
[2020-06-05 02:54:10] [INFO ] State equation strengthened by 101 read => feed constraints.
[2020-06-05 02:54:10] [INFO ] [Nat]Added 101 Read/Feed constraints in 62 ms returned sat
[2020-06-05 02:54:11] [INFO ] Deduced a trap composed of 7 places in 145 ms
[2020-06-05 02:54:11] [INFO ] Deduced a trap composed of 8 places in 135 ms
[2020-06-05 02:54:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2020-06-05 02:54:11] [INFO ] Computed and/alt/rep : 1799/6972/1799 causal constraints in 132 ms.
[2020-06-05 02:54:31] [INFO ] Added : 520 causal constraints over 104 iterations in 20097 ms.(timeout) Result :sat
[2020-06-05 02:54:31] [INFO ] Deduced a trap composed of 8 places in 178 ms
[2020-06-05 02:54:32] [INFO ] Deduced a trap composed of 7 places in 173 ms
[2020-06-05 02:54:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 786 ms
Attempting to minimize the solution found.
Minimization took 108 ms.
[2020-06-05 02:54:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 2033 ms returned sat
[2020-06-05 02:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:54:47] [INFO ] [Real]Absence check using state equation in 12318 ms returned sat
[2020-06-05 02:54:47] [INFO ] [Real]Added 101 Read/Feed constraints in 57 ms returned sat
[2020-06-05 02:54:47] [INFO ] Deduced a trap composed of 7 places in 186 ms
[2020-06-05 02:54:48] [INFO ] Deduced a trap composed of 7 places in 202 ms
[2020-06-05 02:54:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 610 ms
[2020-06-05 02:54:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:54:49] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1282 ms returned sat
[2020-06-05 02:54:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:55:00] [INFO ] [Nat]Absence check using state equation in 10693 ms returned sat
[2020-06-05 02:55:00] [INFO ] [Nat]Added 101 Read/Feed constraints in 30 ms returned sat
[2020-06-05 02:55:00] [INFO ] Computed and/alt/rep : 1799/6972/1799 causal constraints in 115 ms.
[2020-06-05 02:55:21] [INFO ] Added : 585 causal constraints over 117 iterations in 20303 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 114 ms.
Incomplete Parikh walk after 201300 steps, including 928 resets, run finished after 2813 ms. (steps per millisecond=71 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 203000 steps, including 784 resets, run finished after 2667 ms. (steps per millisecond=76 ) properties seen :[0, 0] could not realise parikh vector
Support contains 25 out of 2501 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 73 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2020-06-05 02:55:26] [INFO ] Computed 1101 place invariants in 8 ms
[2020-06-05 02:55:40] [INFO ] Implicit Places using invariants in 13277 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13294 ms to find 1 implicit places.
[2020-06-05 02:55:41] [INFO ] Redundant transitions in 1581 ms returned []
// Phase 1: matrix 1800 rows 2500 cols
[2020-06-05 02:55:41] [INFO ] Computed 1100 place invariants in 10 ms
[2020-06-05 02:55:51] [INFO ] Dead Transitions using invariants and state equation in 9626 ms returned []
Starting structural reductions, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 196 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2020-06-05 02:55:51] [INFO ] Computed 1100 place invariants in 13 ms
[2020-06-05 02:55:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:55:59] [INFO ] Implicit Places using invariants in 7479 ms returned []
// Phase 1: matrix 1798 rows 2498 cols
[2020-06-05 02:55:59] [INFO ] Computed 1100 place invariants in 17 ms
[2020-06-05 02:55:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:56:06] [INFO ] Implicit Places using invariants and state equation in 7848 ms returned []
Implicit Place search using SMT with State Equation took 15333 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2498/2501 places, 1798/1800 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 14254 ms. (steps per millisecond=70 ) properties seen :[0, 0]
Interrupted Best-First random walk after 418032 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :[0, 0]
Interrupted Best-First random walk after 463780 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 1375062 steps, run timeout after 30002 ms. (steps per millisecond=45 ) properties seen :[0, 0]
Probabilistic random walk after 1375062 steps, saw 20444 distinct states, run finished after 30003 ms. (steps per millisecond=45 ) properties seen :[0, 0]
// Phase 1: matrix 1798 rows 2498 cols
[2020-06-05 02:57:01] [INFO ] Computed 1100 place invariants in 7 ms
[2020-06-05 02:57:02] [INFO ] [Real]Absence check using 1100 positive place invariants in 1225 ms returned sat
[2020-06-05 02:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:57:13] [INFO ] [Real]Absence check using state equation in 11046 ms returned sat
[2020-06-05 02:57:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:57:16] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1560 ms returned sat
[2020-06-05 02:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:57:27] [INFO ] [Nat]Absence check using state equation in 11376 ms returned sat
[2020-06-05 02:57:27] [INFO ] State equation strengthened by 101 read => feed constraints.
[2020-06-05 02:57:27] [INFO ] [Nat]Added 101 Read/Feed constraints in 70 ms returned sat
[2020-06-05 02:57:27] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2020-06-05 02:57:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2020-06-05 02:57:27] [INFO ] Computed and/alt/rep : 1797/6966/1797 causal constraints in 99 ms.
[2020-06-05 02:57:48] [INFO ] Added : 635 causal constraints over 127 iterations in 20215 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 105 ms.
[2020-06-05 02:57:49] [INFO ] [Real]Absence check using 1100 positive place invariants in 1263 ms returned sat
[2020-06-05 02:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:57:59] [INFO ] [Real]Absence check using state equation in 9693 ms returned sat
[2020-06-05 02:57:59] [INFO ] [Real]Added 101 Read/Feed constraints in 40 ms returned sat
[2020-06-05 02:58:00] [INFO ] Deduced a trap composed of 7 places in 216 ms
[2020-06-05 02:58:00] [INFO ] Deduced a trap composed of 7 places in 202 ms
[2020-06-05 02:58:00] [INFO ] Deduced a trap composed of 7 places in 178 ms
[2020-06-05 02:58:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 899 ms
[2020-06-05 02:58:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:58:02] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1407 ms returned sat
[2020-06-05 02:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:58:12] [INFO ] [Nat]Absence check using state equation in 9960 ms returned sat
[2020-06-05 02:58:12] [INFO ] [Nat]Added 101 Read/Feed constraints in 35 ms returned sat
[2020-06-05 02:58:12] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2020-06-05 02:58:12] [INFO ] Deduced a trap composed of 7 places in 146 ms
[2020-06-05 02:58:13] [INFO ] Deduced a trap composed of 7 places in 149 ms
[2020-06-05 02:58:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 750 ms
[2020-06-05 02:58:13] [INFO ] Computed and/alt/rep : 1797/6966/1797 causal constraints in 101 ms.
[2020-06-05 02:58:33] [INFO ] Added : 645 causal constraints over 129 iterations in 20174 ms.(timeout) Result :sat
[2020-06-05 02:58:33] [INFO ] Deduced a trap composed of 8 places in 129 ms
[2020-06-05 02:58:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
Attempting to minimize the solution found.
Minimization took 119 ms.
Incomplete Parikh walk after 232700 steps, including 1000 resets, run finished after 4486 ms. (steps per millisecond=51 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 208400 steps, including 991 resets, run finished after 3393 ms. (steps per millisecond=61 ) properties seen :[0, 0] could not realise parikh vector
Support contains 25 out of 2498 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2498/2498 places, 1798/1798 transitions.
Applied a total of 0 rules in 80 ms. Remains 2498 /2498 variables (removed 0) and now considering 1798/1798 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2498/2498 places, 1798/1798 transitions.
Starting structural reductions, iteration 0 : 2498/2498 places, 1798/1798 transitions.
Applied a total of 0 rules in 77 ms. Remains 2498 /2498 variables (removed 0) and now considering 1798/1798 (removed 0) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2020-06-05 02:58:42] [INFO ] Computed 1100 place invariants in 7 ms
[2020-06-05 02:58:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:58:49] [INFO ] Implicit Places using invariants in 7265 ms returned []
// Phase 1: matrix 1798 rows 2498 cols
[2020-06-05 02:58:49] [INFO ] Computed 1100 place invariants in 28 ms
[2020-06-05 02:58:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:58:56] [INFO ] Implicit Places using invariants and state equation in 7549 ms returned []
Implicit Place search using SMT with State Equation took 14819 ms to find 0 implicit places.
[2020-06-05 02:58:57] [INFO ] Redundant transitions in 621 ms returned []
// Phase 1: matrix 1798 rows 2498 cols
[2020-06-05 02:58:57] [INFO ] Computed 1100 place invariants in 9 ms
[2020-06-05 02:59:07] [INFO ] Dead Transitions using invariants and state equation in 9772 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2498/2498 places, 1798/1798 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1308 ms. (steps per millisecond=76 ) properties seen :[0, 0]
// Phase 1: matrix 1798 rows 2498 cols
[2020-06-05 02:59:08] [INFO ] Computed 1100 place invariants in 6 ms
[2020-06-05 02:59:10] [INFO ] [Real]Absence check using 1100 positive place invariants in 1186 ms returned sat
[2020-06-05 02:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:59:20] [INFO ] [Real]Absence check using state equation in 10122 ms returned sat
[2020-06-05 02:59:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:59:21] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1247 ms returned sat
[2020-06-05 02:59:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:59:31] [INFO ] [Nat]Absence check using state equation in 9443 ms returned sat
[2020-06-05 02:59:31] [INFO ] State equation strengthened by 101 read => feed constraints.
[2020-06-05 02:59:31] [INFO ] [Nat]Added 101 Read/Feed constraints in 34 ms returned sat
[2020-06-05 02:59:31] [INFO ] Deduced a trap composed of 6 places in 172 ms
[2020-06-05 02:59:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2020-06-05 02:59:31] [INFO ] Computed and/alt/rep : 1797/6966/1797 causal constraints in 158 ms.
[2020-06-05 02:59:40] [INFO ] Added : 340 causal constraints over 68 iterations in 8660 ms. Result :unknown
[2020-06-05 02:59:41] [INFO ] [Real]Absence check using 1100 positive place invariants in 1217 ms returned sat
[2020-06-05 02:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:59:51] [INFO ] [Real]Absence check using state equation in 9945 ms returned sat
[2020-06-05 02:59:51] [INFO ] [Real]Added 101 Read/Feed constraints in 39 ms returned sat
[2020-06-05 02:59:52] [INFO ] Deduced a trap composed of 7 places in 221 ms
[2020-06-05 02:59:52] [INFO ] Deduced a trap composed of 7 places in 232 ms
[2020-06-05 02:59:53] [INFO ] Deduced a trap composed of 7 places in 217 ms
[2020-06-05 02:59:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1070 ms
[2020-06-05 02:59:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:59:54] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1291 ms returned sat
[2020-06-05 02:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:00:05] [INFO ] [Nat]Absence check using state equation in 10619 ms returned sat
[2020-06-05 03:00:05] [INFO ] [Nat]Added 101 Read/Feed constraints in 36 ms returned sat
[2020-06-05 03:00:05] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2020-06-05 03:00:06] [INFO ] Deduced a trap composed of 7 places in 156 ms
[2020-06-05 03:00:06] [INFO ] Deduced a trap composed of 7 places in 157 ms
[2020-06-05 03:00:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 788 ms
[2020-06-05 03:00:06] [INFO ] Computed and/alt/rep : 1797/6966/1797 causal constraints in 118 ms.
[2020-06-05 03:00:13] [INFO ] Added : 220 causal constraints over 44 iterations in 6800 ms. Result :(error "Failed to check-sat")
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 7270 edges and 2498 vertex of which 2496 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 2496 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2494 transition count 1796
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 106 place count 2494 transition count 1796
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 205 place count 2494 transition count 1697
Applied a total of 205 rules in 692 ms. Remains 2494 /2498 variables (removed 4) and now considering 1697/1798 (removed 101) transitions.
// Phase 1: matrix 1697 rows 2494 cols
[2020-06-05 03:00:13] [INFO ] Computed 1098 place invariants in 12 ms
[2020-06-05 03:00:15] [INFO ] [Real]Absence check using 1098 positive place invariants in 1261 ms returned sat
[2020-06-05 03:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:00:24] [INFO ] [Real]Absence check using state equation in 9275 ms returned sat
[2020-06-05 03:00:25] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2020-06-05 03:00:25] [INFO ] Deduced a trap composed of 7 places in 214 ms
[2020-06-05 03:00:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 680 ms
[2020-06-05 03:00:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:00:27] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1303 ms returned sat
[2020-06-05 03:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:00:37] [INFO ] [Nat]Absence check using state equation in 9901 ms returned sat
[2020-06-05 03:00:37] [INFO ] Deduced a trap composed of 6 places in 228 ms
[2020-06-05 03:00:37] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2020-06-05 03:00:38] [INFO ] Deduced a trap composed of 6 places in 233 ms
[2020-06-05 03:00:38] [INFO ] Deduced a trap composed of 7 places in 225 ms
[2020-06-05 03:00:38] [INFO ] Deduced a trap composed of 6 places in 236 ms
[2020-06-05 03:00:39] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-06-05 03:00:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1980 ms
[2020-06-05 03:00:39] [INFO ] Computed and/alt/rep : 1696/6659/1696 causal constraints in 154 ms.
[2020-06-05 03:00:59] [INFO ] Added : 570 causal constraints over 114 iterations in 20199 ms.(timeout) Result :sat
[2020-06-05 03:00:59] [INFO ] Deduced a trap composed of 7 places in 184 ms
[2020-06-05 03:01:00] [INFO ] Deduced a trap composed of 7 places in 180 ms
[2020-06-05 03:01:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 757 ms
Attempting to minimize the solution found.
Minimization took 87 ms.
[2020-06-05 03:01:02] [INFO ] [Real]Absence check using 1098 positive place invariants in 1264 ms returned sat
[2020-06-05 03:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:01:11] [INFO ] [Real]Absence check using state equation in 9894 ms returned sat
[2020-06-05 03:01:12] [INFO ] Deduced a trap composed of 6 places in 175 ms
[2020-06-05 03:01:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2020-06-05 03:01:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:01:16] [INFO ] [Nat]Absence check using 1098 positive place invariants in 3428 ms returned sat
[2020-06-05 03:01:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:01:26] [INFO ] [Nat]Absence check using state equation in 10246 ms returned sat
[2020-06-05 03:01:26] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2020-06-05 03:01:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2020-06-05 03:01:26] [INFO ] Computed and/alt/rep : 1696/6659/1696 causal constraints in 105 ms.
[2020-06-05 03:01:46] [INFO ] Added : 710 causal constraints over 142 iterations in 20084 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 97 ms.
[2020-06-05 03:01:47] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2020-06-05 03:01:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 36 ms.
[2020-06-05 03:01:47] [INFO ] Flatten gal took : 399 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPt-PT-100A @ 3570 seconds

FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100A-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3537
rslt: Output for ReachabilityFireability @ ShieldPPPt-PT-100A

{
"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": "Fri Jun 5 03:01:48 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1768
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"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": 12,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p20) AND (1 <= p333) AND (1 <= p350) AND (1 <= p1995) AND (1 <= p1920) AND (1 <= p1935) AND ((p1612 <= 0) OR (p1614 <= 0)) AND ((p1318 <= 0) OR (p1325 <= 0)) AND ((p865 <= 0) OR (p899 <= 0)))))",
"processed_size": 209,
"rewrites": 1
},
"result":
{
"edges": 431,
"markings": 428,
"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": 72,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3537
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "A (G (((p1541 <= 0) OR (p1552 <= 0) OR (p543 <= 0) OR (p550 <= 0) OR (p1593 <= 0) OR (p1600 <= 0) OR (p722 <= 0) OR (p2331 <= 0) OR (p2346 <= 0) OR (p2482 <= 0) OR (p2495 <= 0) OR (p1161 <= 0) OR (p1171 <= 0))))",
"processed_size": 223,
"rewrites": 2
},
"result":
{
"edges": 370,
"markings": 368,
"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": 13,
"problems": 13
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 44212,
"runtime": 33.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 8278,
"conflict_clusters": 705,
"places": 2498,
"places_significant": 1398,
"singleton_clusters": 0,
"transitions": 1798
},
"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: 4296/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 79936
lola: finding significant places
lola: 2498 places, 1798 transitions, 1398 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: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p333 <= 1)
lola: LP says that atomic proposition is always true: (p350 <= 1)
lola: LP says that atomic proposition is always true: (p1995 <= 1)
lola: LP says that atomic proposition is always true: (p1920 <= 1)
lola: LP says that atomic proposition is always true: (p1935 <= 1)
lola: LP says that atomic proposition is always true: (p1612 <= 1)
lola: LP says that atomic proposition is always true: (p1614 <= 1)
lola: LP says that atomic proposition is always true: (p1318 <= 1)
lola: LP says that atomic proposition is always true: (p1325 <= 1)
lola: LP says that atomic proposition is always true: (p865 <= 1)
lola: LP says that atomic proposition is always true: (p899 <= 1)
lola: LP says that atomic proposition is always true: (p1541 <= 1)
lola: LP says that atomic proposition is always true: (p1552 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p550 <= 1)
lola: LP says that atomic proposition is always true: (p1593 <= 1)
lola: LP says that atomic proposition is always true: (p1600 <= 1)
lola: LP says that atomic proposition is always true: (p722 <= 1)
lola: LP says that atomic proposition is always true: (p2331 <= 1)
lola: LP says that atomic proposition is always true: (p2346 <= 1)
lola: LP says that atomic proposition is always true: (p2482 <= 1)
lola: LP says that atomic proposition is always true: (p2495 <= 1)
lola: LP says that atomic proposition is always true: (p1161 <= 1)
lola: LP says that atomic proposition is always true: (p1171 <= 1)
lola: E (F (((1 <= p20) AND (1 <= p333) AND (1 <= p350) AND (1 <= p1995) AND (1 <= p1920) AND (1 <= p1935) AND ((p1612 <= 0) OR (p1614 <= 0)) AND ((p1318 <= 0) OR (p1325 <= 0)) AND ((p865 <= 0) OR (p899 <= 0))))) : A (G (((p1541 <= 0) OR (p1552 <= 0) OR (p543 <= 0) OR (p550 <= 0) OR (p1593 <= 0) OR (p1600 <= 0) OR (p722 <= 0) OR (p2331 <= 0) OR (p2346 <= 0) OR (p2482 <= 0) OR (p2495 <= 0) OR (p1161 <= 0) OR (p1171 <= 0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p20) AND (1 <= p333) AND (1 <= p350) AND (1 <= p1995) AND (1 <= p1920) AND (1 <= p1935) AND ((p1612 <= 0) OR (p1614 <= 0)) AND ((p1318 <= 0) OR (p1325 <= 0)) AND ((p865 <= 0) OR (p899 <= 0)))))
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 <= p20) AND (1 <= p333) AND (1 <= p350) AND (1 <= p1995) AND (1 <= p1920) AND (1 <= p1935) AND ((p1612 <= 0) OR (p1614 <= 0)) AND ((p1318 <= 0) OR (p1325 <= 0)) AND ((p865 <= 0) OR (p899 <= 0)))))
lola: processed formula length: 209
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 <= p20) AND (1 <= p333) AND (1 <= p350) AND (1 <= p1995) AND (1 <= p1920) AND (1 <= p1935) AND ((p1612 <= 0) OR (p1614 <= 0)) AND ((p1318 <= 0) OR (p1325 <= 0)) AND ((p865 <= 0) OR (p899 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 428 markings, 431 edges
lola: subprocess 1 will run for 3537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1541 <= 0) OR (p1552 <= 0) OR (p543 <= 0) OR (p550 <= 0) OR (p1593 <= 0) OR (p1600 <= 0) OR (p722 <= 0) OR (p2331 <= 0) OR (p2346 <= 0) OR (p2482 <= 0) OR (p2495 <= 0) OR (p1161 <= 0) OR (p1171 <= 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 (((p1541 <= 0) OR (p1552 <= 0) OR (p543 <= 0) OR (p550 <= 0) OR (p1593 <= 0) OR (p1600 <= 0) OR (p722 <= 0) OR (p2331 <= 0) OR (p2346 <= 0) OR (p2482 <= 0) OR (p2495 <= 0) OR (p1161 <= 0) OR (p1171 <= 0))))
lola: processed formula length: 223
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: ========================================
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 <= p1541) AND (1 <= p1552) AND (1 <= p543) AND (1 <= p550) AND (1 <= p1593) AND (1 <= p1600) AND (1 <= p722) AND (1 <= p2331) AND (1 <= p2346) AND (1 <= p2482) AND (1 <= p2495) AND (1 <= p1161) AND (1 <= p1171))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 13 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 368 markings, 370 edges
lola: RESULT
lola:
SUMMARY: yes no
lola:
preliminary result: yes no
lola: ========================================
lola: memory consumption: 44212 KB
lola: time consumption: 33 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="ShieldPPPt-PT-100A"
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 ShieldPPPt-PT-100A, 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-159033477900735"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100A.tgz
mv ShieldPPPt-PT-100A 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 ;