fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r037-tajo-162038176800075
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BridgeAndVehicles-COL-V80P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4399.228 3600000.00 235899.00 123.30 TFFF?TTTTFTFFTFT 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-162038176800075.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-V80P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176800075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 156K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K 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.9K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 02:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 02:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 12:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 45K 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-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 1620928982041

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:03:03] [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]
[2021-05-13 18:03:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:03:03] [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 18:03:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2021-05-13 18:03:04] [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 18:03:04] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 18 ms.
[2021-05-13 18:03:04] [INFO ] Computed order based on color domains.
[2021-05-13 18:03:04] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions in 66 ms.
[2021-05-13 18:03:04] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 157 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 248 ms. (steps per millisecond=40 ) properties seen :[1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0]
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 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 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 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 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2021-05-13 18:03:04] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2021-05-13 18:03:04] [INFO ] Computed 7 place invariants in 25 ms
[2021-05-13 18:03:05] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned unsat
[2021-05-13 18:03:05] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 18:03:05] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 18:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:03:05] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-13 18:03:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:03:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-13 18:03:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:03:05] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-13 18:03:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-13 18:03:05] [INFO ] [Nat]Added 42 Read/Feed constraints in 87 ms returned sat
[2021-05-13 18:03:06] [INFO ] Computed and/alt/rep : 3725/99059/407 causal constraints in 252 ms.
[2021-05-13 18:03:10] [INFO ] Added : 200 causal constraints over 40 iterations in 4557 ms. Result :unknown
[2021-05-13 18:03:10] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 18:03:10] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 18:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:03:10] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2021-05-13 18:03:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:03:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned unsat
[2021-05-13 18:03:10] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 18:03:10] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityCardinality-07 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-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 210000 steps, including 1160 resets, run finished after 1989 ms. (steps per millisecond=105 ) properties seen :[0] could not realise parikh vector
Support contains 6 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.32 ms
Applied a total of 1 rules in 1027 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
[2021-05-13 18:03:13] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2021-05-13 18:03:13] [INFO ] Computed 5 place invariants in 12 ms
[2021-05-13 18:03:16] [INFO ] Dead Transitions using invariants and state equation in 2455 ms returned []
Finished structural reductions, in 1 iterations. Remains : 196/198 places, 3728/3728 transitions.
Incomplete random walk after 1000000 steps, including 1454 resets, run finished after 9449 ms. (steps per millisecond=105 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 454 resets, run finished after 3267 ms. (steps per millisecond=306 ) properties seen :[0]
Interrupted probabilistic random walk after 2819459 steps, run timeout after 30001 ms. (steps per millisecond=93 ) properties seen :[0]
Probabilistic random walk after 2819459 steps, saw 736493 distinct states, run finished after 30001 ms. (steps per millisecond=93 ) properties seen :[0]
[2021-05-13 18:03:59] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2021-05-13 18:03:59] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:03:59] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2021-05-13 18:03:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:03:59] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-05-13 18:03:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-13 18:03:59] [INFO ] [Real]Added 42 Read/Feed constraints in 50 ms returned sat
[2021-05-13 18:03:59] [INFO ] Computed and/alt/rep : 3725/99059/407 causal constraints in 230 ms.
[2021-05-13 18:03:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:03:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2021-05-13 18:03:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:04:00] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2021-05-13 18:04:00] [INFO ] [Nat]Added 42 Read/Feed constraints in 263 ms returned sat
[2021-05-13 18:04:00] [INFO ] Deduced a trap composed of 25 places in 458 ms
[2021-05-13 18:04:01] [INFO ] Deduced a trap composed of 24 places in 374 ms
[2021-05-13 18:04:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 942 ms
[2021-05-13 18:04:01] [INFO ] Computed and/alt/rep : 3725/99059/407 causal constraints in 209 ms.
[2021-05-13 18:04:22] [INFO ] Added : 285 causal constraints over 57 iterations in 20822 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 269 ms.
Incomplete Parikh walk after 245900 steps, including 1252 resets, run finished after 2864 ms. (steps per millisecond=85 ) properties seen :[0] could not realise parikh vector
Support contains 6 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 592 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 807 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2021-05-13 18:04:26] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2021-05-13 18:04:26] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-13 18:04:27] [INFO ] Implicit Places using invariants in 778 ms returned []
[2021-05-13 18:04:27] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2021-05-13 18:04:27] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 18:04:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-13 18:04:29] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2487 ms to find 1 implicit places.
[2021-05-13 18:04:29] [INFO ] Redundant transitions in 288 ms returned []
[2021-05-13 18:04:29] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2021-05-13 18:04:29] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:04:31] [INFO ] Dead Transitions using invariants and state equation in 2307 ms returned []
Starting structural reductions, iteration 1 : 195/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 538 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2021-05-13 18:04:32] [INFO ] Redundant transitions in 200 ms returned []
[2021-05-13 18:04:32] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2021-05-13 18:04:32] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 18:04:35] [INFO ] Dead Transitions using invariants and state equation in 2404 ms returned []
Finished structural reductions, in 2 iterations. Remains : 195/196 places, 3728/3728 transitions.
Incomplete random walk after 1000000 steps, including 1454 resets, run finished after 9104 ms. (steps per millisecond=109 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 456 resets, run finished after 2831 ms. (steps per millisecond=353 ) properties seen :[0]
Interrupted probabilistic random walk after 3047599 steps, run timeout after 30001 ms. (steps per millisecond=101 ) properties seen :[0]
Probabilistic random walk after 3047599 steps, saw 796002 distinct states, run finished after 30001 ms. (steps per millisecond=101 ) properties seen :[0]
[2021-05-13 18:05:17] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2021-05-13 18:05:17] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:05:17] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2021-05-13 18:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:17] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-13 18:05:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-13 18:05:17] [INFO ] [Real]Added 42 Read/Feed constraints in 51 ms returned sat
[2021-05-13 18:05:17] [INFO ] Computed and/alt/rep : 3725/92579/407 causal constraints in 186 ms.
[2021-05-13 18:05:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2021-05-13 18:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:17] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2021-05-13 18:05:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 106 ms returned sat
[2021-05-13 18:05:18] [INFO ] Computed and/alt/rep : 3725/92579/407 causal constraints in 108 ms.
[2021-05-13 18:05:38] [INFO ] Added : 295 causal constraints over 59 iterations in 20496 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 268 ms.
Incomplete Parikh walk after 41300 steps, including 517 resets, run finished after 322 ms. (steps per millisecond=128 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 539 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3728/3728 transitions.
Starting structural reductions, iteration 0 : 195/195 places, 3728/3728 transitions.
Applied a total of 0 rules in 460 ms. Remains 195 /195 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2021-05-13 18:05:40] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2021-05-13 18:05:40] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:05:40] [INFO ] Implicit Places using invariants in 631 ms returned []
[2021-05-13 18:05:40] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2021-05-13 18:05:40] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-13 18:05:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-13 18:05:42] [INFO ] Implicit Places using invariants and state equation in 1887 ms returned []
Implicit Place search using SMT with State Equation took 2521 ms to find 0 implicit places.
[2021-05-13 18:05:42] [INFO ] Redundant transitions in 208 ms returned []
[2021-05-13 18:05:42] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2021-05-13 18:05:42] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 18:05:46] [INFO ] Dead Transitions using invariants and state equation in 3281 ms returned []
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3728/3728 transitions.
Incomplete random walk after 100000 steps, including 145 resets, run finished after 889 ms. (steps per millisecond=112 ) properties seen :[0]
[2021-05-13 18:05:47] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 195 cols
[2021-05-13 18:05:47] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:05:47] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2021-05-13 18:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:47] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-13 18:05:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-13 18:05:47] [INFO ] [Real]Added 42 Read/Feed constraints in 52 ms returned sat
[2021-05-13 18:05:47] [INFO ] Computed and/alt/rep : 3725/92579/407 causal constraints in 101 ms.
[2021-05-13 18:05:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2021-05-13 18:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:47] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-13 18:05:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 108 ms returned sat
[2021-05-13 18:05:48] [INFO ] Computed and/alt/rep : 3725/92579/407 causal constraints in 122 ms.
[2021-05-13 18:06:07] [INFO ] Added : 290 causal constraints over 58 iterations in 19643 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 195 transition count 410
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3319 place count 195 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3320 place count 194 transition count 409
Applied a total of 3320 rules in 40 ms. Remains 194 /195 variables (removed 1) and now considering 409/3728 (removed 3319) transitions.
// Phase 1: matrix 409 rows 194 cols
[2021-05-13 18:06:07] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:06:07] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-13 18:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:07] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-13 18:06:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:06:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2021-05-13 18:06:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:08] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2021-05-13 18:06:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 18:06:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:06:08] [INFO ] Computed and/alt/rep : 406/13218/406 causal constraints in 29 ms.
[2021-05-13 18:06:20] [INFO ] Added : 240 causal constraints over 48 iterations in 12475 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 445 ms.
[2021-05-13 18:06:21] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2021-05-13 18:06:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 66 ms.
[2021-05-13 18:06:21] [INFO ] Flatten gal took : 341 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-COL-V80P50N20 @ 3570 seconds
vrfy: finished
info: timeLeft: 3563
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=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 18:06:22 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 140108,
"runtime": 7.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": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((p193 + p194 <= p166) AND (3 <= p165) AND (1 <= p83)) OR ((p166 <= 2) AND (p0 <= 2)))))",
"processed_size": 96,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 28667,
"conflict_clusters": 3,
"places": 195,
"places_significant": 190,
"singleton_clusters": 0,
"transitions": 3728
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"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: 3923/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6240
lola: finding significant places
lola: 195 places, 3728 transitions, 190 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: E (F ((((p193 + p194 <= p166) AND (3 <= p165) AND (1 <= p83)) OR ((p166 <= 2) AND (p0 <= 2)))))
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 ((((p193 + p194 <= p166) AND (3 <= p165) AND (1 <= p83)) OR ((p166 <= 2) AND (p0 <= 2)))))
lola: processed formula length: 96
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: (((p193 + p194 <= p166) AND (3 <= p165) AND (1 <= p83)) OR ((p166 <= 2) AND (p0 <= 2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: memory consumption: 140108 KB
lola: time consumption: 7 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-V80P50N20"
export BK_EXAMINATION="ReachabilityCardinality"
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-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 r037-tajo-162038176800075"
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 ;