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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.250 3600000.00 223903.00 93.00 TTF?FFTTTFFTTTFF 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-158987913600246.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-COL-V80P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913600246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.9K Mar 26 02:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 21:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 21:51 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 4.1K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 25 17:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 45K 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-COL-V80P20N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591137983062

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:46:24] [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-02 22:46:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:46:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 22:46:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 484 ms
[2020-06-02 22:46:24] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2020-06-02 22:46:24] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 12 ms.
[2020-06-02 22:46:24] [INFO ] Computed order based on color domains.
[2020-06-02 22:46:25] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions in 42 ms.
[2020-06-02 22:46:25] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 102 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 157 ms. (steps per millisecond=63 ) properties seen :[0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1]
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0]
[2020-06-02 22:46:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2020-06-02 22:46:25] [INFO ] Computed 7 place invariants in 17 ms
[2020-06-02 22:46:25] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2020-06-02 22:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:46:25] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-02 22:46:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:46:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned unsat
[2020-06-02 22:46:25] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-06-02 22:46:25] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:46:25] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-06-02 22:46:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:46:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 22:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:46:26] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2020-06-02 22:46:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 22:46:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 43 ms returned sat
[2020-06-02 22:46:26] [INFO ] Deduced a trap composed of 5 places in 212 ms
[2020-06-02 22:46:26] [INFO ] Deduced a trap composed of 5 places in 194 ms
[2020-06-02 22:46:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 642 ms
[2020-06-02 22:46:26] [INFO ] Computed and/alt/rep : 2105/40609/367 causal constraints in 84 ms.
[2020-06-02 22:46:30] [INFO ] Added : 150 causal constraints over 30 iterations in 4145 ms. Result :unknown
[2020-06-02 22:46:30] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned unsat
[2020-06-02 22:46:31] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 22:46:31] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 110700 steps, including 1013 resets, run finished after 441 ms. (steps per millisecond=251 ) 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.20 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 4 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 269 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2020-06-02 22:46:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-02 22:46:31] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:46:32] [INFO ] Dead Transitions using invariants and state equation in 1180 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 4781 ms. (steps per millisecond=209 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 549 resets, run finished after 1758 ms. (steps per millisecond=568 ) properties seen :[0]
Interrupted probabilistic random walk after 6515987 steps, run timeout after 30001 ms. (steps per millisecond=217 ) properties seen :[0]
Probabilistic random walk after 6515987 steps, saw 1747723 distinct states, run finished after 30001 ms. (steps per millisecond=217 ) properties seen :[0]
[2020-06-02 22:47:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-02 22:47:09] [INFO ] Computed 5 place invariants in 4 ms
[2020-06-02 22:47:09] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-02 22:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:47:09] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2020-06-02 22:47:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:47:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-02 22:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:47:09] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2020-06-02 22:47:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 22:47:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 30 ms returned sat
[2020-06-02 22:47:10] [INFO ] Deduced a trap composed of 5 places in 221 ms
[2020-06-02 22:47:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2020-06-02 22:47:10] [INFO ] Computed and/alt/rep : 2104/40609/366 causal constraints in 123 ms.
[2020-06-02 22:47:31] [INFO ] Added : 280 causal constraints over 56 iterations in 20996 ms.(timeout) Result :sat
[2020-06-02 22:47:31] [INFO ] Deduced a trap composed of 14 places in 137 ms
[2020-06-02 22:47:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 471 ms
Attempting to minimize the solution found.
Minimization took 306 ms.
Incomplete Parikh walk after 57000 steps, including 731 resets, run finished after 273 ms. (steps per millisecond=208 ) 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 131 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 188 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-02 22:47:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-02 22:47:32] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:47:32] [INFO ] Implicit Places using invariants in 355 ms returned []
[2020-06-02 22:47:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-02 22:47:32] [INFO ] Computed 5 place invariants in 4 ms
[2020-06-02 22:47:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 22:47:34] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1882 ms to find 1 implicit places.
[2020-06-02 22:47:34] [INFO ] Redundant transitions in 87 ms returned []
[2020-06-02 22:47:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-02 22:47:34] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:47:35] [INFO ] Dead Transitions using invariants and state equation in 1198 ms returned []
Starting structural reductions, iteration 1 : 184/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 120 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-02 22:47:35] [INFO ] Redundant transitions in 103 ms returned []
[2020-06-02 22:47:35] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-02 22:47:35] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:47:37] [INFO ] Dead Transitions using invariants and state equation in 1150 ms returned []
Finished structural reductions, in 2 iterations. Remains : 184/185 places, 2107/2107 transitions.
Incomplete random walk after 1000000 steps, including 1424 resets, run finished after 4393 ms. (steps per millisecond=227 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 549 resets, run finished after 1585 ms. (steps per millisecond=630 ) properties seen :[0]
Interrupted probabilistic random walk after 6694888 steps, run timeout after 30001 ms. (steps per millisecond=223 ) properties seen :[0]
Probabilistic random walk after 6694888 steps, saw 1794603 distinct states, run finished after 30001 ms. (steps per millisecond=223 ) properties seen :[0]
[2020-06-02 22:48:13] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-02 22:48:13] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:48:13] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-02 22:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:48:13] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-06-02 22:48:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 22:48:13] [INFO ] [Real]Added 22 Read/Feed constraints in 22 ms returned sat
[2020-06-02 22:48:13] [INFO ] Computed and/alt/rep : 2104/34129/366 causal constraints in 46 ms.
[2020-06-02 22:48:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:48:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-06-02 22:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:48:13] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2020-06-02 22:48:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 39 ms returned sat
[2020-06-02 22:48:13] [INFO ] Deduced a trap composed of 5 places in 141 ms
[2020-06-02 22:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2020-06-02 22:48:13] [INFO ] Computed and/alt/rep : 2104/34129/366 causal constraints in 73 ms.
[2020-06-02 22:48:34] [INFO ] Added : 285 causal constraints over 57 iterations in 20300 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 215 ms.
Incomplete Parikh walk after 50400 steps, including 557 resets, run finished after 181 ms. (steps per millisecond=278 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 137 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 133 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-02 22:48:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-02 22:48:34] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:48:35] [INFO ] Implicit Places using invariants in 317 ms returned []
[2020-06-02 22:48:35] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-02 22:48:35] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-02 22:48:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 22:48:36] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1622 ms to find 1 implicit places.
[2020-06-02 22:48:36] [INFO ] Redundant transitions in 44 ms returned []
[2020-06-02 22:48:36] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-02 22:48:36] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:48:37] [INFO ] Dead Transitions using invariants and state equation in 1125 ms returned []
Starting structural reductions, iteration 1 : 183/184 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.
[2020-06-02 22:48:37] [INFO ] Redundant transitions in 24 ms returned []
[2020-06-02 22:48:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-02 22:48:37] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:48:38] [INFO ] Dead Transitions using invariants and state equation in 1105 ms returned []
Finished structural reductions, in 2 iterations. Remains : 183/184 places, 2107/2107 transitions.
Incomplete random walk after 1000000 steps, including 1423 resets, run finished after 4219 ms. (steps per millisecond=237 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 549 resets, run finished after 1523 ms. (steps per millisecond=656 ) properties seen :[0]
Interrupted probabilistic random walk after 7086365 steps, run timeout after 30001 ms. (steps per millisecond=236 ) properties seen :[0]
Probabilistic random walk after 7086365 steps, saw 1899618 distinct states, run finished after 30001 ms. (steps per millisecond=236 ) properties seen :[0]
[2020-06-02 22:49:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-02 22:49:14] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:49:14] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-02 22:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:49:14] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-06-02 22:49:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:49:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-02 22:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:49:14] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2020-06-02 22:49:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 22:49:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 39 ms returned sat
[2020-06-02 22:49:15] [INFO ] Deduced a trap composed of 5 places in 145 ms
[2020-06-02 22:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2020-06-02 22:49:15] [INFO ] Computed and/alt/rep : 2104/27649/366 causal constraints in 40 ms.
[2020-06-02 22:49:22] [INFO ] Added : 363 causal constraints over 73 iterations in 7292 ms. Result :sat
[2020-06-02 22:49:22] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-06-02 22:49:22] [INFO ] Deduced a trap composed of 14 places in 98 ms
[2020-06-02 22:49:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 563 ms
Attempting to minimize the solution found.
Minimization took 138 ms.
Incomplete Parikh walk after 82600 steps, including 799 resets, run finished after 250 ms. (steps per millisecond=330 ) 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 121 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 117 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-02 22:49:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-02 22:49:23] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:49:23] [INFO ] Implicit Places using invariants in 318 ms returned []
[2020-06-02 22:49:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-02 22:49:23] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:49:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 22:49:25] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
[2020-06-02 22:49:25] [INFO ] Redundant transitions in 27 ms returned []
[2020-06-02 22:49:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-02 22:49:25] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:49:26] [INFO ] Dead Transitions using invariants and state equation in 1101 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 427 ms. (steps per millisecond=234 ) properties seen :[0]
[2020-06-02 22:49:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2020-06-02 22:49:26] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:49:26] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-02 22:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:49:26] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-06-02 22:49:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:49:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-02 22:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:49:26] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2020-06-02 22:49:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 22:49:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 47 ms returned sat
[2020-06-02 22:49:27] [INFO ] Deduced a trap composed of 5 places in 141 ms
[2020-06-02 22:49:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2020-06-02 22:49:27] [INFO ] Computed and/alt/rep : 2104/27649/366 causal constraints in 54 ms.
[2020-06-02 22:49:34] [INFO ] Added : 363 causal constraints over 73 iterations in 7274 ms. Result :sat
[2020-06-02 22:49:34] [INFO ] Deduced a trap composed of 15 places in 103 ms
[2020-06-02 22:49:34] [INFO ] Deduced a trap composed of 14 places in 104 ms
[2020-06-02 22:49:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 530 ms
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 16 ms. Remains 179 /183 variables (removed 4) and now considering 365/2107 (removed 1742) transitions.
// Phase 1: matrix 365 rows 179 cols
[2020-06-02 22:49:35] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:49:35] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2020-06-02 22:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:49:35] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2020-06-02 22:49:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:49:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-02 22:49:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:49:35] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2020-06-02 22:49:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-02 22:49:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 34 ms returned sat
[2020-06-02 22:49:35] [INFO ] Computed and/alt/rep : 362/3702/362 causal constraints in 16 ms.
[2020-06-02 22:49:41] [INFO ] Added : 350 causal constraints over 70 iterations in 5976 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-06-02 22:49:41] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2020-06-02 22:49:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
[2020-06-02 22:49:41] [INFO ] Flatten gal took : 275 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-COL-V80P20N10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-COL-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": "Tue Jun 2 22:49:42 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 70988,
"runtime": 3.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 ((p0 <= 1)))",
"processed_size": 17,
"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"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"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 ((p0 <= 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 ((p0 <= 1)))
lola: processed formula length: 17
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: 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: (p0 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: memory consumption: 70988 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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="BridgeAndVehicles-COL-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-COL-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-158987913600246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P20N10.tgz
mv BridgeAndVehicles-COL-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 ;