About the Execution of 2020-gold for BridgeAndVehicles-COL-V20P10N50
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4337.140 | 3600000.00 | 839949.00 | 161.20 | TTTFFFTTFTFTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038176700020.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BridgeAndVehicles-COL-V20P10N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176700020
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 02:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 11:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 11:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 41K May 5 16:51 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-V20P10N50-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1620925068050
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 16:57:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 16:57:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 16:57:49] [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.
[2021-05-13 16:57:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 632 ms
[2021-05-13 16:57:50] [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,
[2021-05-13 16:57:50] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 35 ms.
[2021-05-13 16:57:50] [INFO ] Computed order based on color domains.
[2021-05-13 16:57:50] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions in 41 ms.
[2021-05-13 16:57:50] [INFO ] Unfolded HLPN properties in 2 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 214 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1129 ms. (steps per millisecond=8 ) properties seen :[0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1]
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 400 ms. (steps per millisecond=25 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 996 ms. (steps per millisecond=10 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 714 ms. (steps per millisecond=14 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 602 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 442 ms. (steps per millisecond=22 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 1541 ms. (steps per millisecond=6 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 1068 ms. (steps per millisecond=9 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2021-05-13 16:57:57] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2021-05-13 16:57:57] [INFO ] Computed 7 place invariants in 31 ms
[2021-05-13 16:57:57] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned unsat
[2021-05-13 16:57:58] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned unsat
[2021-05-13 16:57:58] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 16:57:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:57:58] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2021-05-13 16:57:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:57:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2021-05-13 16:57:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:57:58] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-13 16:57:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 16:57:58] [INFO ] [Nat]Added 102 Read/Feed constraints in 48 ms returned sat
[2021-05-13 16:57:58] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 277 ms.
[2021-05-13 16:58:03] [INFO ] Added : 210 causal constraints over 42 iterations in 4693 ms. Result :unknown
[2021-05-13 16:58:03] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 16:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:03] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-13 16:58:03] [INFO ] [Real]Added 102 Read/Feed constraints in 47 ms returned sat
[2021-05-13 16:58:03] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 189 ms.
[2021-05-13 16:58:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:58:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-13 16:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:04] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-13 16:58:04] [INFO ] [Nat]Added 102 Read/Feed constraints in 28 ms returned sat
[2021-05-13 16:58:04] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 221 ms.
[2021-05-13 16:58:08] [INFO ] Added : 215 causal constraints over 43 iterations in 4641 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-13 16:58:08] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 16:58:09] [INFO ] [Real]Absence check using 7 positive place invariants in 27 ms returned unsat
[2021-05-13 16:58:09] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned unsat
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 1204800 steps, including 7941 resets, run finished after 11776 ms. (steps per millisecond=102 ) properties seen :[0, 0] could not realise parikh vector
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 2228/2228 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 106 transition count 2228
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 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 103 transition count 2226
Applied a total of 7 rules in 582 ms. Remains 103 /108 variables (removed 5) and now considering 2226/2228 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/108 places, 2226/2228 transitions.
Incomplete random walk after 1000000 steps, including 7938 resets, run finished after 7109 ms. (steps per millisecond=140 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4166 resets, run finished after 3791 ms. (steps per millisecond=263 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4164 resets, run finished after 3796 ms. (steps per millisecond=263 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 5843900 steps, run timeout after 30001 ms. (steps per millisecond=194 ) properties seen :[0, 0]
Probabilistic random walk after 5843900 steps, saw 1550203 distinct states, run finished after 30001 ms. (steps per millisecond=194 ) properties seen :[0, 0]
[2021-05-13 16:59:06] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2021-05-13 16:59:06] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 16:59:06] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2021-05-13 16:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:59:06] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-13 16:59:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 16:59:06] [INFO ] [Real]Added 102 Read/Feed constraints in 46 ms returned sat
[2021-05-13 16:59:06] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 102 ms.
[2021-05-13 16:59:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:59:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 16:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:59:06] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2021-05-13 16:59:06] [INFO ] [Nat]Added 102 Read/Feed constraints in 30 ms returned sat
[2021-05-13 16:59:06] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 100 ms.
[2021-05-13 16:59:13] [INFO ] Added : 195 causal constraints over 39 iterations in 6969 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 114 ms.
[2021-05-13 16:59:14] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 16:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:59:14] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-13 16:59:14] [INFO ] [Real]Added 102 Read/Feed constraints in 30 ms returned sat
[2021-05-13 16:59:14] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 111 ms.
[2021-05-13 16:59:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:59:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 16:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:59:14] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-13 16:59:14] [INFO ] [Nat]Added 102 Read/Feed constraints in 26 ms returned sat
[2021-05-13 16:59:14] [INFO ] Computed and/alt/rep : 2223/114349/285 causal constraints in 112 ms.
[2021-05-13 16:59:30] [INFO ] Added : 255 causal constraints over 51 iterations in 15705 ms. Result :unknown
Incomplete Parikh walk after 1225400 steps, including 10525 resets, run finished after 12361 ms. (steps per millisecond=99 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 511700 steps, including 4767 resets, run finished after 5277 ms. (steps per millisecond=96 ) properties seen :[0, 0] could not realise parikh vector
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 301 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2226/2226 transitions.
Starting structural reductions, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 278 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2021-05-13 16:59:48] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2021-05-13 16:59:48] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 16:59:48] [INFO ] Implicit Places using invariants in 365 ms returned []
[2021-05-13 16:59:48] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2021-05-13 16:59:48] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 16:59:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 16:59:49] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1433 ms to find 2 implicit places.
[2021-05-13 16:59:50] [INFO ] Redundant transitions in 159 ms returned []
[2021-05-13 16:59:50] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 16:59:50] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 16:59:51] [INFO ] Dead Transitions using invariants and state equation in 1211 ms returned []
Starting structural reductions, iteration 1 : 101/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 180 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2021-05-13 16:59:51] [INFO ] Redundant transitions in 130 ms returned []
[2021-05-13 16:59:51] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 16:59:51] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 16:59:52] [INFO ] Dead Transitions using invariants and state equation in 1216 ms returned []
Finished structural reductions, in 2 iterations. Remains : 101/103 places, 2226/2226 transitions.
Incomplete random walk after 1000000 steps, including 7939 resets, run finished after 6874 ms. (steps per millisecond=145 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4166 resets, run finished after 3538 ms. (steps per millisecond=282 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4167 resets, run finished after 3984 ms. (steps per millisecond=251 ) properties seen :[0, 0]
Probably explored full state space saw : 1577944 states, properties seen :[0, 0]
Probabilistic random walk after 5950637 steps, saw 1577944 distinct states, run finished after 28756 ms. (steps per millisecond=206 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 5874812 steps, run timeout after 30001 ms. (steps per millisecond=195 ) properties seen :[0, 0]
Exhaustive walk after 5874812 steps, saw 1558367 distinct states, run finished after 30002 ms. (steps per millisecond=195 ) properties seen :[0, 0]
[2021-05-13 17:01:06] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 17:01:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 17:01:06] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 17:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:01:06] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-13 17:01:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 17:01:06] [INFO ] [Real]Added 102 Read/Feed constraints in 46 ms returned sat
[2021-05-13 17:01:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:01:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 17:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:01:06] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-13 17:01:06] [INFO ] [Nat]Added 102 Read/Feed constraints in 47 ms returned sat
[2021-05-13 17:01:06] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 123 ms.
[2021-05-13 17:01:12] [INFO ] Added : 195 causal constraints over 39 iterations in 6226 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 124 ms.
[2021-05-13 17:01:12] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 17:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:01:13] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-13 17:01:13] [INFO ] [Real]Added 102 Read/Feed constraints in 20 ms returned sat
[2021-05-13 17:01:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:01:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 17:01:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:01:13] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-13 17:01:13] [INFO ] [Nat]Added 102 Read/Feed constraints in 41 ms returned sat
[2021-05-13 17:01:13] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 107 ms.
[2021-05-13 17:01:31] [INFO ] Added : 260 causal constraints over 52 iterations in 17691 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 270 ms.
Incomplete Parikh walk after 730600 steps, including 6481 resets, run finished after 7761 ms. (steps per millisecond=94 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 1566400 steps, including 13102 resets, run finished after 15490 ms. (steps per millisecond=101 ) properties seen :[0, 0] could not realise parikh vector
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 148 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 2226/2226 transitions.
Starting structural reductions, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 321 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2021-05-13 17:01:55] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 17:01:55] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 17:01:55] [INFO ] Implicit Places using invariants in 334 ms returned []
[2021-05-13 17:01:55] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 17:01:55] [INFO ] Computed 4 place invariants in 13 ms
[2021-05-13 17:01:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 17:01:56] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2021-05-13 17:01:56] [INFO ] Redundant transitions in 43 ms returned []
[2021-05-13 17:01:56] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 17:01:56] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 17:01:57] [INFO ] Dead Transitions using invariants and state equation in 1401 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 2226/2226 transitions.
Incomplete random walk after 100000 steps, including 794 resets, run finished after 768 ms. (steps per millisecond=130 ) properties seen :[0, 0]
[2021-05-13 17:01:58] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2021-05-13 17:01:58] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 17:01:58] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 17:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:01:58] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-13 17:01:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 17:01:58] [INFO ] [Real]Added 102 Read/Feed constraints in 46 ms returned sat
[2021-05-13 17:01:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:01:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 17:01:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:01:58] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-13 17:01:58] [INFO ] [Nat]Added 102 Read/Feed constraints in 47 ms returned sat
[2021-05-13 17:01:59] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 104 ms.
[2021-05-13 17:02:06] [INFO ] Added : 195 causal constraints over 39 iterations in 7481 ms. Result :sat
[2021-05-13 17:02:06] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 17:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:02:06] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-13 17:02:06] [INFO ] [Real]Added 102 Read/Feed constraints in 27 ms returned sat
[2021-05-13 17:02:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:02:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 17:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:02:06] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-13 17:02:06] [INFO ] [Nat]Added 102 Read/Feed constraints in 40 ms returned sat
[2021-05-13 17:02:06] [INFO ] Computed and/alt/rep : 2223/113509/285 causal constraints in 92 ms.
[2021-05-13 17:02:24] [INFO ] Added : 260 causal constraints over 52 iterations in 18071 ms. Result :sat
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 101 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 101 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 99 transition count 286
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 1944 place count 99 transition count 286
Applied a total of 1944 rules in 52 ms. Remains 99 /101 variables (removed 2) and now considering 286/2226 (removed 1940) transitions.
// Phase 1: matrix 286 rows 99 cols
[2021-05-13 17:02:25] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 17:02:25] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-13 17:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:02:25] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-13 17:02:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-13 17:02:25] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 17:02:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:02:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2021-05-13 17:02:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:02:25] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2021-05-13 17:02:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 17:02:25] [INFO ] Computed and/alt/rep : 283/8874/283 causal constraints in 23 ms.
[2021-05-13 17:02:29] [INFO ] Added : 225 causal constraints over 47 iterations in 3770 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 87 ms.
[2021-05-13 17:02:29] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 17:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:02:29] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-13 17:02:29] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 17:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:02:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 17:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:02:29] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-13 17:02:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-13 17:02:29] [INFO ] Computed and/alt/rep : 283/8874/283 causal constraints in 26 ms.
[2021-05-13 17:02:36] [INFO ] Added : 278 causal constraints over 56 iterations in 7153 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 157 ms.
[2021-05-13 17:02:36] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 20 ms.
[2021-05-13 17:02:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 41 ms.
[2021-05-13 17:02:37] [INFO ] Flatten gal took : 235 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ BridgeAndVehicles-COL-V20P10N50 @ 3570 seconds
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N50-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3315
rslt: Output for ReachabilityFireability @ BridgeAndVehicles-COL-V20P10N50
{
"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",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 17:02:37 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p47) AND (1 <= p98)) OR ((1 <= p46) AND (1 <= p98)))))",
"processed_size": 69,
"rewrites": 1
},
"result":
{
"edges": 3123149,
"markings": 1358322,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3439
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((p47 <= 0) OR (p98 <= 0)) AND ((p46 <= 0) OR (p98 <= 0)))))",
"processed_size": 69,
"rewrites": 2
},
"result":
{
"edges": 3123149,
"markings": 1358322,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 70880,
"runtime": 255.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 17018,
"conflict_clusters": 3,
"places": 101,
"places_significant": 97,
"singleton_clusters": 0,
"transitions": 2226
},
"result":
{
"preliminary_value": "no yes ",
"value": "no yes "
},
"task":
{
"type": "compound"
}
}
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: 2327/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3232
lola: finding significant places
lola: 101 places, 2226 transitions, 97 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: E (F ((((1 <= p47) AND (1 <= p98)) OR ((1 <= p46) AND (1 <= p98))))) : A (G ((((p47 <= 0) OR (p98 <= 0)) AND ((p46 <= 0) OR (p98 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p47) AND (1 <= p98)) OR ((1 <= p46) AND (1 <= p98)))))
lola: ========================================
lola: SUBTASK
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 ((((1 <= p47) AND (1 <= p98)) OR ((1 <= p46) AND (1 <= p98)))))
lola: processed formula length: 69
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: 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: (((1 <= p47) AND (1 <= p98)) OR ((1 <= p46) AND (1 <= p98)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 45322 markings, 97095 edges, 9064 markings/sec, 0 secs
lola: sara is running 5 secs || 89564 markings, 201837 edges, 8848 markings/sec, 5 secs
sara: warning, failure of lp_solve (at job 610)
lola: sara is running 10 secs || 134510 markings, 306775 edges, 8989 markings/sec, 10 secs
lola: sara is running 15 secs || 182092 markings, 419552 edges, 9516 markings/sec, 15 secs
lola: sara is running 20 secs || 236809 markings, 550405 edges, 10943 markings/sec, 20 secs
lola: sara is running 25 secs || 288939 markings, 673077 edges, 10426 markings/sec, 25 secs
lola: sara is running 30 secs || 336271 markings, 785286 edges, 9466 markings/sec, 30 secs
lola: sara is running 35 secs || 383777 markings, 897973 edges, 9501 markings/sec, 35 secs
lola: sara is running 40 secs || 436538 markings, 1020070 edges, 10552 markings/sec, 40 secs
lola: sara is running 45 secs || 487645 markings, 1138867 edges, 10221 markings/sec, 45 secs
lola: sara is running 50 secs || 541926 markings, 1263853 edges, 10856 markings/sec, 50 secs
lola: sara is running 55 secs || 599590 markings, 1394385 edges, 11533 markings/sec, 55 secs
lola: sara is running 60 secs || 656759 markings, 1529264 edges, 11434 markings/sec, 60 secs
lola: sara is running 65 secs || 714793 markings, 1661222 edges, 11607 markings/sec, 65 secs
lola: sara is running 70 secs || 772875 markings, 1794850 edges, 11616 markings/sec, 70 secs
lola: sara is running 75 secs || 831594 markings, 1926890 edges, 11744 markings/sec, 75 secs
lola: sara is running 80 secs || 889476 markings, 2061412 edges, 11576 markings/sec, 80 secs
lola: sara is running 85 secs || 948203 markings, 2194399 edges, 11745 markings/sec, 85 secs
lola: sara is running 90 secs || 1006893 markings, 2328419 edges, 11738 markings/sec, 90 secs
lola: sara is running 95 secs || 1062305 markings, 2452082 edges, 11082 markings/sec, 95 secs
lola: sara is running 100 secs || 1120868 markings, 2587582 edges, 11713 markings/sec, 100 secs
lola: sara is running 105 secs || 1180120 markings, 2720036 edges, 11850 markings/sec, 105 secs
lola: sara is running 110 secs || 1229751 markings, 2831325 edges, 9926 markings/sec, 110 secs
lola: sara is running 115 secs || 1281999 markings, 2952536 edges, 10450 markings/sec, 115 secs
lola: sara is running 120 secs || 1333394 markings, 3066413 edges, 10279 markings/sec, 120 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1358322 markings, 3123149 edges
lola: ========================================
lola: subprocess 1 will run for 3439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p47 <= 0) OR (p98 <= 0)) AND ((p46 <= 0) OR (p98 <= 0)))))
lola: ========================================
lola: SUBTASK
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 ((((p47 <= 0) OR (p98 <= 0)) AND ((p46 <= 0) OR (p98 <= 0)))))
lola: processed formula length: 69
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p47) AND (1 <= p98)) OR ((1 <= p46) AND (1 <= p98)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 43307 markings, 92452 edges, 8661 markings/sec, 0 secs
lola: sara is running 5 secs || 90680 markings, 204275 edges, 9475 markings/sec, 5 secs
sara: warning, failure of lp_solve (at job 610)
lola: sara is running 10 secs || 138735 markings, 316977 edges, 9611 markings/sec, 10 secs
lola: sara is running 15 secs || 188398 markings, 435215 edges, 9933 markings/sec, 15 secs
lola: sara is running 20 secs || 242792 markings, 564959 edges, 10879 markings/sec, 20 secs
lola: sara is running 25 secs || 298186 markings, 694481 edges, 11079 markings/sec, 25 secs
lola: sara is running 30 secs || 353467 markings, 824716 edges, 11056 markings/sec, 30 secs
lola: sara is running 35 secs || 409420 markings, 957853 edges, 11191 markings/sec, 35 secs
lola: sara is running 40 secs || 462506 markings, 1080975 edges, 10617 markings/sec, 40 secs
lola: sara is running 45 secs || 519604 markings, 1211754 edges, 11420 markings/sec, 45 secs
lola: sara is running 50 secs || 576871 markings, 1344523 edges, 11453 markings/sec, 50 secs
lola: sara is running 55 secs || 634341 markings, 1477229 edges, 11494 markings/sec, 55 secs
lola: sara is running 60 secs || 691375 markings, 1605601 edges, 11407 markings/sec, 60 secs
lola: sara is running 65 secs || 743270 markings, 1727075 edges, 10379 markings/sec, 65 secs
lola: sara is running 70 secs || 797664 markings, 1849332 edges, 10879 markings/sec, 70 secs
lola: sara is running 75 secs || 855625 markings, 1983424 edges, 11592 markings/sec, 75 secs
lola: sara is running 80 secs || 914190 markings, 2115781 edges, 11713 markings/sec, 80 secs
lola: sara is running 85 secs || 972592 markings, 2251292 edges, 11680 markings/sec, 85 secs
lola: sara is running 90 secs || 1031652 markings, 2384195 edges, 11812 markings/sec, 90 secs
lola: sara is running 95 secs || 1090522 markings, 2518027 edges, 11774 markings/sec, 95 secs
lola: sara is running 100 secs || 1149397 markings, 2652497 edges, 11775 markings/sec, 100 secs
lola: sara is running 105 secs || 1208985 markings, 2784348 edges, 11918 markings/sec, 105 secs
lola: sara is running 110 secs || 1262463 markings, 2909579 edges, 10696 markings/sec, 110 secs
lola: sara is running 115 secs || 1317392 markings, 3032244 edges, 10986 markings/sec, 115 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1358322 markings, 3123149 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes
lola:
preliminary result: no yes
lola: memory consumption: 70880 KB
lola: time consumption: 255 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V20P10N50"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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 gold2020"
echo " Input is BridgeAndVehicles-COL-V20P10N50, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038176700020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N50.tgz
mv BridgeAndVehicles-COL-V20P10N50 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;