Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853100399.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NoC3x3-PT-5A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853100399
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 3.6K Apr 8 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 8 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 7 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 04:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 6 04:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 248K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591144447416

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:34:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 00:34:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:34:09] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2020-06-03 00:34:09] [INFO ] Transformed 417 places.
[2020-06-03 00:34:09] [INFO ] Transformed 933 transitions.
[2020-06-03 00:34:09] [INFO ] Found NUPN structural information;
[2020-06-03 00:34:09] [INFO ] Parsed PT model containing 417 places and 933 transitions in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 113 ms. (steps per millisecond=88 ) properties seen :[0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1]
FORMULA NoC3x3-PT-5A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 74 ms. (steps per millisecond=135 ) properties seen :[1, 0, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-5A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 1, 0, 0]
FORMULA NoC3x3-PT-5A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 1]
FORMULA NoC3x3-PT-5A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-03 00:34:10] [INFO ] Flow matrix only has 851 transitions (discarded 82 similar events)
// Phase 1: matrix 851 rows 417 cols
[2020-06-03 00:34:10] [INFO ] Computed 66 place invariants in 26 ms
[2020-06-03 00:34:10] [INFO ] [Real]Absence check using 66 positive place invariants in 54 ms returned unsat
[2020-06-03 00:34:10] [INFO ] [Real]Absence check using 66 positive place invariants in 45 ms returned sat
[2020-06-03 00:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:11] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2020-06-03 00:34:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:34:11] [INFO ] [Nat]Absence check using 66 positive place invariants in 101 ms returned sat
[2020-06-03 00:34:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:12] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2020-06-03 00:34:12] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-03 00:34:13] [INFO ] [Nat]Added 50 Read/Feed constraints in 323 ms returned sat
[2020-06-03 00:34:13] [INFO ] Computed and/alt/rep : 932/7863/850 causal constraints in 150 ms.
[2020-06-03 00:34:16] [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 (=> (> t113 0) (and (or (and (> t119 0) (< o119 o113)) (and (> t122 0) (< o122 o113)) (and (> t124 0) (< o124 o113)) (and (> t133 0) (< o133 o113)) (and (> t136 0) (< o136 o113)) (and (> t138 0) (< o138 o113))) (or (and (> t118 0) (< o118 o113)) (and (> t119 0) (< o119 o113)))))") while checking expression at index 1
[2020-06-03 00:34:16] [INFO ] [Real]Absence check using 66 positive place invariants in 52 ms returned sat
[2020-06-03 00:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:17] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2020-06-03 00:34:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:34:17] [INFO ] [Nat]Absence check using 66 positive place invariants in 48 ms returned sat
[2020-06-03 00:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:18] [INFO ] [Nat]Absence check using state equation in 1051 ms returned sat
[2020-06-03 00:34:18] [INFO ] [Nat]Added 50 Read/Feed constraints in 135 ms returned sat
[2020-06-03 00:34:19] [INFO ] Deduced a trap composed of 33 places in 93 ms
[2020-06-03 00:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2020-06-03 00:34:19] [INFO ] Computed and/alt/rep : 932/7863/850 causal constraints in 95 ms.
[2020-06-03 00:34:22] [INFO ] Added : 105 causal constraints over 21 iterations in 3536 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 00:34:22] [INFO ] [Real]Absence check using 66 positive place invariants in 39 ms returned sat
[2020-06-03 00:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:23] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2020-06-03 00:34:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:34:23] [INFO ] [Nat]Absence check using 66 positive place invariants in 40 ms returned sat
[2020-06-03 00:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:24] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2020-06-03 00:34:24] [INFO ] [Nat]Added 50 Read/Feed constraints in 145 ms returned sat
[2020-06-03 00:34:24] [INFO ] Computed and/alt/rep : 932/7863/850 causal constraints in 82 ms.
[2020-06-03 00:34:28] [INFO ] Added : 145 causal constraints over 29 iterations in 4036 ms. Result :unknown
FORMULA NoC3x3-PT-5A-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 136700 steps, including 998 resets, run finished after 667 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 38 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 933/933 transitions.
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 417 transition count 933
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 90 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 150 place count 367 transition count 843
Symmetric choice reduction at 0 with 2 rule applications. Total rules 152 place count 367 transition count 843
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 8 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 156 place count 365 transition count 835
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 160 place count 365 transition count 831
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 190 place count 365 transition count 831
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 203 place count 365 transition count 818
Applied a total of 203 rules in 134 ms. Remains 365 /417 variables (removed 52) and now considering 818/933 (removed 115) transitions.
Finished structural reductions, in 1 iterations. Remains : 365/417 places, 818/933 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2949 ms. (steps per millisecond=339 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1546 ms. (steps per millisecond=646 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1603 ms. (steps per millisecond=623 ) properties seen :[0, 0, 1]
FORMULA NoC3x3-PT-5A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-03 00:34:36] [INFO ] Flow matrix only has 760 transitions (discarded 58 similar events)
// Phase 1: matrix 760 rows 365 cols
[2020-06-03 00:34:36] [INFO ] Computed 66 place invariants in 8 ms
[2020-06-03 00:34:37] [INFO ] [Real]Absence check using 66 positive place invariants in 42 ms returned sat
[2020-06-03 00:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:37] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2020-06-03 00:34:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:34:37] [INFO ] [Nat]Absence check using 66 positive place invariants in 46 ms returned sat
[2020-06-03 00:34:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:38] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2020-06-03 00:34:38] [INFO ] State equation strengthened by 48 read => feed constraints.
[2020-06-03 00:34:38] [INFO ] [Nat]Added 48 Read/Feed constraints in 111 ms returned sat
[2020-06-03 00:34:38] [INFO ] Deduced a trap composed of 16 places in 37 ms
[2020-06-03 00:34:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2020-06-03 00:34:38] [INFO ] Computed and/alt/rep : 817/6793/759 causal constraints in 76 ms.
[2020-06-03 00:34:59] [INFO ] Added : 435 causal constraints over 87 iterations in 20526 ms.(timeout) Result :sat
[2020-06-03 00:34:59] [INFO ] Deduced a trap composed of 25 places in 39 ms
[2020-06-03 00:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
Attempting to minimize the solution found.
Minimization took 80 ms.
[2020-06-03 00:34:59] [INFO ] [Real]Absence check using 66 positive place invariants in 32 ms returned sat
[2020-06-03 00:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:35:00] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2020-06-03 00:35:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:35:00] [INFO ] [Nat]Absence check using 66 positive place invariants in 34 ms returned sat
[2020-06-03 00:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:35:00] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2020-06-03 00:35:01] [INFO ] [Nat]Added 48 Read/Feed constraints in 164 ms returned sat
[2020-06-03 00:35:01] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2020-06-03 00:35:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2020-06-03 00:35:01] [INFO ] Computed and/alt/rep : 817/6793/759 causal constraints in 55 ms.
[2020-06-03 00:35:21] [INFO ] Added : 370 causal constraints over 74 iterations in 20417 ms.(timeout) Result :sat
[2020-06-03 00:35:21] [INFO ] Deduced a trap composed of 17 places in 186 ms
[2020-06-03 00:35:22] [INFO ] Deduced a trap composed of 35 places in 171 ms
[2020-06-03 00:35:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 581 ms
Attempting to minimize the solution found.
Minimization took 66 ms.
Incomplete Parikh walk after 153300 steps, including 619 resets, run finished after 629 ms. (steps per millisecond=243 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 209800 steps, including 918 resets, run finished after 760 ms. (steps per millisecond=276 ) properties seen :[0, 0] could not realise parikh vector
Support contains 25 out of 365 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 365/365 places, 818/818 transitions.
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 365 transition count 818
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 7 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 363 transition count 811
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 363 transition count 809
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 363 transition count 809
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 363 transition count 809
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 3 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 362 transition count 806
Applied a total of 12 rules in 136 ms. Remains 362 /365 variables (removed 3) and now considering 806/818 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 362/365 places, 806/818 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2160 ms. (steps per millisecond=462 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1433 ms. (steps per millisecond=697 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1383 ms. (steps per millisecond=723 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 8479760 steps, run timeout after 30001 ms. (steps per millisecond=282 ) properties seen :[0, 0]
Probabilistic random walk after 8479760 steps, saw 369066 distinct states, run finished after 30001 ms. (steps per millisecond=282 ) properties seen :[0, 0]
[2020-06-03 00:35:58] [INFO ] Flow matrix only has 748 transitions (discarded 58 similar events)
// Phase 1: matrix 748 rows 362 cols
[2020-06-03 00:35:58] [INFO ] Computed 66 place invariants in 4 ms
[2020-06-03 00:35:58] [INFO ] [Real]Absence check using 66 positive place invariants in 39 ms returned sat
[2020-06-03 00:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:35:59] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2020-06-03 00:35:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:35:59] [INFO ] [Nat]Absence check using 66 positive place invariants in 48 ms returned sat
[2020-06-03 00:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:36:00] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2020-06-03 00:36:00] [INFO ] State equation strengthened by 48 read => feed constraints.
[2020-06-03 00:36:00] [INFO ] [Nat]Added 48 Read/Feed constraints in 134 ms returned sat
[2020-06-03 00:36:00] [INFO ] Computed and/alt/rep : 805/6669/747 causal constraints in 62 ms.
[2020-06-03 00:36:20] [INFO ] Added : 400 causal constraints over 80 iterations in 20162 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 66 ms.
[2020-06-03 00:36:20] [INFO ] [Real]Absence check using 66 positive place invariants in 34 ms returned sat
[2020-06-03 00:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:36:21] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2020-06-03 00:36:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:36:21] [INFO ] [Nat]Absence check using 66 positive place invariants in 47 ms returned sat
[2020-06-03 00:36:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:36:22] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2020-06-03 00:36:22] [INFO ] [Nat]Added 48 Read/Feed constraints in 202 ms returned sat
[2020-06-03 00:36:22] [INFO ] Computed and/alt/rep : 805/6669/747 causal constraints in 41 ms.
[2020-06-03 00:36:47] [INFO ] Added : 455 causal constraints over 91 iterations in 24457 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 77 ms.
Incomplete Parikh walk after 168300 steps, including 775 resets, run finished after 632 ms. (steps per millisecond=266 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 162100 steps, including 784 resets, run finished after 607 ms. (steps per millisecond=267 ) properties seen :[0, 0] could not realise parikh vector
Support contains 25 out of 362 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 362/362 places, 806/806 transitions.
Applied a total of 0 rules in 17 ms. Remains 362 /362 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 362/362 places, 806/806 transitions.
Starting structural reductions, iteration 0 : 362/362 places, 806/806 transitions.
Applied a total of 0 rules in 17 ms. Remains 362 /362 variables (removed 0) and now considering 806/806 (removed 0) transitions.
[2020-06-03 00:36:48] [INFO ] Flow matrix only has 748 transitions (discarded 58 similar events)
// Phase 1: matrix 748 rows 362 cols
[2020-06-03 00:36:48] [INFO ] Computed 66 place invariants in 4 ms
[2020-06-03 00:36:49] [INFO ] Implicit Places using invariants in 529 ms returned [13, 48, 86, 174, 235, 275, 311, 348]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 533 ms to find 8 implicit places.
[2020-06-03 00:36:49] [INFO ] Redundant transitions in 213 ms returned []
[2020-06-03 00:36:49] [INFO ] Flow matrix only has 748 transitions (discarded 58 similar events)
// Phase 1: matrix 748 rows 354 cols
[2020-06-03 00:36:49] [INFO ] Computed 58 place invariants in 3 ms
[2020-06-03 00:36:50] [INFO ] Dead Transitions using invariants and state equation in 1007 ms returned []
Starting structural reductions, iteration 1 : 354/362 places, 806/806 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 354 transition count 806
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 354 transition count 801
Applied a total of 14 rules in 57 ms. Remains 354 /354 variables (removed 0) and now considering 801/806 (removed 5) transitions.
[2020-06-03 00:36:50] [INFO ] Flow matrix only has 743 transitions (discarded 58 similar events)
// Phase 1: matrix 743 rows 354 cols
[2020-06-03 00:36:50] [INFO ] Computed 58 place invariants in 3 ms
[2020-06-03 00:36:50] [INFO ] Implicit Places using invariants in 519 ms returned []
[2020-06-03 00:36:50] [INFO ] Flow matrix only has 743 transitions (discarded 58 similar events)
// Phase 1: matrix 743 rows 354 cols
[2020-06-03 00:36:50] [INFO ] Computed 58 place invariants in 5 ms
[2020-06-03 00:36:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-06-03 00:36:53] [INFO ] Implicit Places using invariants and state equation in 2383 ms returned []
Implicit Place search using SMT with State Equation took 2909 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 354/362 places, 801/806 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2697 ms. (steps per millisecond=370 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1354 ms. (steps per millisecond=738 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1245 ms. (steps per millisecond=803 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9377843 steps, run timeout after 30001 ms. (steps per millisecond=312 ) properties seen :[0, 0]
Probabilistic random walk after 9377843 steps, saw 470123 distinct states, run finished after 30001 ms. (steps per millisecond=312 ) properties seen :[0, 0]
[2020-06-03 00:37:28] [INFO ] Flow matrix only has 743 transitions (discarded 58 similar events)
// Phase 1: matrix 743 rows 354 cols
[2020-06-03 00:37:28] [INFO ] Computed 58 place invariants in 3 ms
[2020-06-03 00:37:28] [INFO ] [Real]Absence check using 58 positive place invariants in 33 ms returned sat
[2020-06-03 00:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:37:29] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2020-06-03 00:37:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:37:29] [INFO ] [Nat]Absence check using 58 positive place invariants in 45 ms returned sat
[2020-06-03 00:37:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:37:29] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2020-06-03 00:37:29] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-06-03 00:37:30] [INFO ] [Nat]Added 36 Read/Feed constraints in 157 ms returned sat
[2020-06-03 00:37:30] [INFO ] Computed and/alt/rep : 800/6695/742 causal constraints in 68 ms.
[2020-06-03 00:37:51] [INFO ] Added : 420 causal constraints over 84 iterations in 21032 ms.(timeout) Result :sat
[2020-06-03 00:37:51] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2020-06-03 00:37:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-06-03 00:37:51] [INFO ] [Real]Absence check using 58 positive place invariants in 37 ms returned sat
[2020-06-03 00:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:37:51] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2020-06-03 00:37:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:37:52] [INFO ] [Nat]Absence check using 58 positive place invariants in 38 ms returned sat
[2020-06-03 00:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:37:52] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2020-06-03 00:37:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 174 ms returned sat
[2020-06-03 00:37:53] [INFO ] Deduced a trap composed of 19 places in 50 ms
[2020-06-03 00:37:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2020-06-03 00:37:53] [INFO ] Computed and/alt/rep : 800/6695/742 causal constraints in 43 ms.
[2020-06-03 00:38:14] [INFO ] Added : 395 causal constraints over 79 iterations in 21368 ms.(timeout) Result :sat
[2020-06-03 00:38:14] [INFO ] Deduced a trap composed of 23 places in 52 ms
[2020-06-03 00:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
Attempting to minimize the solution found.
Minimization took 58 ms.
Incomplete Parikh walk after 138000 steps, including 583 resets, run finished after 555 ms. (steps per millisecond=248 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 155200 steps, including 687 resets, run finished after 578 ms. (steps per millisecond=268 ) properties seen :[0, 0] could not realise parikh vector
Support contains 25 out of 354 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 354/354 places, 801/801 transitions.
Applied a total of 0 rules in 11 ms. Remains 354 /354 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 354/354 places, 801/801 transitions.
Starting structural reductions, iteration 0 : 354/354 places, 801/801 transitions.
Applied a total of 0 rules in 10 ms. Remains 354 /354 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2020-06-03 00:38:15] [INFO ] Flow matrix only has 743 transitions (discarded 58 similar events)
// Phase 1: matrix 743 rows 354 cols
[2020-06-03 00:38:15] [INFO ] Computed 58 place invariants in 2 ms
[2020-06-03 00:38:16] [INFO ] Implicit Places using invariants in 541 ms returned []
[2020-06-03 00:38:16] [INFO ] Flow matrix only has 743 transitions (discarded 58 similar events)
// Phase 1: matrix 743 rows 354 cols
[2020-06-03 00:38:16] [INFO ] Computed 58 place invariants in 3 ms
[2020-06-03 00:38:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-06-03 00:38:18] [INFO ] Implicit Places using invariants and state equation in 2214 ms returned []
Implicit Place search using SMT with State Equation took 2757 ms to find 0 implicit places.
[2020-06-03 00:38:18] [INFO ] Redundant transitions in 80 ms returned []
[2020-06-03 00:38:18] [INFO ] Flow matrix only has 743 transitions (discarded 58 similar events)
// Phase 1: matrix 743 rows 354 cols
[2020-06-03 00:38:18] [INFO ] Computed 58 place invariants in 2 ms
[2020-06-03 00:38:19] [INFO ] Dead Transitions using invariants and state equation in 950 ms returned []
Finished structural reductions, in 1 iterations. Remains : 354/354 places, 801/801 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 277 ms. (steps per millisecond=361 ) properties seen :[0, 0]
[2020-06-03 00:38:20] [INFO ] Flow matrix only has 743 transitions (discarded 58 similar events)
// Phase 1: matrix 743 rows 354 cols
[2020-06-03 00:38:20] [INFO ] Computed 58 place invariants in 2 ms
[2020-06-03 00:38:20] [INFO ] [Real]Absence check using 58 positive place invariants in 41 ms returned sat
[2020-06-03 00:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:38:20] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2020-06-03 00:38:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:38:20] [INFO ] [Nat]Absence check using 58 positive place invariants in 45 ms returned sat
[2020-06-03 00:38:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:38:21] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2020-06-03 00:38:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-06-03 00:38:21] [INFO ] [Nat]Added 36 Read/Feed constraints in 156 ms returned sat
[2020-06-03 00:38:21] [INFO ] Computed and/alt/rep : 800/6695/742 causal constraints in 46 ms.
[2020-06-03 00:38:40] [INFO ] Added : 410 causal constraints over 82 iterations in 19208 ms. Result :unknown
[2020-06-03 00:38:40] [INFO ] [Real]Absence check using 58 positive place invariants in 41 ms returned sat
[2020-06-03 00:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:38:41] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2020-06-03 00:38:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:38:41] [INFO ] [Nat]Absence check using 58 positive place invariants in 39 ms returned sat
[2020-06-03 00:38:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:38:42] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2020-06-03 00:38:42] [INFO ] [Nat]Added 36 Read/Feed constraints in 203 ms returned sat
[2020-06-03 00:38:42] [INFO ] Deduced a trap composed of 19 places in 55 ms
[2020-06-03 00:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2020-06-03 00:38:42] [INFO ] Computed and/alt/rep : 800/6695/742 causal constraints in 72 ms.
[2020-06-03 00:39:01] [INFO ] Added : 360 causal constraints over 72 iterations in 18891 ms. Result :unknown
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 354 transition count 743
Symmetric choice reduction at 1 with 23 rule applications. Total rules 81 place count 354 transition count 743
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 1 with 46 rules applied. Total rules applied 127 place count 331 transition count 720
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 1 with 34 rules applied. Total rules applied 161 place count 331 transition count 720
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 167 place count 331 transition count 714
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 331 transition count 714
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 3 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 330 transition count 711
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 330 transition count 708
Applied a total of 173 rules in 55 ms. Remains 330 /354 variables (removed 24) and now considering 708/801 (removed 93) transitions.
// Phase 1: matrix 708 rows 330 cols
[2020-06-03 00:39:01] [INFO ] Computed 58 place invariants in 3 ms
[2020-06-03 00:39:01] [INFO ] [Real]Absence check using 58 positive place invariants in 39 ms returned sat
[2020-06-03 00:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:39:02] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2020-06-03 00:39:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:39:02] [INFO ] [Nat]Absence check using 58 positive place invariants in 31 ms returned sat
[2020-06-03 00:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:39:02] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2020-06-03 00:39:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2020-06-03 00:39:02] [INFO ] [Nat]Added 10 Read/Feed constraints in 63 ms returned sat
[2020-06-03 00:39:02] [INFO ] Computed and/alt/rep : 707/6135/707 causal constraints in 49 ms.
[2020-06-03 00:39:23] [INFO ] Added : 350 causal constraints over 70 iterations in 20731 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2020-06-03 00:39:23] [INFO ] [Real]Absence check using 58 positive place invariants in 29 ms returned sat
[2020-06-03 00:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:39:24] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2020-06-03 00:39:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:39:24] [INFO ] [Nat]Absence check using 58 positive place invariants in 32 ms returned sat
[2020-06-03 00:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:39:24] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2020-06-03 00:39:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 77 ms returned sat
[2020-06-03 00:39:24] [INFO ] Computed and/alt/rep : 707/6135/707 causal constraints in 46 ms.
[2020-06-03 00:39:45] [INFO ] Added : 415 causal constraints over 83 iterations in 20180 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 47 ms.
[2020-06-03 00:39:45] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2020-06-03 00:39:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
[2020-06-03 00:39:45] [INFO ] Flatten gal took : 186 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ NoC3x3-PT-5A @ 3570 seconds

