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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.250 3600000.00 184409.00 148.90 ?FFTTFFTFTFTTTFT 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-158987913600230.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-V50P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913600230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 21:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 21:33 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 3.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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.3K Mar 25 17:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 17:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 13:08 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 42K 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-V50P50N20-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591136111431

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:15:14] [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:15:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:15:14] [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:15:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2020-06-02 22:15:14] [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:15:14] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 72 ms.
[2020-06-02 22:15:14] [INFO ] Computed order based on color domains.
[2020-06-02 22:15:14] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions in 116 ms.
[2020-06-02 22:15:14] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 203 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 207 ms. (steps per millisecond=48 ) properties seen :[0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0]
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-02 22:15:15] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2020-06-02 22:15:15] [INFO ] Computed 7 place invariants in 15 ms
[2020-06-02 22:15:15] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2020-06-02 22:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:15:16] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2020-06-02 22:15:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:15:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-02 22:15:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:15:16] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-06-02 22:15:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 22:15:16] [INFO ] [Nat]Added 42 Read/Feed constraints in 87 ms returned sat
[2020-06-02 22:15:16] [INFO ] Computed and/alt/rep : 2345/58949/287 causal constraints in 187 ms.
[2020-06-02 22:15:21] [INFO ] Added : 190 causal constraints over 38 iterations in 4678 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-02 22:15:21] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-06-02 22:15:21] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned unsat
[2020-06-02 22:15:21] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-06-02 22:15:21] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 22:15:21] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:15:21] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-06-02 22:15:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:15:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 28 ms returned unsat
[2020-06-02 22:15:21] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V50P50N20-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 8 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 2348/2348 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Applied a total of 1 rules in 335 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2020-06-02 22:15:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2020-06-02 22:15:21] [INFO ] Computed 5 place invariants in 8 ms
[2020-06-02 22:15:23] [INFO ] Dead Transitions using invariants and state equation in 1350 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/138 places, 2348/2348 transitions.
Incomplete random walk after 1000000 steps, including 2316 resets, run finished after 5481 ms. (steps per millisecond=182 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 839 resets, run finished after 2186 ms. (steps per millisecond=457 ) properties seen :[0]
Interrupted probabilistic random walk after 5910940 steps, run timeout after 30001 ms. (steps per millisecond=197 ) properties seen :[0]
Probabilistic random walk after 5910940 steps, saw 1522572 distinct states, run finished after 30002 ms. (steps per millisecond=197 ) properties seen :[0]
[2020-06-02 22:16:00] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2020-06-02 22:16:00] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:16:00] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-02 22:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:16:01] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2020-06-02 22:16:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:16:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-02 22:16:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:16:01] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2020-06-02 22:16:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 22:16:01] [INFO ] [Nat]Added 42 Read/Feed constraints in 82 ms returned sat
[2020-06-02 22:16:01] [INFO ] Deduced a trap composed of 25 places in 394 ms
[2020-06-02 22:16:02] [INFO ] Deduced a trap composed of 24 places in 345 ms
[2020-06-02 22:16:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 787 ms
[2020-06-02 22:16:02] [INFO ] Computed and/alt/rep : 2345/58949/287 causal constraints in 123 ms.
[2020-06-02 22:16:16] [INFO ] Added : 245 causal constraints over 49 iterations in 14899 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 250 ms.
Incomplete Parikh walk after 68800 steps, including 1002 resets, run finished after 377 ms. (steps per millisecond=182 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 198 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 336 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2020-06-02 22:16:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2020-06-02 22:16:18] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:16:18] [INFO ] Implicit Places using invariants in 366 ms returned []
[2020-06-02 22:16:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2020-06-02 22:16:18] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:16:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 22:16:19] [INFO ] Implicit Places using invariants and state equation in 860 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1237 ms to find 1 implicit places.
[2020-06-02 22:16:19] [INFO ] Redundant transitions in 94 ms returned []
[2020-06-02 22:16:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-02 22:16:19] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:16:20] [INFO ] Dead Transitions using invariants and state equation in 1162 ms returned []
Starting structural reductions, iteration 1 : 135/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 194 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2020-06-02 22:16:20] [INFO ] Redundant transitions in 115 ms returned []
[2020-06-02 22:16:20] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-02 22:16:20] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:16:22] [INFO ] Dead Transitions using invariants and state equation in 1261 ms returned []
Finished structural reductions, in 2 iterations. Remains : 135/136 places, 2348/2348 transitions.
Incomplete random walk after 1000000 steps, including 2316 resets, run finished after 5152 ms. (steps per millisecond=194 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 839 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties seen :[0]
Interrupted probabilistic random walk after 6002151 steps, run timeout after 30001 ms. (steps per millisecond=200 ) properties seen :[0]
Probabilistic random walk after 6002151 steps, saw 1542897 distinct states, run finished after 30001 ms. (steps per millisecond=200 ) properties seen :[0]
[2020-06-02 22:16:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-02 22:16:59] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:16:59] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-02 22:16:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:16:59] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-06-02 22:16:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 22:16:59] [INFO ] [Real]Added 42 Read/Feed constraints in 24 ms returned sat
[2020-06-02 22:16:59] [INFO ] Computed and/alt/rep : 2345/56399/287 causal constraints in 72 ms.
[2020-06-02 22:16:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:16:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-02 22:16:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:16:59] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2020-06-02 22:16:59] [INFO ] [Nat]Added 42 Read/Feed constraints in 88 ms returned sat
[2020-06-02 22:16:59] [INFO ] Computed and/alt/rep : 2345/56399/287 causal constraints in 86 ms.
[2020-06-02 22:17:13] [INFO ] Added : 245 causal constraints over 49 iterations in 14051 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 152 ms.
Incomplete Parikh walk after 26600 steps, including 423 resets, run finished after 95 ms. (steps per millisecond=280 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 174 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2348/2348 transitions.
Starting structural reductions, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 149 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2020-06-02 22:17:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-02 22:17:14] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:17:14] [INFO ] Implicit Places using invariants in 335 ms returned []
[2020-06-02 22:17:14] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-02 22:17:14] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:17:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 22:17:15] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
[2020-06-02 22:17:15] [INFO ] Redundant transitions in 40 ms returned []
[2020-06-02 22:17:15] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-02 22:17:15] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:17:16] [INFO ] Dead Transitions using invariants and state equation in 1125 ms returned []
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2348/2348 transitions.
Incomplete random walk after 100000 steps, including 231 resets, run finished after 496 ms. (steps per millisecond=201 ) properties seen :[0]
[2020-06-02 22:17:17] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-02 22:17:17] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:17:17] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-02 22:17:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:17:17] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-06-02 22:17:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 22:17:17] [INFO ] [Real]Added 42 Read/Feed constraints in 48 ms returned sat
[2020-06-02 22:17:17] [INFO ] Computed and/alt/rep : 2345/56399/287 causal constraints in 51 ms.
[2020-06-02 22:17:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:17:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-02 22:17:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:17:17] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-02 22:17:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 96 ms returned sat
[2020-06-02 22:17:17] [INFO ] Computed and/alt/rep : 2345/56399/287 causal constraints in 67 ms.
[2020-06-02 22:17:31] [INFO ] Added : 245 causal constraints over 49 iterations in 13839 ms. Result :sat
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 135 transition count 290
Applied a total of 2058 rules in 19 ms. Remains 135 /135 variables (removed 0) and now considering 290/2348 (removed 2058) transitions.
// Phase 1: matrix 290 rows 135 cols
[2020-06-02 22:17:31] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:17:31] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-02 22:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:17:31] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2020-06-02 22:17:31] [INFO ] Computed and/alt/rep : 287/7161/287 causal constraints in 26 ms.
[2020-06-02 22:17:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:17:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-06-02 22:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:17:32] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-06-02 22:17:32] [INFO ] Computed and/alt/rep : 287/7161/287 causal constraints in 16 ms.
[2020-06-02 22:17:42] [INFO ] Added : 268 causal constraints over 55 iterations in 9942 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 123 ms.
[2020-06-02 22:17:42] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2020-06-02 22:17:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 37 ms.
[2020-06-02 22:17:42] [INFO ] Flatten gal took : 173 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-COL-V50P50N20 @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-COL-V50P50N20

{
"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:17:42 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 76020,
"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": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((p0 <= p105) AND (p133 + p134 + 1 <= p106) AND ((1 <= p52)))))",
"processed_size": 69,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 17987,
"conflict_clusters": 3,
"places": 135,
"places_significant": 130,
"singleton_clusters": 0,
"transitions": 2348
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"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: 2483/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4320
lola: finding significant places
lola: 135 places, 2348 transitions, 130 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: LP says that atomic proposition is always false: (3 <= p110 + p111)
lola: E (F (((p0 <= p105) AND (p133 + p134 + 1 <= p106) AND ((1 <= p52)))))
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 <= p105) AND (p133 + p134 + 1 <= p106) AND ((1 <= p52)))))
lola: processed formula length: 69
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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= p105) AND (p133 + p134 + 1 <= p106) AND ((1 <= p52)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: memory consumption: 76020 KB
lola: time consumption: 4 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-V50P50N20"
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-V50P50N20, 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-158987913600230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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