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.r011-tall-162038005800032.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 ASLink-PT-04a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038005800032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 436K May 5 16:51 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 ASLink-PT-04a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-04a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620397902122

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 14:31:43] [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-07 14:31:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 14:31:43] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2021-05-07 14:31:43] [INFO ] Transformed 1016 places.
[2021-05-07 14:31:43] [INFO ] Transformed 1554 transitions.
[2021-05-07 14:31:43] [INFO ] Found NUPN structural information;
[2021-05-07 14:31:43] [INFO ] Parsed PT model containing 1016 places and 1554 transitions in 183 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 68 resets, run finished after 105 ms. (steps per millisecond=95 ) properties seen :[1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA ASLink-PT-04a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1538 rows 1016 cols
[2021-05-07 14:31:44] [INFO ] Computed 194 place invariants in 80 ms
[2021-05-07 14:31:44] [INFO ] [Real]Absence check using 46 positive place invariants in 62 ms returned sat
[2021-05-07 14:31:44] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 114 ms returned sat
[2021-05-07 14:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:31:47] [INFO ] [Real]Absence check using state equation in 3052 ms returned sat
[2021-05-07 14:31:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:31:48] [INFO ] [Nat]Absence check using 46 positive place invariants in 73 ms returned sat
[2021-05-07 14:31:48] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 111 ms returned sat
[2021-05-07 14:31:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:31:50] [INFO ] [Nat]Absence check using state equation in 2704 ms returned unsat
[2021-05-07 14:31:51] [INFO ] [Real]Absence check using 46 positive place invariants in 50 ms returned sat
[2021-05-07 14:31:51] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 30 ms returned unsat
[2021-05-07 14:31:51] [INFO ] [Real]Absence check using 46 positive place invariants in 50 ms returned sat
[2021-05-07 14:31:51] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 131 ms returned sat
[2021-05-07 14:31:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:31:55] [INFO ] [Real]Absence check using state equation in 3747 ms returned sat
[2021-05-07 14:31:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:31:55] [INFO ] [Nat]Absence check using 46 positive place invariants in 77 ms returned sat
[2021-05-07 14:31:55] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 134 ms returned sat
[2021-05-07 14:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:31:57] [INFO ] [Nat]Absence check using state equation in 2200 ms returned unsat
[2021-05-07 14:31:58] [INFO ] [Real]Absence check using 46 positive place invariants in 49 ms returned sat
[2021-05-07 14:31:58] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 122 ms returned sat
[2021-05-07 14:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:01] [INFO ] [Real]Absence check using state equation in 2936 ms returned sat
[2021-05-07 14:32:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:32:01] [INFO ] [Nat]Absence check using 46 positive place invariants in 125 ms returned sat
[2021-05-07 14:32:01] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 102 ms returned sat
[2021-05-07 14:32:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:03] [INFO ] [Nat]Absence check using state equation in 2376 ms returned unsat
[2021-05-07 14:32:04] [INFO ] [Real]Absence check using 46 positive place invariants in 46 ms returned sat
[2021-05-07 14:32:04] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 114 ms returned sat
[2021-05-07 14:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:07] [INFO ] [Real]Absence check using state equation in 2838 ms returned sat
[2021-05-07 14:32:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:32:07] [INFO ] [Nat]Absence check using 46 positive place invariants in 65 ms returned sat
[2021-05-07 14:32:07] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 115 ms returned sat
[2021-05-07 14:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:10] [INFO ] [Nat]Absence check using state equation in 2692 ms returned unsat
[2021-05-07 14:32:10] [INFO ] [Real]Absence check using 46 positive place invariants in 48 ms returned sat
[2021-05-07 14:32:10] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 103 ms returned sat
[2021-05-07 14:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:13] [INFO ] [Real]Absence check using state equation in 2881 ms returned sat
[2021-05-07 14:32:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:32:13] [INFO ] [Nat]Absence check using 46 positive place invariants in 122 ms returned sat
[2021-05-07 14:32:13] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 100 ms returned sat
[2021-05-07 14:32:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:16] [INFO ] [Nat]Absence check using state equation in 3132 ms returned sat
[2021-05-07 14:32:17] [INFO ] Deduced a trap composed of 36 places in 236 ms
[2021-05-07 14:32:17] [INFO ] Deduced a trap composed of 24 places in 183 ms
[2021-05-07 14:32:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 595 ms
[2021-05-07 14:32:17] [INFO ] Computed and/alt/rep : 1537/18546/1537 causal constraints in 129 ms.
[2021-05-07 14:32:18] [INFO ] Added : 45 causal constraints over 9 iterations in 930 ms. Result :(error "Failed to check-sat")
[2021-05-07 14:32:18] [INFO ] [Real]Absence check using 46 positive place invariants in 49 ms returned sat
[2021-05-07 14:32:18] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 124 ms returned sat
[2021-05-07 14:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:21] [INFO ] [Real]Absence check using state equation in 2994 ms returned sat
[2021-05-07 14:32:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:32:22] [INFO ] [Nat]Absence check using 46 positive place invariants in 122 ms returned sat
[2021-05-07 14:32:22] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 102 ms returned sat
[2021-05-07 14:32:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:25] [INFO ] [Nat]Absence check using state equation in 2939 ms returned sat
[2021-05-07 14:32:25] [INFO ] Deduced a trap composed of 31 places in 118 ms
[2021-05-07 14:32:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2021-05-07 14:32:25] [INFO ] Computed and/alt/rep : 1537/18546/1537 causal constraints in 141 ms.
[2021-05-07 14:32:26] [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 (=> (> t203 0) (and (> t202 0) (< o202 o203)))") while checking expression at index 6
[2021-05-07 14:32:26] [INFO ] [Real]Absence check using 46 positive place invariants in 49 ms returned sat
[2021-05-07 14:32:27] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 110 ms returned sat
[2021-05-07 14:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:29] [INFO ] [Real]Absence check using state equation in 2944 ms returned sat
[2021-05-07 14:32:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:32:30] [INFO ] [Nat]Absence check using 46 positive place invariants in 74 ms returned sat
[2021-05-07 14:32:30] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 111 ms returned sat
[2021-05-07 14:32:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:33] [INFO ] [Nat]Absence check using state equation in 3125 ms returned sat
[2021-05-07 14:32:33] [INFO ] Deduced a trap composed of 39 places in 106 ms
[2021-05-07 14:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 158 ms
[2021-05-07 14:32:33] [INFO ] [Real]Absence check using 46 positive place invariants in 48 ms returned sat
[2021-05-07 14:32:33] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 115 ms returned sat
[2021-05-07 14:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:37] [INFO ] [Real]Absence check using state equation in 3117 ms returned sat
[2021-05-07 14:32:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:32:37] [INFO ] [Nat]Absence check using 46 positive place invariants in 65 ms returned sat
[2021-05-07 14:32:37] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 112 ms returned sat
[2021-05-07 14:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:40] [INFO ] [Nat]Absence check using state equation in 3304 ms returned sat
[2021-05-07 14:32:40] [INFO ] Computed and/alt/rep : 1537/18546/1537 causal constraints in 84 ms.
[2021-05-07 14:32:42] [INFO ] Added : 75 causal constraints over 15 iterations in 1333 ms. Result :unknown
[2021-05-07 14:32:42] [INFO ] [Real]Absence check using 46 positive place invariants in 48 ms returned sat
[2021-05-07 14:32:42] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 105 ms returned sat
[2021-05-07 14:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:45] [INFO ] [Real]Absence check using state equation in 2907 ms returned sat
[2021-05-07 14:32:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:32:45] [INFO ] [Nat]Absence check using 46 positive place invariants in 124 ms returned sat
[2021-05-07 14:32:45] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 99 ms returned sat
[2021-05-07 14:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:32:48] [INFO ] [Nat]Absence check using state equation in 3096 ms returned sat
[2021-05-07 14:32:49] [INFO ] Deduced a trap composed of 24 places in 215 ms
[2021-05-07 14:32:49] [INFO ] Deduced a trap composed of 35 places in 104 ms
[2021-05-07 14:32:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 433 ms
[2021-05-07 14:32:49] [INFO ] Computed and/alt/rep : 1537/18546/1537 causal constraints in 119 ms.
[2021-05-07 14:32:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t111 0) (or (and (> t57 0) (< o57 o111)) (and (> t110 0) (< o110 o111))))") while checking expression at index 9
[2021-05-07 14:32:50] [INFO ] [Real]Absence check using 46 positive place invariants in 48 ms returned sat
[2021-05-07 14:32:50] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 37 ms returned unsat
FORMULA ASLink-PT-04a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 238700 steps, including 3540 resets, run finished after 1140 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 13 out of 1016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 992 transition count 1449
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 202 place count 903 transition count 1449
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 202 place count 903 transition count 1360
Deduced a syphon composed of 89 places in 2 ms
Ensure Unique test removed 35 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 415 place count 779 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 416 place count 779 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 417 place count 778 transition count 1359
Symmetric choice reduction at 4 with 6 rule applications. Total rules 423 place count 778 transition count 1359
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 34 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 435 place count 772 transition count 1325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 439 place count 771 transition count 1322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 441 place count 769 transition count 1322
Symmetric choice reduction at 6 with 1 rule applications. Total rules 442 place count 769 transition count 1322
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 444 place count 768 transition count 1314
Symmetric choice reduction at 6 with 1 rule applications. Total rules 445 place count 768 transition count 1314
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 447 place count 767 transition count 1306
Symmetric choice reduction at 6 with 1 rule applications. Total rules 448 place count 767 transition count 1306
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 450 place count 766 transition count 1298
Symmetric choice reduction at 6 with 1 rule applications. Total rules 451 place count 766 transition count 1298
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 453 place count 765 transition count 1290
Symmetric choice reduction at 6 with 1 rule applications. Total rules 454 place count 765 transition count 1290
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 456 place count 764 transition count 1282
Symmetric choice reduction at 6 with 1 rule applications. Total rules 457 place count 764 transition count 1282
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 459 place count 763 transition count 1274
Symmetric choice reduction at 6 with 1 rule applications. Total rules 460 place count 763 transition count 1274
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 462 place count 762 transition count 1266
Symmetric choice reduction at 6 with 1 rule applications. Total rules 463 place count 762 transition count 1266
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 465 place count 761 transition count 1258
Symmetric choice reduction at 6 with 1 rule applications. Total rules 466 place count 761 transition count 1258
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 468 place count 760 transition count 1250
Symmetric choice reduction at 6 with 1 rule applications. Total rules 469 place count 760 transition count 1250
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 471 place count 759 transition count 1242
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 525 place count 732 transition count 1215
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 528 place count 732 transition count 1212
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 531 place count 729 transition count 1212
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 536 place count 729 transition count 1212
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 539 place count 729 transition count 1212
Applied a total of 539 rules in 623 ms. Remains 729 /1016 variables (removed 287) and now considering 1212/1538 (removed 326) transitions.
Finished structural reductions, in 1 iterations. Remains : 729/1016 places, 1212/1538 transitions.
Incomplete random walk after 1000000 steps, including 11181 resets, run finished after 3627 ms. (steps per millisecond=275 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1323 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2568 resets, run finished after 1512 ms. (steps per millisecond=661 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2611 resets, run finished after 1693 ms. (steps per millisecond=590 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2549 resets, run finished after 1528 ms. (steps per millisecond=654 ) properties seen :[0, 1, 0, 0]
FORMULA ASLink-PT-04a-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1212 rows 729 cols
[2021-05-07 14:33:02] [INFO ] Computed 134 place invariants in 37 ms
[2021-05-07 14:33:02] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2021-05-07 14:33:02] [INFO ] [Real]Absence check using 36 positive and 98 generalized place invariants in 52 ms returned sat
[2021-05-07 14:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:33:03] [INFO ] [Real]Absence check using state equation in 1647 ms returned sat
[2021-05-07 14:33:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:33:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 51 ms returned sat
[2021-05-07 14:33:04] [INFO ] [Nat]Absence check using 36 positive and 98 generalized place invariants in 51 ms returned sat
[2021-05-07 14:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:33:05] [INFO ] [Nat]Absence check using state equation in 1724 ms returned sat
[2021-05-07 14:33:05] [INFO ] State equation strengthened by 29 read => feed constraints.
[2021-05-07 14:33:06] [INFO ] [Nat]Added 29 Read/Feed constraints in 214 ms returned sat
[2021-05-07 14:33:06] [INFO ] Computed and/alt/rep : 1211/15344/1211 causal constraints in 56 ms.
[2021-05-07 14:33:28] [INFO ] Added : 425 causal constraints over 85 iterations in 22019 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 111 ms.
[2021-05-07 14:33:28] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2021-05-07 14:33:28] [INFO ] [Real]Absence check using 36 positive and 98 generalized place invariants in 60 ms returned sat
[2021-05-07 14:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:33:30] [INFO ] [Real]Absence check using state equation in 1797 ms returned sat
[2021-05-07 14:33:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:33:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 49 ms returned sat
[2021-05-07 14:33:30] [INFO ] [Nat]Absence check using 36 positive and 98 generalized place invariants in 59 ms returned sat
[2021-05-07 14:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:33:32] [INFO ] [Nat]Absence check using state equation in 2362 ms returned sat
[2021-05-07 14:33:33] [INFO ] [Nat]Added 29 Read/Feed constraints in 178 ms returned sat
[2021-05-07 14:33:33] [INFO ] Computed and/alt/rep : 1211/15344/1211 causal constraints in 69 ms.
[2021-05-07 14:33:41] [INFO ] Added : 170 causal constraints over 34 iterations in 8249 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 58 ms.
[2021-05-07 14:33:41] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2021-05-07 14:33:41] [INFO ] [Real]Absence check using 36 positive and 98 generalized place invariants in 52 ms returned sat
[2021-05-07 14:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:33:43] [INFO ] [Real]Absence check using state equation in 1631 ms returned sat
[2021-05-07 14:33:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:33:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 50 ms returned sat
[2021-05-07 14:33:43] [INFO ] [Nat]Absence check using 36 positive and 98 generalized place invariants in 52 ms returned sat
[2021-05-07 14:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:33:45] [INFO ] [Nat]Absence check using state equation in 1637 ms returned sat
[2021-05-07 14:33:45] [INFO ] [Nat]Added 29 Read/Feed constraints in 102 ms returned sat
[2021-05-07 14:33:45] [INFO ] Computed and/alt/rep : 1211/15344/1211 causal constraints in 70 ms.
[2021-05-07 14:33:58] [INFO ] Added : 175 causal constraints over 35 iterations in 12873 ms. Result :unknown
Incomplete Parikh walk after 235000 steps, including 2806 resets, run finished after 903 ms. (steps per millisecond=260 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA ASLink-PT-04a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 235500 steps, including 2827 resets, run finished after 941 ms. (steps per millisecond=250 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 357600 steps, including 3898 resets, run finished after 1418 ms. (steps per millisecond=252 ) properties seen :[0, 0] could not realise parikh vector
Support contains 10 out of 729 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 729/729 places, 1212/1212 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 728 transition count 1211
Applied a total of 2 rules in 62 ms. Remains 728 /729 variables (removed 1) and now considering 1211/1212 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 728/729 places, 1211/1212 transitions.
Incomplete random walk after 1000000 steps, including 11072 resets, run finished after 3453 ms. (steps per millisecond=289 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2596 resets, run finished after 1639 ms. (steps per millisecond=610 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2572 resets, run finished after 1474 ms. (steps per millisecond=678 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 3933541 steps, run timeout after 30053 ms. (steps per millisecond=130 ) properties seen :[0, 1]
Probabilistic random walk after 3933541 steps, saw 1198562 distinct states, run finished after 30053 ms. (steps per millisecond=130 ) properties seen :[0, 1]
FORMULA ASLink-PT-04a-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1211 rows 728 cols
[2021-05-07 14:34:38] [INFO ] Computed 134 place invariants in 16 ms
[2021-05-07 14:34:38] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2021-05-07 14:34:38] [INFO ] [Real]Absence check using 36 positive and 98 generalized place invariants in 59 ms returned sat
[2021-05-07 14:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:34:40] [INFO ] [Real]Absence check using state equation in 1698 ms returned sat
[2021-05-07 14:34:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:34:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 34 ms returned sat
[2021-05-07 14:34:40] [INFO ] [Nat]Absence check using 36 positive and 98 generalized place invariants in 61 ms returned sat
[2021-05-07 14:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:34:42] [INFO ] [Nat]Absence check using state equation in 2075 ms returned sat
[2021-05-07 14:34:42] [INFO ] State equation strengthened by 29 read => feed constraints.
[2021-05-07 14:34:42] [INFO ] [Nat]Added 29 Read/Feed constraints in 93 ms returned sat
[2021-05-07 14:34:42] [INFO ] Computed and/alt/rep : 1210/15343/1210 causal constraints in 66 ms.
[2021-05-07 14:35:01] [INFO ] Added : 305 causal constraints over 61 iterations in 19159 ms. Result :unknown
Incomplete Parikh walk after 363200 steps, including 3927 resets, run finished after 1434 ms. (steps per millisecond=253 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 728 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 728/728 places, 1211/1211 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 728 transition count 1211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 727 transition count 1210
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 719 transition count 1210
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 10 place count 719 transition count 1198
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 25 rules applied. Total rules applied 35 place count 706 transition count 1198
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 701 transition count 1198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 40 place count 701 transition count 1197
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 700 transition count 1197
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 60 place count 691 transition count 1188
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 691 transition count 1188
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 72 place count 687 transition count 1184
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 687 transition count 1180
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 683 transition count 1180
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 683 transition count 1180
Applied a total of 84 rules in 178 ms. Remains 683 /728 variables (removed 45) and now considering 1180/1211 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 683/728 places, 1180/1211 transitions.
Incomplete random walk after 1000000 steps, including 12813 resets, run finished after 3464 ms. (steps per millisecond=288 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 2919 resets, run finished after 1535 ms. (steps per millisecond=651 ) properties seen :[0]
Interrupted probabilistic random walk after 4403170 steps, run timeout after 30001 ms. (steps per millisecond=146 ) properties seen :[0]
Probabilistic random walk after 4403170 steps, saw 1315398 distinct states, run finished after 30001 ms. (steps per millisecond=146 ) properties seen :[0]
// Phase 1: matrix 1180 rows 683 cols
[2021-05-07 14:35:38] [INFO ] Computed 120 place invariants in 15 ms
[2021-05-07 14:35:38] [INFO ] [Real]Absence check using 28 positive place invariants in 28 ms returned sat
[2021-05-07 14:35:38] [INFO ] [Real]Absence check using 28 positive and 92 generalized place invariants in 52 ms returned sat
[2021-05-07 14:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:35:40] [INFO ] [Real]Absence check using state equation in 1616 ms returned sat
[2021-05-07 14:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:35:40] [INFO ] [Nat]Absence check using 28 positive place invariants in 34 ms returned sat
[2021-05-07 14:35:40] [INFO ] [Nat]Absence check using 28 positive and 92 generalized place invariants in 52 ms returned sat
[2021-05-07 14:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:35:42] [INFO ] [Nat]Absence check using state equation in 2411 ms returned sat
[2021-05-07 14:35:42] [INFO ] Computed and/alt/rep : 1155/13232/1155 causal constraints in 61 ms.
[2021-05-07 14:35:48] [INFO ] Added : 130 causal constraints over 26 iterations in 5668 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 44 ms.
Incomplete Parikh walk after 66300 steps, including 1510 resets, run finished after 264 ms. (steps per millisecond=251 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 683 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 683/683 places, 1180/1180 transitions.
Applied a total of 0 rules in 18 ms. Remains 683 /683 variables (removed 0) and now considering 1180/1180 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 683/683 places, 1180/1180 transitions.
Starting structural reductions, iteration 0 : 683/683 places, 1180/1180 transitions.
Applied a total of 0 rules in 17 ms. Remains 683 /683 variables (removed 0) and now considering 1180/1180 (removed 0) transitions.
// Phase 1: matrix 1180 rows 683 cols
[2021-05-07 14:35:48] [INFO ] Computed 120 place invariants in 16 ms
[2021-05-07 14:35:50] [INFO ] Implicit Places using invariants in 1718 ms returned [0, 19, 20, 33, 51, 69, 138, 142, 151, 152, 153, 171, 189, 258, 262, 263, 274, 275, 276, 294, 312, 381, 385, 386, 397, 398, 399, 417, 435, 504, 508, 509, 512, 523, 524, 525, 549, 551, 554, 572, 573, 574, 575, 587, 593, 599, 605, 611, 617, 623, 629, 635, 641, 647]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 1720 ms to find 54 implicit places.
[2021-05-07 14:35:50] [INFO ] Redundant transitions in 84 ms returned []
// Phase 1: matrix 1180 rows 629 cols
[2021-05-07 14:35:50] [INFO ] Computed 66 place invariants in 12 ms
[2021-05-07 14:35:52] [INFO ] Dead Transitions using invariants and state equation in 2294 ms returned []
Starting structural reductions, iteration 1 : 629/683 places, 1180/1180 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 629 transition count 1090
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 539 transition count 1090
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 180 place count 539 transition count 1067
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 227 place count 515 transition count 1067
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 239 place count 511 transition count 1059
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 247 place count 503 transition count 1059
Symmetric choice reduction at 4 with 15 rule applications. Total rules 262 place count 503 transition count 1059
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 292 place count 488 transition count 1044
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 295 place count 488 transition count 1041
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 295 place count 488 transition count 1040
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 297 place count 487 transition count 1040
Symmetric choice reduction at 5 with 3 rule applications. Total rules 300 place count 487 transition count 1040
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 306 place count 484 transition count 1037
Symmetric choice reduction at 5 with 1 rule applications. Total rules 307 place count 484 transition count 1037
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 309 place count 483 transition count 1036
Symmetric choice reduction at 5 with 1 rule applications. Total rules 310 place count 483 transition count 1036
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 312 place count 482 transition count 1035
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 392 place count 442 transition count 995
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 396 place count 442 transition count 991
Symmetric choice reduction at 6 with 4 rule applications. Total rules 400 place count 442 transition count 991
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 408 place count 438 transition count 987
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 412 place count 438 transition count 983
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 421 place count 438 transition count 974
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 431 place count 428 transition count 974
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 444 place count 428 transition count 974
Applied a total of 444 rules in 120 ms. Remains 428 /629 variables (removed 201) and now considering 974/1180 (removed 206) transitions.
// Phase 1: matrix 974 rows 428 cols
[2021-05-07 14:35:53] [INFO ] Computed 60 place invariants in 9 ms
[2021-05-07 14:35:53] [INFO ] Implicit Places using invariants in 708 ms returned [75, 92, 98, 101, 103, 106, 107, 159, 176, 182, 185, 187, 192, 193, 245, 262, 268, 271, 273, 278, 279, 331, 348, 354, 357, 359]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 711 ms to find 26 implicit places.
Starting structural reductions, iteration 2 : 402/683 places, 974/1180 transitions.
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 402 transition count 974
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 36 place count 390 transition count 962
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 390 transition count 962
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 386 transition count 958
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 378 transition count 950
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 378 transition count 938
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 88 place count 366 transition count 938
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 366 transition count 934
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 96 place count 362 transition count 934
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 362 transition count 934
Applied a total of 100 rules in 68 ms. Remains 362 /402 variables (removed 40) and now considering 934/974 (removed 40) transitions.
// Phase 1: matrix 934 rows 362 cols
[2021-05-07 14:35:53] [INFO ] Computed 34 place invariants in 8 ms
[2021-05-07 14:35:54] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 934 rows 362 cols
[2021-05-07 14:35:54] [INFO ] Computed 34 place invariants in 8 ms
[2021-05-07 14:35:57] [INFO ] Implicit Places using invariants and state equation in 3021 ms returned []
Implicit Place search using SMT with State Equation took 3531 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 362/683 places, 934/1180 transitions.
Incomplete random walk after 1000000 steps, including 19681 resets, run finished after 3039 ms. (steps per millisecond=329 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 5819 resets, run finished after 1368 ms. (steps per millisecond=730 ) properties seen :[0]
Interrupted probabilistic random walk after 5726726 steps, run timeout after 30001 ms. (steps per millisecond=190 ) properties seen :[0]
Probabilistic random walk after 5726726 steps, saw 1888705 distinct states, run finished after 30001 ms. (steps per millisecond=190 ) properties seen :[0]
// Phase 1: matrix 934 rows 362 cols
[2021-05-07 14:36:31] [INFO ] Computed 34 place invariants in 9 ms
[2021-05-07 14:36:31] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-07 14:36:31] [INFO ] [Real]Absence check using 12 positive and 22 generalized place invariants in 11 ms returned sat
[2021-05-07 14:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:36:32] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2021-05-07 14:36:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:36:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-07 14:36:32] [INFO ] [Nat]Absence check using 12 positive and 22 generalized place invariants in 10 ms returned sat
[2021-05-07 14:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:36:33] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2021-05-07 14:36:33] [INFO ] Computed and/alt/rep : 912/12736/912 causal constraints in 56 ms.
[2021-05-07 14:36:53] [INFO ] Added : 550 causal constraints over 110 iterations in 20332 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 121 ms.
Incomplete Parikh walk after 115600 steps, including 3489 resets, run finished after 395 ms. (steps per millisecond=292 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 934/934 transitions.
Applied a total of 0 rules in 13 ms. Remains 362 /362 variables (removed 0) and now considering 934/934 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 362/362 places, 934/934 transitions.
Starting structural reductions, iteration 0 : 362/362 places, 934/934 transitions.
Applied a total of 0 rules in 12 ms. Remains 362 /362 variables (removed 0) and now considering 934/934 (removed 0) transitions.
// Phase 1: matrix 934 rows 362 cols
[2021-05-07 14:36:54] [INFO ] Computed 34 place invariants in 8 ms
[2021-05-07 14:36:54] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 934 rows 362 cols
[2021-05-07 14:36:54] [INFO ] Computed 34 place invariants in 8 ms
[2021-05-07 14:36:57] [INFO ] Implicit Places using invariants and state equation in 3064 ms returned []
Implicit Place search using SMT with State Equation took 3606 ms to find 0 implicit places.
[2021-05-07 14:36:58] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 934 rows 362 cols
[2021-05-07 14:36:58] [INFO ] Computed 34 place invariants in 8 ms
[2021-05-07 14:36:59] [INFO ] Dead Transitions using invariants and state equation in 1116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 362/362 places, 934/934 transitions.
Incomplete random walk after 100000 steps, including 1933 resets, run finished after 298 ms. (steps per millisecond=335 ) properties seen :[0]
// Phase 1: matrix 934 rows 362 cols
[2021-05-07 14:36:59] [INFO ] Computed 34 place invariants in 8 ms
[2021-05-07 14:36:59] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-07 14:36:59] [INFO ] [Real]Absence check using 12 positive and 22 generalized place invariants in 11 ms returned sat
[2021-05-07 14:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:37:00] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2021-05-07 14:37:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:37:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned sat
[2021-05-07 14:37:00] [INFO ] [Nat]Absence check using 12 positive and 22 generalized place invariants in 12 ms returned sat
[2021-05-07 14:37:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:37:01] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2021-05-07 14:37:01] [INFO ] Computed and/alt/rep : 912/12736/912 causal constraints in 40 ms.
[2021-05-07 14:37:20] [INFO ] Added : 530 causal constraints over 106 iterations in 19003 ms. Result :(error "Failed to check-sat")
Applied a total of 0 rules in 12 ms. Remains 362 /362 variables (removed 0) and now considering 934/934 (removed 0) transitions.
// Phase 1: matrix 934 rows 362 cols
[2021-05-07 14:37:20] [INFO ] Computed 34 place invariants in 7 ms
[2021-05-07 14:37:20] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2021-05-07 14:37:20] [INFO ] [Real]Absence check using 12 positive and 22 generalized place invariants in 11 ms returned sat
[2021-05-07 14:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:37:20] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2021-05-07 14:37:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:37:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2021-05-07 14:37:20] [INFO ] [Nat]Absence check using 12 positive and 22 generalized place invariants in 12 ms returned sat
[2021-05-07 14:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:37:21] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2021-05-07 14:37:21] [INFO ] Computed and/alt/rep : 912/12736/912 causal constraints in 54 ms.
[2021-05-07 14:37:42] [INFO ] Added : 550 causal constraints over 110 iterations in 20193 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 120 ms.
[2021-05-07 14:37:42] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-07 14:37:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
[2021-05-07 14:37:42] [INFO ] Flatten gal took : 117 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ASLink-PT-04a @ 3570 seconds
vrfy: finished
info: timeLeft: 3507
rslt: Output for ReachabilityFireability @ ASLink-PT-04a

{
"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",
"localtimelimit": 0,
"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": "Fri May 7 14:37:43 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 32952,
"runtime": 63.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((((1 <= p247) AND (1 <= p298)) OR ((p17 <= 1) AND (1 <= p17) AND (p23 <= 1) AND (1 <= p23))) AND (((p230 <= 1) AND (1 <= p230) AND (p321 <= 1) AND (1 <= p321)) OR ((p35 <= 1) AND (1 <= p35) AND (p135 <= 1) AND (1 <= p135))))))",
"processed_size": 235,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 3815,
"conflict_clusters": 29,
"places": 362,
"places_significant": 328,
"singleton_clusters": 0,
"transitions": 934
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 28,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
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: 1296/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 362
lola: finding significant places
lola: 362 places, 934 transitions, 328 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: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p298 <= 1)
lola: E (F (((((1 <= p247) AND (1 <= p298)) OR ((p17 <= 1) AND (1 <= p17) AND (p23 <= 1) AND (1 <= p23))) AND (((p230 <= 1) AND (1 <= p230) AND (p321 <= 1) AND (1 <= p321)) OR ((p35 <= 1) AND (1 <= p35) AND (p135 <= 1) AND (1 <= p135))))))
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 <= p247) AND (1 <= p298)) OR ((p17 <= 1) AND (1 <= p17) AND (p23 <= 1) AND (1 <= p23))) AND (((p230 <= 1) AND (1 <= p230) AND (p321 <= 1) AND (1 <= p321)) OR ((p35 <= 1) AND (1 <= p35) AND (p135 <= 1) AND (1 <= p135))))))
lola: processed formula length: 235
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: subprocess will run for 0 seconds at most (--localtimelimit)
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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p247) AND (1 <= p298)) OR ((p17 <= 1) AND (1 <= p17) AND (p23 <= 1) AND (1 <= p23))) AND (((p230 <= 1) AND (1 <= p230) AND (p321 <= 1) AND (1 <= p321)) OR ((p35 <= 1) AND (1 <= p35) AND (p135 <= 1) AND (1 <= p135))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: memory consumption: 32952 KB
lola: time consumption: 63 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="ASLink-PT-04a"
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 ASLink-PT-04a, 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 r011-tall-162038005800032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04a.tgz
mv ASLink-PT-04a 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 ;