FORMULA NoC3x3-PT-5A-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-5A-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3483
rslt: Output for ReachabilityFireability @ NoC3x3-PT-5A

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1741
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (G (((p219 <= 0) OR (2 <= p255) OR (p255 <= 0) OR (p220 <= 0) OR (p241 <= 0) OR (p44 <= 0) OR (p50 <= 0) OR (p162 <= 0) OR (2 <= p175) OR (p175 <= 0) OR ((1 <= p13) AND (p35 <= 1) AND (1 <= p35) AND (1 <= p112) AND (1 <= p140)))))",
"processed_size": 242,
"rewrites": 2
},
"result":
{
"edges": 7167,
"markings": 6834,
"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": 55,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3483
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 21,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (F (((p159 <= 1) AND (1 <= p159) AND (1 <= p182) AND (1 <= p112) AND (1 <= p137) AND (((p169 <= 1) AND (1 <= p169) AND (1 <= p194)) OR ((1 <= p162) AND (p175 <= 1) AND (1 <= p175) AND (1 <= p153) AND (p186 <= 1) AND (1 <= p186))) AND (((p143 <= 1) AND (1 <= p143) AND (1 <= p184)) OR ((1 <= p118) AND (1 <= p128) AND (1 <= p195) AND (1 <= p288))))))",
"processed_size": 353,
"rewrites": 1
},
"result":
{
"edges": 129,
"markings": 111,
"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": 52,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 37644,
"runtime": 87.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 3139,
"conflict_clusters": 12,
"places": 354,
"places_significant": 296,
"singleton_clusters": 0,
"transitions": 801
},
"result":
{
"preliminary_value": "yes no ",
"value": "yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1155/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 354
lola: finding significant places
lola: 354 places, 801 transitions, 296 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: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: E (F (((p159 <= 1) AND (1 <= p159) AND (1 <= p182) AND (1 <= p112) AND (1 <= p137) AND (((p169 <= 1) AND (1 <= p169) AND (1 <= p194)) OR ((1 <= p162) AND (p175 <= 1) AND (1 <= p175) AND (1 <= p153) AND (p186 <= 1) AND (1 <= p186))) AND (((p143 <= 1) AND (1 <= p143) AND (1 <= p184)) OR ((1 <= p118) AND (1 <= p128) AND (1 <= p195) AND (1 <= p288)))))) : A (G (((p219 <= 0) OR (2 <= p255) OR (p255 <= 0) OR (p220 <= 0) OR (p241 <= 0) OR (p44 <= 0) OR (p50 <= 0) OR (p162 <= 0) OR (2 <= p175) OR (p175 <= 0) OR ((1 <= p13) AND (p35 <= 1) AND (1 <= p35) AND (1 <= p112) AND (1 <= p140)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1741 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p219 <= 0) OR (2 <= p255) OR (p255 <= 0) OR (p220 <= 0) OR (p241 <= 0) OR (p44 <= 0) OR (p50 <= 0) OR (p162 <= 0) OR (2 <= p175) OR (p175 <= 0) OR ((1 <= p13) AND (p35 <= 1) AND (1 <= p35) AND (1 <= p112) AND (1 <= p140)))))
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 (((p219 <= 0) OR (2 <= p255) OR (p255 <= 0) OR (p220 <= 0) OR (p241 <= 0) OR (p44 <= 0) OR (p50 <= 0) OR (p162 <= 0) OR (2 <= p175) OR (p175 <= 0) OR ((1 <= p13) AND (p35 <= 1) AND (1 <= p35) AND (1 <= p112) AND (1 <= p140)))))
lola: processed formula length: 242
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 <= p219) AND (p255 <= 1) AND (1 <= p255) AND (1 <= p220) AND (1 <= p241) AND (1 <= p44) AND (1 <= p50) AND (1 <= p162) AND (p175 <= 1) AND (1 <= p175) AND ((p13 <= 0) OR (2 <= p35) OR (p35 <= 0) OR (p112 <= 0) OR (p140 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 55 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6834 markings, 7167 edges
lola: ========================================
lola: subprocess 1 will run for 3483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p159 <= 1) AND (1 <= p159) AND (1 <= p182) AND (1 <= p112) AND (1 <= p137) AND (((p169 <= 1) AND (1 <= p169) AND (1 <= p194)) OR ((1 <= p162) AND (p175 <= 1) AND (1 <= p175) AND (1 <= p153) AND (p186 <= 1) AND (1 <= p186))) AND (((p143 <= 1) AND (1 <= p143) AND (1 <= p184)) OR ((1 <= p118) AND (1 <= p128) AND (1 <= p195) AND (1 <= p288))))))
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 (((p159 <= 1) AND (1 <= p159) AND (1 <= p182) AND (1 <= p112) AND (1 <= p137) AND (((p169 <= 1) AND (1 <= p169) AND (1 <= p194)) OR ((1 <= p162) AND (p175 <= 1) AND (1 <= p175) AND (1 <= p153) AND (p186 <= 1) AND (1 <= p186))) AND (((p143 <= 1) AND (1 <= p143) AND (1 <= p184)) OR ((1 <= p118) AND (1 <= p128) AND (1 <= p195) AND (1 <= p288))))))
lola: processed formula length: 353
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: ((p159 <= 1) AND (1 <= p159) AND (1 <= p182) AND (1 <= p112) AND (1 <= p137) AND (((p169 <= 1) AND (1 <= p169) AND (1 <= p194)) OR ((1 <= p162) AND (p175 <= 1) AND (1 <= p175) AND (1 <= p153) AND (p186 <= 1) AND (1 <= p186))) AND (((p143 <= 1) AND (1 <= p143) AND (1 <= p184)) OR ((1 <= p118) AND (1 <= p128) AND (1 <= p195) AND (1 <= p288))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 52 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 111 markings, 129 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no
lola:
preliminary result: yes no
lola: memory consumption: 37644 KB
lola: time consumption: 87 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="NoC3x3-PT-5A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is NoC3x3-PT-5A, 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 r174-csrt-158987853100399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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