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-158987852700095.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 MAPKbis-PT-5310, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852700095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 170K Apr 27 15:14 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 MAPKbis-PT-5310-ReachabilityFireability-00
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-01
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-02
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-03
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-04
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-05
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-06
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-07
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-08
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-09
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-10
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-11
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-12
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-13
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-14
FORMULA_NAME MAPKbis-PT-5310-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591129744358

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:29:07] [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-02 20:29:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:29:07] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2020-06-02 20:29:07] [INFO ] Transformed 106 places.
[2020-06-02 20:29:07] [INFO ] Transformed 173 transitions.
[2020-06-02 20:29:07] [INFO ] Found NUPN structural information;
[2020-06-02 20:29:07] [INFO ] Parsed PT model containing 106 places and 173 transitions in 184 ms.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 15 places and 41 transitions.
Reduce places removed 7 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
FORMULA MAPKbis-PT-5310-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5310-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5310-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5310-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=98 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1]
FORMULA MAPKbis-PT-5310-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPKbis-PT-5310-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPKbis-PT-5310-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPKbis-PT-5310-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPKbis-PT-5310-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPKbis-PT-5310-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPKbis-PT-5310-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPKbis-PT-5310-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 56 ms. (steps per millisecond=178 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0]
[2020-06-02 20:29:08] [INFO ] Flow matrix only has 84 transitions (discarded 48 similar events)
// Phase 1: matrix 84 rows 84 cols
[2020-06-02 20:29:08] [INFO ] Computed 42 place invariants in 8 ms
[2020-06-02 20:29:08] [INFO ] [Real]Absence check using 42 positive place invariants in 122 ms returned sat
[2020-06-02 20:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:08] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2020-06-02 20:29:08] [INFO ] State equation strengthened by 54 read => feed constraints.
[2020-06-02 20:29:08] [INFO ] [Real]Added 54 Read/Feed constraints in 23 ms returned sat
[2020-06-02 20:29:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:29:08] [INFO ] [Nat]Absence check using 42 positive place invariants in 112 ms returned sat
[2020-06-02 20:29:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:09] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2020-06-02 20:29:09] [INFO ] [Nat]Added 54 Read/Feed constraints in 17 ms returned sat
[2020-06-02 20:29:09] [INFO ] Computed and/alt/rep : 131/175/83 causal constraints in 17 ms.
[2020-06-02 20:29:09] [INFO ] Added : 67 causal constraints over 14 iterations in 309 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-06-02 20:29:09] [INFO ] [Real]Absence check using 42 positive place invariants in 52 ms returned sat
[2020-06-02 20:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:09] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-06-02 20:29:09] [INFO ] [Real]Added 54 Read/Feed constraints in 30 ms returned sat
[2020-06-02 20:29:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:29:10] [INFO ] [Nat]Absence check using 42 positive place invariants in 20 ms returned sat
[2020-06-02 20:29:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:10] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-06-02 20:29:10] [INFO ] [Nat]Added 54 Read/Feed constraints in 5 ms returned sat
[2020-06-02 20:29:10] [INFO ] Computed and/alt/rep : 131/175/83 causal constraints in 8 ms.
[2020-06-02 20:29:10] [INFO ] Added : 64 causal constraints over 13 iterations in 336 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-06-02 20:29:10] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2020-06-02 20:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:10] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-02 20:29:10] [INFO ] [Real]Added 54 Read/Feed constraints in 21 ms returned sat
[2020-06-02 20:29:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:29:10] [INFO ] [Nat]Absence check using 42 positive place invariants in 18 ms returned sat
[2020-06-02 20:29:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:10] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-06-02 20:29:10] [INFO ] [Nat]Added 54 Read/Feed constraints in 7 ms returned sat
[2020-06-02 20:29:10] [INFO ] Computed and/alt/rep : 131/175/83 causal constraints in 9 ms.
[2020-06-02 20:29:10] [INFO ] Added : 70 causal constraints over 14 iterations in 194 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-06-02 20:29:10] [INFO ] [Real]Absence check using 42 positive place invariants in 20 ms returned sat
[2020-06-02 20:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:11] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2020-06-02 20:29:11] [INFO ] [Real]Added 54 Read/Feed constraints in 5 ms returned sat
[2020-06-02 20:29:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:29:11] [INFO ] [Nat]Absence check using 42 positive place invariants in 22 ms returned sat
[2020-06-02 20:29:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:11] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2020-06-02 20:29:11] [INFO ] [Nat]Added 54 Read/Feed constraints in 47 ms returned sat
[2020-06-02 20:29:11] [INFO ] Computed and/alt/rep : 131/175/83 causal constraints in 33 ms.
[2020-06-02 20:29:11] [INFO ] Added : 65 causal constraints over 13 iterations in 476 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 7300 steps, including 189 resets, run finished after 35 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 1] could not realise parikh vector
FORMULA MAPKbis-PT-5310-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7900 steps, including 217 resets, run finished after 29 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 7000 steps, including 177 resets, run finished after 41 ms. (steps per millisecond=170 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 7800 steps, including 239 resets, run finished after 25 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 35 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 132/132 transitions.
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Graph (complete) has 261 edges and 84 vertex of which 76 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Drop transitions removed 11 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 76 transition count 117
Applied a total of 14 rules in 38 ms. Remains 76 /84 variables (removed 8) and now considering 117/132 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/84 places, 117/132 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1632 ms. (steps per millisecond=612 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1074 ms. (steps per millisecond=931 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1255 ms. (steps per millisecond=796 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 15879733 steps, run timeout after 30001 ms. (steps per millisecond=529 ) properties seen :[1, 0, 0]
Probabilistic random walk after 15879733 steps, saw 1488240 distinct states, run finished after 30001 ms. (steps per millisecond=529 ) properties seen :[1, 0, 0]
FORMULA MAPKbis-PT-5310-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2020-06-02 20:29:47] [INFO ] Flow matrix only has 76 transitions (discarded 41 similar events)
// Phase 1: matrix 76 rows 76 cols
[2020-06-02 20:29:47] [INFO ] Computed 38 place invariants in 5 ms
[2020-06-02 20:29:47] [INFO ] [Real]Absence check using 38 positive place invariants in 25 ms returned sat
[2020-06-02 20:29:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:47] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-06-02 20:29:47] [INFO ] State equation strengthened by 48 read => feed constraints.
[2020-06-02 20:29:47] [INFO ] [Real]Added 48 Read/Feed constraints in 4 ms returned sat
[2020-06-02 20:29:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:29:47] [INFO ] [Nat]Absence check using 38 positive place invariants in 12 ms returned sat
[2020-06-02 20:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:47] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-06-02 20:29:47] [INFO ] [Nat]Added 48 Read/Feed constraints in 11 ms returned sat
[2020-06-02 20:29:47] [INFO ] Computed and/alt/rep : 116/153/75 causal constraints in 5 ms.
[2020-06-02 20:29:47] [INFO ] Added : 58 causal constraints over 12 iterations in 91 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-06-02 20:29:47] [INFO ] [Real]Absence check using 38 positive place invariants in 13 ms returned sat
[2020-06-02 20:29:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:47] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-02 20:29:47] [INFO ] [Real]Added 48 Read/Feed constraints in 4 ms returned sat
[2020-06-02 20:29:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:29:47] [INFO ] [Nat]Absence check using 38 positive place invariants in 12 ms returned sat
[2020-06-02 20:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:29:47] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2020-06-02 20:29:47] [INFO ] [Nat]Added 48 Read/Feed constraints in 4 ms returned sat
[2020-06-02 20:29:47] [INFO ] Deduced a trap composed of 3 places in 18 ms
[2020-06-02 20:29:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2020-06-02 20:29:47] [INFO ] Computed and/alt/rep : 116/153/75 causal constraints in 6 ms.
[2020-06-02 20:29:47] [INFO ] Added : 62 causal constraints over 13 iterations in 129 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Incomplete Parikh walk after 7000 steps, including 184 resets, run finished after 33 ms. (steps per millisecond=212 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 6300 steps, including 194 resets, run finished after 16 ms. (steps per millisecond=393 ) properties seen :[1, 0] could not realise parikh vector
FORMULA MAPKbis-PT-5310-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 117/117 transitions.
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Graph (complete) has 235 edges and 76 vertex of which 68 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 68 transition count 105
Applied a total of 11 rules in 8 ms. Remains 68 /76 variables (removed 8) and now considering 105/117 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 68/76 places, 105/117 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 962 ms. (steps per millisecond=1039 ) properties seen :[0]
Interrupted probabilistic random walk after 18399495 steps, run timeout after 30001 ms. (steps per millisecond=613 ) properties seen :[0]
Probabilistic random walk after 18399495 steps, saw 1682307 distinct states, run finished after 30004 ms. (steps per millisecond=613 ) properties seen :[0]
[2020-06-02 20:30:20] [INFO ] Flow matrix only has 68 transitions (discarded 37 similar events)
// Phase 1: matrix 68 rows 68 cols
[2020-06-02 20:30:20] [INFO ] Computed 34 place invariants in 1 ms
[2020-06-02 20:30:20] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2020-06-02 20:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:30:20] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-06-02 20:30:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 20:30:20] [INFO ] [Real]Added 42 Read/Feed constraints in 5 ms returned sat
[2020-06-02 20:30:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:30:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2020-06-02 20:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:30:20] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2020-06-02 20:30:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 5 ms returned sat
[2020-06-02 20:30:20] [INFO ] Deduced a trap composed of 3 places in 20 ms
[2020-06-02 20:30:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2020-06-02 20:30:20] [INFO ] Computed and/alt/rep : 104/137/67 causal constraints in 6 ms.
[2020-06-02 20:30:20] [INFO ] Added : 56 causal constraints over 12 iterations in 77 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 6300 steps, including 162 resets, run finished after 24 ms. (steps per millisecond=262 ) properties seen :[0] could not realise parikh vector
Support contains 11 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 105/105 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 105/105 transitions.
Starting structural reductions, iteration 0 : 68/68 places, 105/105 transitions.
Applied a total of 0 rules in 17 ms. Remains 68 /68 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2020-06-02 20:30:20] [INFO ] Flow matrix only has 68 transitions (discarded 37 similar events)
// Phase 1: matrix 68 rows 68 cols
[2020-06-02 20:30:20] [INFO ] Computed 34 place invariants in 1 ms
[2020-06-02 20:30:20] [INFO ] Implicit Places using invariants in 135 ms returned []
[2020-06-02 20:30:20] [INFO ] Flow matrix only has 68 transitions (discarded 37 similar events)
// Phase 1: matrix 68 rows 68 cols
[2020-06-02 20:30:20] [INFO ] Computed 34 place invariants in 5 ms
[2020-06-02 20:30:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 20:30:20] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2020-06-02 20:30:20] [INFO ] Redundant transitions in 4 ms returned []
[2020-06-02 20:30:20] [INFO ] Flow matrix only has 68 transitions (discarded 37 similar events)
// Phase 1: matrix 68 rows 68 cols
[2020-06-02 20:30:20] [INFO ] Computed 34 place invariants in 3 ms
[2020-06-02 20:30:21] [INFO ] Dead Transitions using invariants and state equation in 271 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 105/105 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 177 ms. (steps per millisecond=564 ) properties seen :[0]
[2020-06-02 20:30:21] [INFO ] Flow matrix only has 68 transitions (discarded 37 similar events)
// Phase 1: matrix 68 rows 68 cols
[2020-06-02 20:30:21] [INFO ] Computed 34 place invariants in 1 ms
[2020-06-02 20:30:21] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2020-06-02 20:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:30:21] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-02 20:30:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 20:30:21] [INFO ] [Real]Added 42 Read/Feed constraints in 4 ms returned sat
[2020-06-02 20:30:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:30:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2020-06-02 20:30:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:30:21] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-06-02 20:30:21] [INFO ] [Nat]Added 42 Read/Feed constraints in 4 ms returned sat
[2020-06-02 20:30:21] [INFO ] Deduced a trap composed of 3 places in 10 ms
[2020-06-02 20:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2020-06-02 20:30:21] [INFO ] Computed and/alt/rep : 104/137/67 causal constraints in 6 ms.
[2020-06-02 20:30:21] [INFO ] Added : 56 causal constraints over 12 iterations in 87 ms. Result :sat
Graph (trivial) has 64 edges and 68 vertex of which 46 / 68 are part of one of the 23 SCC in 10 ms
Free SCC test removed 23 places
Discarding 23 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Graph (complete) has 22 edges and 45 vertex of which 22 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 22 transition count 22
Applied a total of 21 rules in 22 ms. Remains 22 /68 variables (removed 46) and now considering 22/105 (removed 83) transitions.
// Phase 1: matrix 22 rows 22 cols
[2020-06-02 20:30:21] [INFO ] Computed 11 place invariants in 1 ms
[2020-06-02 20:30:21] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-02 20:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:30:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-02 20:30:21] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints in 2 ms.
[2020-06-02 20:30:21] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-06-02 20:30:21] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2020-06-02 20:30:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
[2020-06-02 20:30:21] [INFO ] Flatten gal took : 62 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ MAPKbis-PT-5310 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ MAPKbis-PT-5310

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 20:30:22 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 21484,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": 11,
"visible_transitions": 0
},
"processed": "A (G (((p1 <= 0) OR (p42 <= 0) OR (p8 <= 0) OR (p28 <= 0) OR (p38 <= 0) OR (p65 <= 0) OR ((1 <= p8) AND (1 <= p25) AND (1 <= p28) AND (1 <= p38) AND ((p2 <= 0) OR (p34 <= 0) OR (p50 <= 0) OR (p55 <= 0))))))",
"processed_size": 215,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 552,
"conflict_clusters": 1,
"places": 68,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 105
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 17,
"problems": 2
},
"type": "invariance",
"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: 173/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 105 transitions, 34 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: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: A (G (((p1 <= 0) OR (p42 <= 0) OR (p8 <= 0) OR (p28 <= 0) OR (p38 <= 0) OR (p65 <= 0) OR ((1 <= p8) AND (1 <= p25) AND (1 <= p28) AND (1 <= p38) AND ((p2 <= 0) OR (p34 <= 0) OR (p50 <= 0) OR (p55 <= 0))))))
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 (((p1 <= 0) OR (p42 <= 0) OR (p8 <= 0) OR (p28 <= 0) OR (p38 <= 0) OR (p65 <= 0) OR ((1 <= p8) AND (1 <= p25) AND (1 <= p28) AND (1 <= p38) AND ((p2 <= 0) OR (p34 <= 0) OR (p50 <= 0) OR (p55 <= 0))))))
lola: processed formula length: 215
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: subprocess will run for 0 seconds at most (--localtimelimit)
lola: local time limit reached - aborting
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 <= p1) AND (1 <= p42) AND (1 <= p8) AND (1 <= p28) AND (1 <= p38) AND (1 <= p65) AND ((p8 <= 0) OR (p25 <= 0) OR (p28 <= 0) OR (p38 <= 0) OR ((1 <= p2) AND (1 <= p34) AND (1 <= p50) AND (1 <= p55))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 17 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 21484 KB
lola: time consumption: 3 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="MAPKbis-PT-5310"
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 MAPKbis-PT-5310, 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-158987852700095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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