Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r227-tall-162098231300416.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is ShieldPPPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231300416
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 166K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 12:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 18:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 762K May 5 16:52 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621184004958

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 16:53:26] [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]
[2021-05-16 16:53:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 16:53:26] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2021-05-16 16:53:26] [INFO ] Transformed 3123 places.
[2021-05-16 16:53:26] [INFO ] Transformed 2843 transitions.
[2021-05-16 16:53:26] [INFO ] Found NUPN structural information;
[2021-05-16 16:53:26] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 298 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 109 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 137 ms. (steps per millisecond=72 ) properties seen :[1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1]
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2843 rows 3123 cols
[2021-05-16 16:53:27] [INFO ] Computed 441 place invariants in 63 ms
[2021-05-16 16:53:28] [INFO ] [Real]Absence check using 441 positive place invariants in 712 ms returned sat
[2021-05-16 16:53:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:53:32] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:53:32] [INFO ] [Real]Absence check using state equation in 3735 ms returned (error "Failed to check-sat")
[2021-05-16 16:53:33] [INFO ] [Real]Absence check using 441 positive place invariants in 694 ms returned sat
[2021-05-16 16:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:53:37] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:53:37] [INFO ] [Real]Absence check using state equation in 3878 ms returned (error "Failed to check-sat")
[2021-05-16 16:53:38] [INFO ] [Real]Absence check using 441 positive place invariants in 672 ms returned sat
[2021-05-16 16:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:53:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:53:42] [INFO ] [Real]Absence check using state equation in 3884 ms returned (error "Failed to check-sat")
[2021-05-16 16:53:43] [INFO ] [Real]Absence check using 441 positive place invariants in 699 ms returned sat
[2021-05-16 16:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:53:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:53:47] [INFO ] [Real]Absence check using state equation in 3841 ms returned (error "Failed to check-sat")
[2021-05-16 16:53:48] [INFO ] [Real]Absence check using 441 positive place invariants in 704 ms returned sat
[2021-05-16 16:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:53:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:53:52] [INFO ] [Real]Absence check using state equation in 3842 ms returned (error "Failed to check-sat")
[2021-05-16 16:53:53] [INFO ] [Real]Absence check using 441 positive place invariants in 659 ms returned sat
[2021-05-16 16:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:53:57] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:53:57] [INFO ] [Real]Absence check using state equation in 3970 ms returned (error "Failed to check-sat")
[2021-05-16 16:53:58] [INFO ] [Real]Absence check using 441 positive place invariants in 708 ms returned sat
[2021-05-16 16:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:54:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:54:02] [INFO ] [Real]Absence check using state equation in 3892 ms returned (error "Failed to check-sat")
[2021-05-16 16:54:03] [INFO ] [Real]Absence check using 441 positive place invariants in 705 ms returned sat
[2021-05-16 16:54:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:54:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s891 (- t1717 t1718))") while checking expression at index 7
[2021-05-16 16:54:08] [INFO ] [Real]Absence check using 441 positive place invariants in 683 ms returned sat
[2021-05-16 16:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:54:12] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:54:12] [INFO ] [Real]Absence check using state equation in 3941 ms returned (error "Failed to check-sat")
Support contains 44 out of 3123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Performed 742 Post agglomeration using F-continuation condition.Transition count delta: 742
Iterating post reduction 0 with 742 rules applied. Total rules applied 742 place count 3123 transition count 2101
Reduce places removed 742 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 744 rules applied. Total rules applied 1486 place count 2381 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1487 place count 2380 transition count 2099
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 164 Pre rules applied. Total rules applied 1487 place count 2380 transition count 1935
Deduced a syphon composed of 164 places in 5 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 328 rules applied. Total rules applied 1815 place count 2216 transition count 1935
Symmetric choice reduction at 3 with 272 rule applications. Total rules 2087 place count 2216 transition count 1935
Deduced a syphon composed of 272 places in 15 ms
Reduce places removed 272 places and 272 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 2631 place count 1944 transition count 1663
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 2631 place count 1944 transition count 1551
Deduced a syphon composed of 112 places in 10 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 2855 place count 1832 transition count 1551
Performed 665 Post agglomeration using F-continuation condition.Transition count delta: 665
Deduced a syphon composed of 665 places in 2 ms
Reduce places removed 665 places and 0 transitions.
Iterating global reduction 3 with 1330 rules applied. Total rules applied 4185 place count 1167 transition count 886
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4387 place count 1066 transition count 886
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 4407 place count 1056 transition count 886
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4409 place count 1056 transition count 884
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4411 place count 1054 transition count 884
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 4 with 117 rules applied. Total rules applied 4528 place count 1054 transition count 884
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4529 place count 1053 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4530 place count 1052 transition count 883
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4530 place count 1052 transition count 881
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4534 place count 1050 transition count 881
Applied a total of 4534 rules in 1226 ms. Remains 1050 /3123 variables (removed 2073) and now considering 881/2843 (removed 1962) transitions.
Finished structural reductions, in 1 iterations. Remains : 1050/3123 places, 881/2843 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 9059 ms. (steps per millisecond=110 ) properties seen :[0, 1, 1, 0, 1, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 930633 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 924142 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=184 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 948353 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 955843 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 935743 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=187 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 907304 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 881 rows 1050 cols
[2021-05-16 16:54:52] [INFO ] Computed 440 place invariants in 4 ms
[2021-05-16 16:54:53] [INFO ] [Real]Absence check using 440 positive place invariants in 238 ms returned sat
[2021-05-16 16:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:54:55] [INFO ] [Real]Absence check using state equation in 1969 ms returned sat
[2021-05-16 16:54:55] [INFO ] State equation strengthened by 214 read => feed constraints.
[2021-05-16 16:54:55] [INFO ] [Real]Added 214 Read/Feed constraints in 63 ms returned sat
[2021-05-16 16:54:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:54:56] [INFO ] [Nat]Absence check using 440 positive place invariants in 319 ms returned sat
[2021-05-16 16:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:54:57] [INFO ] [Nat]Absence check using state equation in 1983 ms returned sat
[2021-05-16 16:54:58] [INFO ] [Nat]Added 214 Read/Feed constraints in 43 ms returned sat
[2021-05-16 16:54:58] [INFO ] Computed and/alt/rep : 875/3411/875 causal constraints in 59 ms.
[2021-05-16 16:55:15] [INFO ] Added : 867 causal constraints over 175 iterations in 17628 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 92 ms.
[2021-05-16 16:55:16] [INFO ] [Real]Absence check using 440 positive place invariants in 270 ms returned sat
[2021-05-16 16:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:55:18] [INFO ] [Real]Absence check using state equation in 1995 ms returned sat
[2021-05-16 16:55:18] [INFO ] [Real]Added 214 Read/Feed constraints in 31 ms returned sat
[2021-05-16 16:55:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:55:18] [INFO ] [Nat]Absence check using 440 positive place invariants in 255 ms returned sat
[2021-05-16 16:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:55:20] [INFO ] [Nat]Absence check using state equation in 2012 ms returned sat
[2021-05-16 16:55:21] [INFO ] [Nat]Added 214 Read/Feed constraints in 73 ms returned sat
[2021-05-16 16:55:21] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-16 16:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2021-05-16 16:55:21] [INFO ] Computed and/alt/rep : 875/3411/875 causal constraints in 49 ms.
[2021-05-16 16:55:40] [INFO ] Added : 870 causal constraints over 174 iterations in 18878 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 92 ms.
[2021-05-16 16:55:40] [INFO ] [Real]Absence check using 440 positive place invariants in 245 ms returned sat
[2021-05-16 16:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:55:42] [INFO ] [Real]Absence check using state equation in 1975 ms returned sat
[2021-05-16 16:55:42] [INFO ] [Real]Added 214 Read/Feed constraints in 28 ms returned sat
[2021-05-16 16:55:42] [INFO ] Deduced a trap composed of 6 places in 130 ms
[2021-05-16 16:55:42] [INFO ] Deduced a trap composed of 3 places in 92 ms
[2021-05-16 16:55:43] [INFO ] Deduced a trap composed of 7 places in 82 ms
[2021-05-16 16:55:43] [INFO ] Deduced a trap composed of 5 places in 79 ms
[2021-05-16 16:55:43] [INFO ] Deduced a trap composed of 7 places in 80 ms
[2021-05-16 16:55:43] [INFO ] Deduced a trap composed of 5 places in 93 ms
[2021-05-16 16:55:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 801 ms
[2021-05-16 16:55:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:55:43] [INFO ] [Nat]Absence check using 440 positive place invariants in 243 ms returned sat
[2021-05-16 16:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:55:45] [INFO ] [Nat]Absence check using state equation in 1990 ms returned sat
[2021-05-16 16:55:45] [INFO ] [Nat]Added 214 Read/Feed constraints in 56 ms returned sat
[2021-05-16 16:55:46] [INFO ] Deduced a trap composed of 7 places in 32 ms
[2021-05-16 16:55:46] [INFO ] Deduced a trap composed of 6 places in 22 ms
[2021-05-16 16:55:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2021-05-16 16:55:46] [INFO ] Computed and/alt/rep : 875/3411/875 causal constraints in 51 ms.
[2021-05-16 16:56:03] [INFO ] Added : 873 causal constraints over 176 iterations in 17013 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 88 ms.
[2021-05-16 16:56:03] [INFO ] [Real]Absence check using 440 positive place invariants in 241 ms returned sat
[2021-05-16 16:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:56:05] [INFO ] [Real]Absence check using state equation in 1978 ms returned sat
[2021-05-16 16:56:05] [INFO ] [Real]Added 214 Read/Feed constraints in 27 ms returned sat
[2021-05-16 16:56:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:56:06] [INFO ] [Nat]Absence check using 440 positive place invariants in 241 ms returned sat
[2021-05-16 16:56:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:56:08] [INFO ] [Nat]Absence check using state equation in 2040 ms returned sat
[2021-05-16 16:56:08] [INFO ] [Nat]Added 214 Read/Feed constraints in 137 ms returned sat
[2021-05-16 16:56:08] [INFO ] Computed and/alt/rep : 875/3411/875 causal constraints in 51 ms.
[2021-05-16 16:56:28] [INFO ] Added : 872 causal constraints over 176 iterations in 19720 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 68 ms.
[2021-05-16 16:56:28] [INFO ] [Real]Absence check using 440 positive place invariants in 240 ms returned sat
[2021-05-16 16:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:56:30] [INFO ] [Real]Absence check using state equation in 2044 ms returned sat
[2021-05-16 16:56:30] [INFO ] [Real]Added 214 Read/Feed constraints in 29 ms returned sat
[2021-05-16 16:56:30] [INFO ] Deduced a trap composed of 5 places in 103 ms
[2021-05-16 16:56:30] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2021-05-16 16:56:31] [INFO ] Deduced a trap composed of 5 places in 183 ms
[2021-05-16 16:56:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 534 ms
[2021-05-16 16:56:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:56:31] [INFO ] [Nat]Absence check using 440 positive place invariants in 242 ms returned sat
[2021-05-16 16:56:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:56:33] [INFO ] [Nat]Absence check using state equation in 2055 ms returned sat
[2021-05-16 16:56:33] [INFO ] [Nat]Added 214 Read/Feed constraints in 82 ms returned sat
[2021-05-16 16:56:33] [INFO ] Deduced a trap composed of 6 places in 43 ms
[2021-05-16 16:56:33] [INFO ] Deduced a trap composed of 6 places in 54 ms
[2021-05-16 16:56:33] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2021-05-16 16:56:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2021-05-16 16:56:34] [INFO ] Computed and/alt/rep : 875/3411/875 causal constraints in 54 ms.
[2021-05-16 16:56:50] [INFO ] Added : 864 causal constraints over 174 iterations in 16430 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 120 ms.
[2021-05-16 16:56:51] [INFO ] [Real]Absence check using 440 positive place invariants in 244 ms returned sat
[2021-05-16 16:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:56:53] [INFO ] [Real]Absence check using state equation in 2003 ms returned sat
[2021-05-16 16:56:53] [INFO ] [Real]Added 214 Read/Feed constraints in 36 ms returned sat
[2021-05-16 16:56:53] [INFO ] Deduced a trap composed of 4 places in 105 ms
[2021-05-16 16:56:53] [INFO ] Deduced a trap composed of 5 places in 89 ms
[2021-05-16 16:56:53] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2021-05-16 16:56:53] [INFO ] Deduced a trap composed of 7 places in 97 ms
[2021-05-16 16:56:53] [INFO ] Deduced a trap composed of 5 places in 97 ms
[2021-05-16 16:56:53] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2021-05-16 16:56:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 826 ms
[2021-05-16 16:56:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:56:54] [INFO ] [Nat]Absence check using 440 positive place invariants in 254 ms returned sat
[2021-05-16 16:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:56:56] [INFO ] [Nat]Absence check using state equation in 2126 ms returned sat
[2021-05-16 16:56:56] [INFO ] [Nat]Added 214 Read/Feed constraints in 68 ms returned sat
[2021-05-16 16:56:56] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2021-05-16 16:56:56] [INFO ] Deduced a trap composed of 6 places in 22 ms
[2021-05-16 16:56:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2021-05-16 16:56:56] [INFO ] Computed and/alt/rep : 875/3411/875 causal constraints in 53 ms.
[2021-05-16 16:57:09] [INFO ] Added : 837 causal constraints over 168 iterations in 12889 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 78 ms.
Incomplete Parikh walk after 115100 steps, including 425 resets, run finished after 1070 ms. (steps per millisecond=107 ) properties seen :[1, 0, 1, 0, 1, 0] could not realise parikh vector
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 180500 steps, including 361 resets, run finished after 1501 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 138100 steps, including 462 resets, run finished after 1114 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 155500 steps, including 469 resets, run finished after 1314 ms. (steps per millisecond=118 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 126100 steps, including 255 resets, run finished after 1047 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 114000 steps, including 414 resets, run finished after 977 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 21 out of 1050 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1050/1050 places, 881/881 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1050 transition count 876
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1045 transition count 876
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 1045 transition count 871
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 1040 transition count 871
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 1040 transition count 871
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 1039 transition count 870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 1039 transition count 869
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 1038 transition count 869
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 1027 transition count 858
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 1023 transition count 858
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 1023 transition count 858
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1023 transition count 858
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 1022 transition count 857
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1021 transition count 856
Applied a total of 62 rules in 235 ms. Remains 1021 /1050 variables (removed 29) and now considering 856/881 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 1021/1050 places, 856/881 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 8185 ms. (steps per millisecond=122 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 958312 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 952666 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=190 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 889774 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 2073385 steps, run timeout after 30001 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0]
Probabilistic random walk after 2073385 steps, saw 301761 distinct states, run finished after 30001 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0]
// Phase 1: matrix 856 rows 1021 cols
[2021-05-16 16:58:10] [INFO ] Computed 440 place invariants in 11 ms
[2021-05-16 16:58:10] [INFO ] [Real]Absence check using 440 positive place invariants in 240 ms returned sat
[2021-05-16 16:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:58:12] [INFO ] [Real]Absence check using state equation in 1930 ms returned sat
[2021-05-16 16:58:12] [INFO ] State equation strengthened by 226 read => feed constraints.
[2021-05-16 16:58:12] [INFO ] [Real]Added 226 Read/Feed constraints in 58 ms returned sat
[2021-05-16 16:58:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:58:13] [INFO ] [Nat]Absence check using 440 positive place invariants in 241 ms returned sat
[2021-05-16 16:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:58:14] [INFO ] [Nat]Absence check using state equation in 1913 ms returned sat
[2021-05-16 16:58:15] [INFO ] [Nat]Added 226 Read/Feed constraints in 47 ms returned sat
[2021-05-16 16:58:15] [INFO ] Computed and/alt/rep : 852/3430/852 causal constraints in 48 ms.
[2021-05-16 16:58:29] [INFO ] Added : 841 causal constraints over 169 iterations in 14136 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 67 ms.
[2021-05-16 16:58:29] [INFO ] [Real]Absence check using 440 positive place invariants in 268 ms returned sat
[2021-05-16 16:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:58:31] [INFO ] [Real]Absence check using state equation in 1870 ms returned sat
[2021-05-16 16:58:31] [INFO ] [Real]Added 226 Read/Feed constraints in 28 ms returned sat
[2021-05-16 16:58:31] [INFO ] Computed and/alt/rep : 852/3430/852 causal constraints in 69 ms.
[2021-05-16 16:58:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:58:32] [INFO ] [Nat]Absence check using 440 positive place invariants in 235 ms returned sat
[2021-05-16 16:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:58:34] [INFO ] [Nat]Absence check using state equation in 1873 ms returned sat
[2021-05-16 16:58:34] [INFO ] [Nat]Added 226 Read/Feed constraints in 55 ms returned sat
[2021-05-16 16:58:34] [INFO ] Computed and/alt/rep : 852/3430/852 causal constraints in 49 ms.
[2021-05-16 16:58:49] [INFO ] Added : 835 causal constraints over 169 iterations in 14900 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 88 ms.
[2021-05-16 16:58:49] [INFO ] [Real]Absence check using 440 positive place invariants in 239 ms returned sat
[2021-05-16 16:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:58:51] [INFO ] [Real]Absence check using state equation in 1914 ms returned sat
[2021-05-16 16:58:51] [INFO ] [Real]Added 226 Read/Feed constraints in 31 ms returned sat
[2021-05-16 16:58:51] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2021-05-16 16:58:51] [INFO ] Deduced a trap composed of 7 places in 82 ms
[2021-05-16 16:58:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2021-05-16 16:58:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:58:52] [INFO ] [Nat]Absence check using 440 positive place invariants in 243 ms returned sat
[2021-05-16 16:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:58:54] [INFO ] [Nat]Absence check using state equation in 1915 ms returned sat
[2021-05-16 16:58:54] [INFO ] [Nat]Added 226 Read/Feed constraints in 55 ms returned sat
[2021-05-16 16:58:54] [INFO ] Computed and/alt/rep : 852/3430/852 causal constraints in 52 ms.
[2021-05-16 16:59:13] [INFO ] Added : 845 causal constraints over 172 iterations in 19198 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 74 ms.
Incomplete Parikh walk after 135800 steps, including 691 resets, run finished after 1188 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 138100 steps, including 451 resets, run finished after 1271 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 132500 steps, including 440 resets, run finished after 1197 ms. (steps per millisecond=110 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 15 out of 1021 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1021/1021 places, 856/856 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 1021 transition count 855
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1020 transition count 855
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 1018 transition count 853
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 1018 transition count 853
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1017 transition count 852
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 1016 transition count 851
Applied a total of 9 rules in 139 ms. Remains 1016 /1021 variables (removed 5) and now considering 851/856 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 1016/1021 places, 851/856 transitions.
Incomplete random walk after 1000000 steps, including 1 resets, run finished after 8221 ms. (steps per millisecond=121 ) properties seen :[0, 0]
Interrupted Best-First random walk after 907698 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen :[0, 0]
Interrupted Best-First random walk after 925441 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 2190524 steps, run timeout after 30001 ms. (steps per millisecond=73 ) properties seen :[0, 0]
Probabilistic random walk after 2190524 steps, saw 289363 distinct states, run finished after 30001 ms. (steps per millisecond=73 ) properties seen :[0, 0]
// Phase 1: matrix 851 rows 1016 cols
[2021-05-16 17:00:05] [INFO ] Computed 440 place invariants in 3 ms
[2021-05-16 17:00:06] [INFO ] [Real]Absence check using 440 positive place invariants in 237 ms returned sat
[2021-05-16 17:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 17:00:07] [INFO ] [Real]Absence check using state equation in 1910 ms returned sat
[2021-05-16 17:00:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-16 17:00:08] [INFO ] [Real]Added 6 Read/Feed constraints in 11 ms returned sat
[2021-05-16 17:00:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 17:00:08] [INFO ] [Nat]Absence check using 440 positive place invariants in 228 ms returned sat
[2021-05-16 17:00:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 17:00:10] [INFO ] [Nat]Absence check using state equation in 1935 ms returned sat
[2021-05-16 17:00:10] [INFO ] [Nat]Added 6 Read/Feed constraints in 9 ms returned sat
[2021-05-16 17:00:10] [INFO ] Deduced a trap composed of 6 places in 147 ms
[2021-05-16 17:00:10] [INFO ] Deduced a trap composed of 7 places in 160 ms
[2021-05-16 17:00:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2021-05-16 17:00:10] [INFO ] Computed and/alt/rep : 844/1996/844 causal constraints in 40 ms.
[2021-05-16 17:00:20] [INFO ] Added : 810 causal constraints over 163 iterations in 10154 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
[2021-05-16 17:00:21] [INFO ] [Real]Absence check using 440 positive place invariants in 229 ms returned sat
[2021-05-16 17:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 17:00:23] [INFO ] [Real]Absence check using state equation in 1944 ms returned sat
[2021-05-16 17:00:23] [INFO ] [Real]Added 6 Read/Feed constraints in 10 ms returned sat
[2021-05-16 17:00:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 17:00:23] [INFO ] [Nat]Absence check using 440 positive place invariants in 227 ms returned sat
[2021-05-16 17:00:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 17:00:25] [INFO ] [Nat]Absence check using state equation in 1894 ms returned sat
[2021-05-16 17:00:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2021-05-16 17:00:25] [INFO ] Deduced a trap composed of 4 places in 155 ms
[2021-05-16 17:00:25] [INFO ] Deduced a trap composed of 7 places in 145 ms
[2021-05-16 17:00:26] [INFO ] Deduced a trap composed of 5 places in 146 ms
[2021-05-16 17:00:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 555 ms
[2021-05-16 17:00:26] [INFO ] Computed and/alt/rep : 844/1996/844 causal constraints in 47 ms.
[2021-05-16 17:00:37] [INFO ] Added : 821 causal constraints over 166 iterations in 11394 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 62 ms.
Incomplete Parikh walk after 135700 steps, including 477 resets, run finished after 1236 ms. (steps per millisecond=109 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 111700 steps, including 438 resets, run finished after 1009 ms. (steps per millisecond=110 ) properties seen :[0, 0] could not realise parikh vector
Support contains 15 out of 1016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1016/1016 places, 851/851 transitions.
Applied a total of 0 rules in 19 ms. Remains 1016 /1016 variables (removed 0) and now considering 851/851 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1016/1016 places, 851/851 transitions.
Starting structural reductions, iteration 0 : 1016/1016 places, 851/851 transitions.
Applied a total of 0 rules in 18 ms. Remains 1016 /1016 variables (removed 0) and now considering 851/851 (removed 0) transitions.
// Phase 1: matrix 851 rows 1016 cols
[2021-05-16 17:00:39] [INFO ] Computed 440 place invariants in 3 ms
[2021-05-16 17:00:42] [INFO ] Implicit Places using invariants in 2552 ms returned [999, 1003]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2563 ms to find 2 implicit places.
[2021-05-16 17:00:42] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 851 rows 1014 cols
[2021-05-16 17:00:42] [INFO ] Computed 438 place invariants in 2 ms
[2021-05-16 17:00:44] [INFO ] Dead Transitions using invariants and state equation in 2058 ms returned []
Starting structural reductions, iteration 1 : 1014/1016 places, 851/851 transitions.
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1014 transition count 851
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 1012 transition count 849
Applied a total of 6 rules in 38 ms. Remains 1012 /1014 variables (removed 2) and now considering 849/851 (removed 2) transitions.
// Phase 1: matrix 849 rows 1012 cols
[2021-05-16 17:00:44] [INFO ] Computed 438 place invariants in 3 ms
[2021-05-16 17:00:47] [INFO ] Implicit Places using invariants in 2631 ms returned []
// Phase 1: matrix 849 rows 1012 cols
[2021-05-16 17:00:47] [INFO ] Computed 438 place invariants in 4 ms
[2021-05-16 17:00:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-16 17:00:57] [INFO ] Implicit Places using invariants and state equation in 10538 ms returned []
Implicit Place search using SMT with State Equation took 13171 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1012/1016 places, 849/851 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 8677 ms. (steps per millisecond=115 ) properties seen :[0, 0]
Interrupted Best-First random walk after 894164 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen :[0, 0]
Interrupted Best-First random walk after 905050 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=180 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 2170559 steps, run timeout after 30001 ms. (steps per millisecond=72 ) properties seen :[0, 0]
Probabilistic random walk after 2170559 steps, saw 300326 distinct states, run finished after 30001 ms. (steps per millisecond=72 ) properties seen :[0, 0]
// Phase 1: matrix 849 rows 1012 cols
[2021-05-16 17:01:46] [INFO ] Computed 438 place invariants in 3 ms
[2021-05-16 17:01:46] [INFO ] [Real]Absence check using 438 positive place invariants in 228 ms returned sat
[2021-05-16 17:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 17:01:48] [INFO ] [Real]Absence check using state equation in 1880 ms returned sat
[2021-05-16 17:01:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-16 17:01:48] [INFO ] [Real]Added 4 Read/Feed constraints in 10 ms returned sat
[2021-05-16 17:01:49] [INFO ] Deduced a trap composed of 5 places in 189 ms
[2021-05-16 17:01:49] [INFO ] Deduced a trap composed of 7 places in 172 ms
[2021-05-16 17:01:49] [INFO ] Deduced a trap composed of 6 places in 177 ms
[2021-05-16 17:01:49] [INFO ] Deduced a trap composed of 5 places in 174 ms
[2021-05-16 17:01:49] [INFO ] Deduced a trap composed of 5 places in 153 ms
[2021-05-16 17:01:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1070 ms
[2021-05-16 17:01:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 17:01:50] [INFO ] [Nat]Absence check using 438 positive place invariants in 231 ms returned sat
[2021-05-16 17:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 17:01:52] [INFO ] [Nat]Absence check using state equation in 1969 ms returned sat
[2021-05-16 17:01:52] [INFO ] [Nat]Added 4 Read/Feed constraints in 8 ms returned sat
[2021-05-16 17:01:52] [INFO ] Deduced a trap composed of 5 places in 186 ms
[2021-05-16 17:01:52] [INFO ] Deduced a trap composed of 5 places in 165 ms
[2021-05-16 17:01:52] [INFO ] Deduced a trap composed of 7 places in 151 ms
[2021-05-16 17:01:53] [INFO ] Deduced a trap composed of 5 places in 160 ms
[2021-05-16 17:01:53] [INFO ] Deduced a trap composed of 5 places in 148 ms
[2021-05-16 17:01:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1020 ms
[2021-05-16 17:01:53] [INFO ] Computed and/alt/rep : 842/1979/842 causal constraints in 41 ms.
[2021-05-16 17:02:03] [INFO ] Added : 818 causal constraints over 165 iterations in 10695 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
[2021-05-16 17:02:04] [INFO ] [Real]Absence check using 438 positive place invariants in 232 ms returned sat
[2021-05-16 17:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 17:02:06] [INFO ] [Real]Absence check using state equation in 1898 ms returned sat
[2021-05-16 17:02:06] [INFO ] [Real]Added 4 Read/Feed constraints in 11 ms returned sat
[2021-05-16 17:02:06] [INFO ] Deduced a trap composed of 6 places in 159 ms
[2021-05-16 17:02:06] [INFO ] Deduced a trap composed of 5 places in 165 ms
[2021-05-16 17:02:07] [INFO ] Deduced a trap composed of 5 places in 166 ms
[2021-05-16 17:02:07] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2021-05-16 17:02:07] [INFO ] Deduced a trap composed of 7 places in 161 ms
[2021-05-16 17:02:07] [INFO ] Deduced a trap composed of 9 places in 156 ms
[2021-05-16 17:02:07] [INFO ] Deduced a trap composed of 4 places in 151 ms
[2021-05-16 17:02:07] [INFO ] Deduced a trap composed of 6 places in 145 ms
[2021-05-16 17:02:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1553 ms
[2021-05-16 17:02:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 17:02:08] [INFO ] [Nat]Absence check using 438 positive place invariants in 230 ms returned sat
[2021-05-16 17:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 17:02:10] [INFO ] [Nat]Absence check using state equation in 1918 ms returned sat
[2021-05-16 17:02:10] [INFO ] [Nat]Added 4 Read/Feed constraints in 8 ms returned sat
[2021-05-16 17:02:10] [INFO ] Deduced a trap composed of 5 places in 150 ms
[2021-05-16 17:02:10] [INFO ] Deduced a trap composed of 5 places in 150 ms
[2021-05-16 17:02:10] [INFO ] Deduced a trap composed of 7 places in 150 ms
[2021-05-16 17:02:11] [INFO ] Deduced a trap composed of 8 places in 147 ms
[2021-05-16 17:02:11] [INFO ] Deduced a trap composed of 9 places in 153 ms
[2021-05-16 17:02:11] [INFO ] Deduced a trap composed of 5 places in 138 ms
[2021-05-16 17:02:11] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2021-05-16 17:02:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1280 ms
[2021-05-16 17:02:11] [INFO ] Computed and/alt/rep : 842/1979/842 causal constraints in 48 ms.
[2021-05-16 17:02:21] [INFO ] Added : 800 causal constraints over 161 iterations in 9705 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 48 ms.
Incomplete Parikh walk after 124700 steps, including 222 resets, run finished after 1170 ms. (steps per millisecond=106 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 150900 steps, including 1000 resets, run finished after 1140 ms. (steps per millisecond=132 ) properties seen :[0, 0] could not realise parikh vector
Support contains 15 out of 1012 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1012/1012 places, 849/849 transitions.
Applied a total of 0 rules in 18 ms. Remains 1012 /1012 variables (removed 0) and now considering 849/849 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 849/849 transitions.
Starting structural reductions, iteration 0 : 1012/1012 places, 849/849 transitions.
Applied a total of 0 rules in 20 ms. Remains 1012 /1012 variables (removed 0) and now considering 849/849 (removed 0) transitions.
// Phase 1: matrix 849 rows 1012 cols
[2021-05-16 17:02:23] [INFO ] Computed 438 place invariants in 3 ms
[2021-05-16 17:02:26] [INFO ] Implicit Places using invariants in 2524 ms returned []
// Phase 1: matrix 849 rows 1012 cols
[2021-05-16 17:02:26] [INFO ] Computed 438 place invariants in 3 ms
[2021-05-16 17:02:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-16 17:02:36] [INFO ] Implicit Places using invariants and state equation in 10131 ms returned []
Implicit Place search using SMT with State Equation took 12657 ms to find 0 implicit places.
[2021-05-16 17:02:36] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 849 rows 1012 cols
[2021-05-16 17:02:36] [INFO ] Computed 438 place invariants in 3 ms
[2021-05-16 17:02:38] [INFO ] Dead Transitions using invariants and state equation in 2008 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 849/849 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 835 ms. (steps per millisecond=119 ) properties seen :[0, 0]
// Phase 1: matrix 849 rows 1012 cols
[2021-05-16 17:02:39] [INFO ] Computed 438 place invariants in 2 ms
[2021-05-16 17:02:39] [INFO ] [Real]Absence check using 438 positive place invariants in 233 ms returned sat
[2021-05-16 17:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 17:02:41] [INFO ] [Real]Absence check using state equation in 1911 ms returned sat
[2021-05-16 17:02:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-16 17:02:41] [INFO ] [Real]Added 4 Read/Feed constraints in 9 ms returned sat
[2021-05-16 17:02:41] [INFO ] Deduced a trap composed of 5 places in 186 ms
[2021-05-16 17:02:42] [INFO ] Deduced a trap composed of 7 places in 186 ms
[2021-05-16 17:02:42] [INFO ] Deduced a trap composed of 6 places in 188 ms
[2021-05-16 17:02:42] [INFO ] Deduced a trap composed of 5 places in 187 ms
[2021-05-16 17:02:42] [INFO ] Deduced a trap composed of 5 places in 174 ms
[2021-05-16 17:02:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1100 ms
[2021-05-16 17:02:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 17:02:43] [INFO ] [Nat]Absence check using 438 positive place invariants in 234 ms returned sat
[2021-05-16 17:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 17:02:45] [INFO ] [Nat]Absence check using state equation in 1911 ms returned sat
[2021-05-16 17:02:45] [INFO ] [Nat]Added 4 Read/Feed constraints in 9 ms returned sat
[2021-05-16 17:02:45] [INFO ] Deduced a trap composed of 5 places in 172 ms
[2021-05-16 17:02:45] [INFO ] Deduced a trap composed of 5 places in 164 ms
[2021-05-16 17:02:45] [INFO ] Deduced a trap composed of 7 places in 162 ms
[2021-05-16 17:02:45] [INFO ] Deduced a trap composed of 5 places in 160 ms
[2021-05-16 17:02:46] [INFO ] Deduced a trap composed of 5 places in 156 ms
[2021-05-16 17:02:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 981 ms
[2021-05-16 17:02:46] [INFO ] Computed and/alt/rep : 842/1979/842 causal constraints in 49 ms.
[2021-05-16 17:02:57] [INFO ] Added : 818 causal constraints over 165 iterations in 11037 ms. Result :sat
[2021-05-16 17:02:57] [INFO ] [Real]Absence check using 438 positive place invariants in 230 ms returned sat
[2021-05-16 17:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 17:02:59] [INFO ] [Real]Absence check using state equation in 1862 ms returned sat
[2021-05-16 17:02:59] [INFO ] [Real]Added 4 Read/Feed constraints in 8 ms returned sat
[2021-05-16 17:02:59] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2021-05-16 17:02:59] [INFO ] Deduced a trap composed of 5 places in 165 ms
[2021-05-16 17:02:59] [INFO ] Deduced a trap composed of 5 places in 164 ms
[2021-05-16 17:03:00] [INFO ] Deduced a trap composed of 4 places in 148 ms
[2021-05-16 17:03:00] [INFO ] Deduced a trap composed of 7 places in 151 ms
[2021-05-16 17:03:00] [INFO ] Deduced a trap composed of 9 places in 149 ms
[2021-05-16 17:03:00] [INFO ] Deduced a trap composed of 4 places in 142 ms
[2021-05-16 17:03:00] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2021-05-16 17:03:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1503 ms
[2021-05-16 17:03:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 17:03:01] [INFO ] [Nat]Absence check using 438 positive place invariants in 232 ms returned sat
[2021-05-16 17:03:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 17:03:03] [INFO ] [Nat]Absence check using state equation in 1856 ms returned sat
[2021-05-16 17:03:03] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2021-05-16 17:03:03] [INFO ] Deduced a trap composed of 5 places in 143 ms
[2021-05-16 17:03:03] [INFO ] Deduced a trap composed of 5 places in 148 ms
[2021-05-16 17:03:03] [INFO ] Deduced a trap composed of 7 places in 147 ms
[2021-05-16 17:03:03] [INFO ] Deduced a trap composed of 8 places in 146 ms
[2021-05-16 17:03:04] [INFO ] Deduced a trap composed of 9 places in 143 ms
[2021-05-16 17:03:04] [INFO ] Deduced a trap composed of 5 places in 140 ms
[2021-05-16 17:03:04] [INFO ] Deduced a trap composed of 4 places in 141 ms
[2021-05-16 17:03:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1239 ms
[2021-05-16 17:03:04] [INFO ] Computed and/alt/rep : 842/1979/842 causal constraints in 48 ms.
[2021-05-16 17:03:13] [INFO ] Added : 800 causal constraints over 161 iterations in 9548 ms. Result :sat
Partial Free-agglomeration rule applied 226 times.
Drop transitions removed 226 transitions
Iterating global reduction 0 with 226 rules applied. Total rules applied 226 place count 1012 transition count 849
Partial Post-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 265 place count 1012 transition count 849
Applied a total of 265 rules in 56 ms. Remains 1012 /1012 variables (removed 0) and now considering 849/849 (removed 0) transitions.
// Phase 1: matrix 849 rows 1012 cols
[2021-05-16 17:03:14] [INFO ] Computed 438 place invariants in 2 ms
[2021-05-16 17:03:14] [INFO ] [Real]Absence check using 438 positive place invariants in 229 ms returned sat
[2021-05-16 17:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 17:03:16] [INFO ] [Real]Absence check using state equation in 1804 ms returned sat
[2021-05-16 17:03:16] [INFO ] State equation strengthened by 221 read => feed constraints.
[2021-05-16 17:03:16] [INFO ] [Real]Added 221 Read/Feed constraints in 46 ms returned sat
[2021-05-16 17:03:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 17:03:16] [INFO ] [Nat]Absence check using 438 positive place invariants in 234 ms returned sat
[2021-05-16 17:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 17:03:18] [INFO ] [Nat]Absence check using state equation in 1946 ms returned sat
[2021-05-16 17:03:18] [INFO ] [Nat]Added 221 Read/Feed constraints in 43 ms returned sat
[2021-05-16 17:03:18] [INFO ] Computed and/alt/rep : 844/2813/844 causal constraints in 44 ms.
[2021-05-16 17:03:31] [INFO ] Added : 806 causal constraints over 162 iterations in 13268 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 47 ms.
[2021-05-16 17:03:32] [INFO ] [Real]Absence check using 438 positive place invariants in 230 ms returned sat
[2021-05-16 17:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 17:03:34] [INFO ] [Real]Absence check using state equation in 1827 ms returned sat
[2021-05-16 17:03:34] [INFO ] [Real]Added 221 Read/Feed constraints in 43 ms returned sat
[2021-05-16 17:03:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 17:03:34] [INFO ] [Nat]Absence check using 438 positive place invariants in 233 ms returned sat
[2021-05-16 17:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 17:03:36] [INFO ] [Nat]Absence check using state equation in 1956 ms returned sat
[2021-05-16 17:03:36] [INFO ] [Nat]Added 221 Read/Feed constraints in 43 ms returned sat
[2021-05-16 17:03:36] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-16 17:03:36] [INFO ] Deduced a trap composed of 8 places in 9 ms
[2021-05-16 17:03:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2021-05-16 17:03:36] [INFO ] Computed and/alt/rep : 844/2813/844 causal constraints in 44 ms.
[2021-05-16 17:03:48] [INFO ] Added : 811 causal constraints over 163 iterations in 11733 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
[2021-05-16 17:03:48] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 1 ms.
[2021-05-16 17:03:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
[2021-05-16 17:03:49] [INFO ] Flatten gal took : 260 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPt-PT-040B @ 3570 seconds

FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ ShieldPPPt-PT-040B

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p106 <= 0) OR (p992 <= 0) OR (p13 <= 0) OR (p29 <= 0) OR (((p408 <= 0)) AND ((p56 <= 0))))))",
"processed_size": 104,
"rewrites": 2
},
"result":
{
"edges": 106,
"markings": 107,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"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": 4,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p909) AND ((p207 <= 0)) AND (1 <= p506) AND (1 <= p490) AND (1 <= p20) AND (1 <= p38) AND (((1 <= p177)) OR ((1 <= p987)) OR ((1 <= p937))))))",
"processed_size": 157,
"rewrites": 1
},
"result":
{
"edges": 112,
"markings": 113,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 21,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 28124,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 3697,
"conflict_clusters": 339,
"places": 1012,
"places_significant": 574,
"singleton_clusters": 0,
"transitions": 849
},
"result":
{
"preliminary_value": "no yes ",
"value": "no yes "
},
"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: 1861/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1012
lola: finding significant places
lola: 1012 places, 849 transitions, 574 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: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p992 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p408 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p909 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p490 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p987 <= 1)
lola: LP says that atomic proposition is always true: (p937 <= 1)
lola: A (G (((p106 <= 0) OR (p992 <= 0) OR (p13 <= 0) OR (p29 <= 0) OR (((p408 <= 0)) AND ((p56 <= 0)))))) : E (F (((1 <= p909) AND ((p207 <= 0)) AND (1 <= p506) AND (1 <= p490) AND (1 <= p20) AND (1 <= p38) AND (((1 <= p177)) OR ((1 <= p987)) OR ((1 <= p937))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p106 <= 0) OR (p992 <= 0) OR (p13 <= 0) OR (p29 <= 0) OR (((p408 <= 0)) AND ((p56 <= 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 (((p106 <= 0) OR (p992 <= 0) OR (p13 <= 0) OR (p29 <= 0) OR (((p408 <= 0)) AND ((p56 <= 0))))))
lola: processed formula length: 104
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p106) AND (1 <= p992) AND (1 <= p13) AND (1 <= p29) AND (((1 <= p408)) OR ((1 <= p56))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 107 markings, 106 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: subprocess 1 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p909) AND ((p207 <= 0)) AND (1 <= p506) AND (1 <= p490) AND (1 <= p20) AND (1 <= p38) AND (((1 <= p177)) OR ((1 <= p987)) OR ((1 <= p937))))))
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 <= p909) AND ((p207 <= 0)) AND (1 <= p506) AND (1 <= p490) AND (1 <= p20) AND (1 <= p38) AND (((1 <= p177)) OR ((1 <= p987)) OR ((1 <= p937))))))
lola: processed formula length: 157
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 <= p909) AND ((p207 <= 0)) AND (1 <= p506) AND (1 <= p490) AND (1 <= p20) AND (1 <= p38) AND (((1 <= p177)) OR ((1 <= p987)) OR ((1 <= p937))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 113 markings, 112 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes
lola:
preliminary result: no yes
lola: ========================================
lola: memory consumption: 28124 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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is ShieldPPPt-PT-040B, 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 r227-tall-162098231300416"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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