fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987913800406
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BridgeAndVehicles-PT-V80P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.500 3600000.00 201744.00 156.40 TTF?FFTTFTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913800406.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 BridgeAndVehicles-PT-V80P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913800406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 13K Mar 26 02:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Mar 26 02:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 195K Mar 25 21:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 573K Mar 25 21:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 142K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 420K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 25 17:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 25 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 47K Mar 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 137K Mar 25 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591150734923

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:18:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 02:18:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:18:57] [INFO ] Load time of PNML (sax parser for PT used): 390 ms
[2020-06-03 02:18:57] [INFO ] Transformed 188 places.
[2020-06-03 02:18:57] [INFO ] Transformed 2108 transitions.
[2020-06-03 02:18:57] [INFO ] Parsed PT model containing 188 places and 2108 transitions in 514 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 210 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 189 ms. (steps per millisecond=52 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1]
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 02:18:58] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2020-06-03 02:18:58] [INFO ] Computed 7 place invariants in 37 ms
[2020-06-03 02:18:58] [INFO ] [Real]Absence check using 7 positive place invariants in 50 ms returned sat
[2020-06-03 02:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:18:59] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2020-06-03 02:18:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:18:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned unsat
[2020-06-03 02:18:59] [INFO ] [Real]Absence check using 7 positive place invariants in 30 ms returned unsat
[2020-06-03 02:18:59] [INFO ] [Real]Absence check using 7 positive place invariants in 23 ms returned sat
[2020-06-03 02:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:19:00] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2020-06-03 02:19:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:19:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2020-06-03 02:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:19:00] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2020-06-03 02:19:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 02:19:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 105 ms returned sat
[2020-06-03 02:19:01] [INFO ] Deduced a trap composed of 5 places in 623 ms
[2020-06-03 02:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 807 ms
[2020-06-03 02:19:01] [INFO ] Computed and/alt/rep : 2105/40609/367 causal constraints in 392 ms.
[2020-06-03 02:19:05] [INFO ] Added : 190 causal constraints over 38 iterations in 3530 ms. Result :unknown
[2020-06-03 02:19:05] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 02:19:05] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 02:19:05] [INFO ] [Real]Absence check using 7 positive place invariants in 19 ms returned unsat
[2020-06-03 02:19:05] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 02:19:05] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 02:19:05] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P20N10-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 105600 steps, including 1005 resets, run finished after 527 ms. (steps per millisecond=200 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 188/188 places, 2108/2108 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 186 transition count 2108
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 305 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2020-06-03 02:19:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-03 02:19:06] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-03 02:19:07] [INFO ] Dead Transitions using invariants and state equation in 1231 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 1000000 steps, including 1423 resets, run finished after 4514 ms. (steps per millisecond=221 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 550 resets, run finished after 1760 ms. (steps per millisecond=568 ) properties seen :[0]
Interrupted probabilistic random walk after 6105679 steps, run timeout after 30001 ms. (steps per millisecond=203 ) properties seen :[0]
Probabilistic random walk after 6105679 steps, saw 1637945 distinct states, run finished after 30002 ms. (steps per millisecond=203 ) properties seen :[0]
[2020-06-03 02:19:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-03 02:19:43] [INFO ] Computed 5 place invariants in 5 ms
[2020-06-03 02:19:43] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-03 02:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:19:43] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-06-03 02:19:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:19:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-03 02:19:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:19:44] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2020-06-03 02:19:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 02:19:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 42 ms returned sat
[2020-06-03 02:19:44] [INFO ] Deduced a trap composed of 5 places in 390 ms
[2020-06-03 02:19:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2020-06-03 02:19:44] [INFO ] Computed and/alt/rep : 2104/40609/366 causal constraints in 101 ms.
[2020-06-03 02:20:05] [INFO ] Added : 255 causal constraints over 51 iterations in 20932 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 188 ms.
Incomplete Parikh walk after 55100 steps, including 979 resets, run finished after 301 ms. (steps per millisecond=183 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 232 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 220 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-03 02:20:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-03 02:20:06] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 02:20:07] [INFO ] Implicit Places using invariants in 394 ms returned []
[2020-06-03 02:20:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-03 02:20:07] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-03 02:20:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 02:20:09] [INFO ] Implicit Places using invariants and state equation in 2051 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2462 ms to find 2 implicit places.
[2020-06-03 02:20:09] [INFO ] Redundant transitions in 117 ms returned []
[2020-06-03 02:20:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-03 02:20:09] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 02:20:10] [INFO ] Dead Transitions using invariants and state equation in 1267 ms returned []
Starting structural reductions, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 166 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-03 02:20:11] [INFO ] Redundant transitions in 142 ms returned []
[2020-06-03 02:20:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-03 02:20:11] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 02:20:13] [INFO ] Dead Transitions using invariants and state equation in 2281 ms returned []
Finished structural reductions, in 2 iterations. Remains : 183/185 places, 2107/2107 transitions.
Incomplete random walk after 1000000 steps, including 1423 resets, run finished after 4244 ms. (steps per millisecond=235 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 550 resets, run finished after 1425 ms. (steps per millisecond=701 ) properties seen :[0]
Interrupted probabilistic random walk after 6815922 steps, run timeout after 30001 ms. (steps per millisecond=227 ) properties seen :[0]
Probabilistic random walk after 6815922 steps, saw 1828529 distinct states, run finished after 30001 ms. (steps per millisecond=227 ) properties seen :[0]
[2020-06-03 02:20:48] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-03 02:20:48] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 02:20:49] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-03 02:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:49] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2020-06-03 02:20:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:20:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-03 02:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:50] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2020-06-03 02:20:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 02:20:50] [INFO ] [Nat]Added 22 Read/Feed constraints in 135 ms returned sat
[2020-06-03 02:20:50] [INFO ] Deduced a trap composed of 5 places in 295 ms
[2020-06-03 02:20:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2020-06-03 02:20:50] [INFO ] Computed and/alt/rep : 2104/27649/366 causal constraints in 61 ms.
[2020-06-03 02:21:06] [INFO ] Added : 355 causal constraints over 71 iterations in 15943 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 612 ms.
Incomplete Parikh walk after 44800 steps, including 544 resets, run finished after 156 ms. (steps per millisecond=287 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 120 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 119 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-03 02:21:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-03 02:21:07] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 02:21:08] [INFO ] Implicit Places using invariants in 526 ms returned []
[2020-06-03 02:21:08] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-03 02:21:08] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 02:21:10] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
[2020-06-03 02:21:10] [INFO ] Redundant transitions in 29 ms returned []
[2020-06-03 02:21:10] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-03 02:21:10] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 02:21:13] [INFO ] Dead Transitions using invariants and state equation in 3081 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Incomplete random walk after 100000 steps, including 142 resets, run finished after 405 ms. (steps per millisecond=246 ) properties seen :[0]
[2020-06-03 02:21:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-03 02:21:13] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 02:21:13] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-03 02:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:14] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2020-06-03 02:21:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-03 02:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:15] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2020-06-03 02:21:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 02:21:15] [INFO ] [Nat]Added 22 Read/Feed constraints in 126 ms returned sat
[2020-06-03 02:21:15] [INFO ] Deduced a trap composed of 5 places in 659 ms
[2020-06-03 02:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 705 ms
[2020-06-03 02:21:15] [INFO ] Computed and/alt/rep : 2104/27649/366 causal constraints in 69 ms.
[2020-06-03 02:21:29] [INFO ] Added : 355 causal constraints over 71 iterations in 13522 ms. Result :sat
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 181 transition count 367
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1744 place count 181 transition count 365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1746 place count 179 transition count 365
Applied a total of 1746 rules in 21 ms. Remains 179 /183 variables (removed 4) and now considering 365/2107 (removed 1742) transitions.
// Phase 1: matrix 365 rows 179 cols
[2020-06-03 02:21:29] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 02:21:29] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-03 02:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:29] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2020-06-03 02:21:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 02:21:29] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2020-06-03 02:21:29] [INFO ] Computed and/alt/rep : 362/3702/362 causal constraints in 31 ms.
[2020-06-03 02:21:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 57 ms returned sat
[2020-06-03 02:21:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:30] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2020-06-03 02:21:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2020-06-03 02:21:30] [INFO ] Computed and/alt/rep : 362/3702/362 causal constraints in 45 ms.
[2020-06-03 02:21:34] [INFO ] Added : 349 causal constraints over 70 iterations in 4280 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 60 ms.
[2020-06-03 02:21:34] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 21 ms.
[2020-06-03 02:21:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
[2020-06-03 02:21:35] [INFO ] Flatten gal took : 445 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V80P20N10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V80P20N10

{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 02:21:35 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 71752,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p83 <= 1)))",
"processed_size": 18,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 15624,
"conflict_clusters": 2,
"places": 183,
"places_significant": 178,
"singleton_clusters": 0,
"transitions": 2107
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2290/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5856
lola: finding significant places
lola: 183 places, 2107 transitions, 178 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 ReachabilityCardinality.xml
lola: E (F ((p83 <= 1)))
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 ((p83 <= 1)))
lola: processed formula length: 18
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: memory consumption: 71752 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
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: (p83 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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="BridgeAndVehicles-PT-V80P20N10"
export BK_EXAMINATION="ReachabilityCardinality"
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 BridgeAndVehicles-PT-V80P20N10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913800406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;