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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.360 3600000.00 236728.00 163.20 FTFFTFTF?TFTFTFT 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-158987913600278.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-V80P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913600278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 26 02:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 22:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:27 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.0K 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.8K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 25 17:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 25 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 14:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:15 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-V80P50N20-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591141532332

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:45:34] [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 23:45:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:45:34] [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 23:45:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 494 ms
[2020-06-02 23:45:34] [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 23:45:34] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 20 ms.
[2020-06-02 23:45:34] [INFO ] Computed order based on color domains.
[2020-06-02 23:45:34] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions in 54 ms.
[2020-06-02 23:45:34] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 136 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 228 ms. (steps per millisecond=43 ) properties seen :[1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1]
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0]
[2020-06-02 23:45:35] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2020-06-02 23:45:35] [INFO ] Computed 7 place invariants in 19 ms
[2020-06-02 23:45:35] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned unsat
[2020-06-02 23:45:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 23:45:35] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 23:45:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:45:35] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2020-06-02 23:45:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:45:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-02 23:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:45:36] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2020-06-02 23:45:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:45:36] [INFO ] [Nat]Added 42 Read/Feed constraints in 65 ms returned sat
[2020-06-02 23:45:36] [INFO ] Computed and/alt/rep : 3725/99059/407 causal constraints in 200 ms.
[2020-06-02 23:45:40] [INFO ] Added : 200 causal constraints over 40 iterations in 4634 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-02 23:45:40] [INFO ] [Real]Absence check using 7 positive place invariants in 22 ms returned sat
[2020-06-02 23:45:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:45:41] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-06-02 23:45:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:45:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 23 ms returned unsat
[2020-06-02 23:45:41] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-02 23:45:41] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 198/198 places, 3728/3728 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Applied a total of 1 rules in 722 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
[2020-06-02 23:45:41] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2020-06-02 23:45:41] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-02 23:45:44] [INFO ] Dead Transitions using invariants and state equation in 2347 ms returned []
Finished structural reductions, in 1 iterations. Remains : 196/198 places, 3728/3728 transitions.
Incomplete random walk after 1000000 steps, including 1455 resets, run finished after 8096 ms. (steps per millisecond=123 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 501 resets, run finished after 2882 ms. (steps per millisecond=346 ) properties seen :[0]
Interrupted probabilistic random walk after 3713790 steps, run timeout after 30001 ms. (steps per millisecond=123 ) properties seen :[0]
Probabilistic random walk after 3713790 steps, saw 970118 distinct states, run finished after 30001 ms. (steps per millisecond=123 ) properties seen :[0]
[2020-06-02 23:46:25] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2020-06-02 23:46:25] [INFO ] Computed 5 place invariants in 6 ms
[2020-06-02 23:46:25] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-02 23:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:46:25] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-02 23:46:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:46:25] [INFO ] [Real]Added 42 Read/Feed constraints in 36 ms returned sat
[2020-06-02 23:46:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:46:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-02 23:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:46:25] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2020-06-02 23:46:25] [INFO ] [Nat]Added 42 Read/Feed constraints in 82 ms returned sat
[2020-06-02 23:46:26] [INFO ] Deduced a trap composed of 24 places in 317 ms
[2020-06-02 23:46:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2020-06-02 23:46:26] [INFO ] Computed and/alt/rep : 3725/99059/407 causal constraints in 195 ms.
[2020-06-02 23:46:46] [INFO ] Added : 275 causal constraints over 55 iterations in 20218 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 211 ms.
Incomplete Parikh walk after 250300 steps, including 1218 resets, run finished after 2405 ms. (steps per millisecond=104 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 528 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 196/196 places, 3728/3728 transitions.
Starting structural reductions, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 590 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2020-06-02 23:46:50] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2020-06-02 23:46:50] [INFO ] Computed 5 place invariants in 8 ms
[2020-06-02 23:46:51] [INFO ] Implicit Places using invariants in 956 ms returned []
[2020-06-02 23:46:51] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2020-06-02 23:46:51] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 23:46:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:46:53] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3154 ms to find 2 implicit places.
[2020-06-02 23:46:53] [INFO ] Redundant transitions in 205 ms returned []
[2020-06-02 23:46:53] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:46:53] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:46:57] [INFO ] Dead Transitions using invariants and state equation in 4036 ms returned []
Starting structural reductions, iteration 1 : 194/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 512 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2020-06-02 23:46:58] [INFO ] Redundant transitions in 146 ms returned []
[2020-06-02 23:46:58] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:46:58] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:47:00] [INFO ] Dead Transitions using invariants and state equation in 2529 ms returned []
Finished structural reductions, in 2 iterations. Remains : 194/196 places, 3728/3728 transitions.
Incomplete random walk after 1000000 steps, including 1455 resets, run finished after 7606 ms. (steps per millisecond=131 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 502 resets, run finished after 2656 ms. (steps per millisecond=376 ) properties seen :[0]
Interrupted probabilistic random walk after 3991509 steps, run timeout after 30001 ms. (steps per millisecond=133 ) properties seen :[0]
Probabilistic random walk after 3991509 steps, saw 1042310 distinct states, run finished after 30013 ms. (steps per millisecond=132 ) properties seen :[0]
[2020-06-02 23:47:41] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:47:41] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:47:41] [INFO ] [Real]Absence check using 5 positive place invariants in 34 ms returned sat
[2020-06-02 23:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:47:41] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2020-06-02 23:47:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:47:41] [INFO ] [Real]Added 42 Read/Feed constraints in 75 ms returned sat
[2020-06-02 23:47:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:47:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 53 ms returned sat
[2020-06-02 23:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:47:42] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-06-02 23:47:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 151 ms returned sat
[2020-06-02 23:47:43] [INFO ] Deduced a trap composed of 5 places in 911 ms
[2020-06-02 23:47:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 972 ms
[2020-06-02 23:47:43] [INFO ] Computed and/alt/rep : 3725/86099/407 causal constraints in 134 ms.
[2020-06-02 23:48:02] [INFO ] Added : 370 causal constraints over 74 iterations in 18732 ms. Result :unknown
Incomplete Parikh walk after 244300 steps, including 1227 resets, run finished after 1880 ms. (steps per millisecond=129 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 525 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/194 places, 3728/3728 transitions.
Starting structural reductions, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 557 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2020-06-02 23:48:05] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:48:05] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:48:06] [INFO ] Implicit Places using invariants in 1742 ms returned []
[2020-06-02 23:48:06] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:48:06] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 23:48:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:48:08] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 3780 ms to find 0 implicit places.
[2020-06-02 23:48:08] [INFO ] Redundant transitions in 77 ms returned []
[2020-06-02 23:48:08] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:48:08] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:48:12] [INFO ] Dead Transitions using invariants and state equation in 3242 ms returned []
Finished structural reductions, in 1 iterations. Remains : 194/194 places, 3728/3728 transitions.
Incomplete random walk after 100000 steps, including 145 resets, run finished after 754 ms. (steps per millisecond=132 ) properties seen :[0]
[2020-06-02 23:48:12] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:48:12] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:48:13] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-06-02 23:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:48:13] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2020-06-02 23:48:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:48:13] [INFO ] [Real]Added 42 Read/Feed constraints in 32 ms returned sat
[2020-06-02 23:48:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:48:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-02 23:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:48:13] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-06-02 23:48:13] [INFO ] [Nat]Added 42 Read/Feed constraints in 102 ms returned sat
[2020-06-02 23:48:13] [INFO ] Deduced a trap composed of 5 places in 265 ms
[2020-06-02 23:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2020-06-02 23:48:13] [INFO ] Computed and/alt/rep : 3725/86099/407 causal constraints in 97 ms.
[2020-06-02 23:48:32] [INFO ] Added : 370 causal constraints over 74 iterations in 18320 ms. Result :unknown
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 194 transition count 410
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3320 place count 194 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3322 place count 192 transition count 408
Applied a total of 3322 rules in 42 ms. Remains 192 /194 variables (removed 2) and now considering 408/3728 (removed 3320) transitions.
// Phase 1: matrix 408 rows 192 cols
[2020-06-02 23:48:32] [INFO ] Computed 5 place invariants in 6 ms
[2020-06-02 23:48:32] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-02 23:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:48:32] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-02 23:48:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-02 23:48:32] [INFO ] [Real]Added 2 Read/Feed constraints in 4 ms returned sat
[2020-06-02 23:48:32] [INFO ] Computed and/alt/rep : 405/6735/405 causal constraints in 36 ms.
[2020-06-02 23:48:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:48:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-02 23:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:48:32] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2020-06-02 23:48:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 57 ms returned sat
[2020-06-02 23:48:32] [INFO ] Computed and/alt/rep : 405/6735/405 causal constraints in 20 ms.
[2020-06-02 23:48:45] [INFO ] Added : 401 causal constraints over 83 iterations in 12704 ms. Result :sat
[2020-06-02 23:48:45] [INFO ] Deduced a trap composed of 24 places in 31 ms
[2020-06-02 23:48:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
Attempting to minimize the solution found.
Minimization took 109 ms.
[2020-06-02 23:48:45] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2020-06-02 23:48:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 43 ms.
[2020-06-02 23:48:46] [INFO ] Flatten gal took : 508 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-COL-V80P50N20 @ 3569 seconds
vrfy: finished
info: timeLeft: 3565
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-COL-V80P50N20

{
"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=3569",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 23:48:47 2020
",
"timelimit": 3569
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 139900,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p0) OR ((1 <= p83) AND (3 <= p0)))))",
"processed_size": 50,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 28506,
"conflict_clusters": 3,
"places": 194,
"places_significant": 189,
"singleton_clusters": 0,
"transitions": 3728
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3569 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: 3922/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6208
lola: finding significant places
lola: 194 places, 3728 transitions, 189 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: (2 <= p192 + p193)
lola: A (G (((1 <= p0) OR ((1 <= p83) AND (3 <= p0)))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p0) OR ((1 <= p83) AND (3 <= p0)))))
lola: processed formula length: 50
lola: 2 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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 0) AND ((p83 <= 0) OR (p0 <= 2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: memory consumption: 139900 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
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-V80P50N20"
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-V80P50N20, 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-158987913600278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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