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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16253.439 3600000.00 7089574.00 3305.30 TFFTFT?FF?TFFTTT 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-162038176800059.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-V80P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176800059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K 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.7K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 02:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 02:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 11:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 11:35 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 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-V80P20N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620926914190

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 17:28:36] [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 17:28:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:28:36] [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 17:28:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 638 ms
[2021-05-13 17:28:36] [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 17:28:36] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 23 ms.
[2021-05-13 17:28:36] [INFO ] Computed order based on color domains.
[2021-05-13 17:28:36] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions in 68 ms.
[2021-05-13 17:28:36] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 200 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 209 ms. (steps per millisecond=47 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1]
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0]
[2021-05-13 17:28:37] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2021-05-13 17:28:37] [INFO ] Computed 7 place invariants in 39 ms
[2021-05-13 17:28:37] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned unsat
[2021-05-13 17:28:37] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned unsat
[2021-05-13 17:28:37] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2021-05-13 17:28:37] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 17:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:28:38] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-13 17:28:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:28:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 17:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:28:38] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-13 17:28:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 17:28:38] [INFO ] [Nat]Added 22 Read/Feed constraints in 67 ms returned sat
[2021-05-13 17:28:39] [INFO ] Deduced a trap composed of 5 places in 661 ms
[2021-05-13 17:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 836 ms
[2021-05-13 17:28:39] [INFO ] Computed and/alt/rep : 2105/40609/367 causal constraints in 211 ms.
[2021-05-13 17:28:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t122 0) (and (or (and (> t123 0) (< o123 o122)) (and (> t205 0) (< o205 o122))) (or (and (> t165 0) (< o165 o122)) (and (> t166 0) (< o166 o122)) (and (> t167 0) (< o167 o122)) (and (> t168 0) (< o168 o122)) (and (> t169 0) (< o169 o122)) (and (> t170 0) (< o170 o122)) (and (> t171 0) (< o171 o122)) (and (> t172 0) (< o172 o122)) (and (> t173 0) (< o173 o122)) (and (> t174 0) (< o174 o122)) (and (> t175 0) (< o175 o122)) (and (> t176 0) (< o176 o122)) (and (> t177 0) (< o177 o122)) (and (> t178 0) (< o178 o122)) (and (> t179 0) (< o179 o122)) (and (> t180 0) (< o180 o122)) (and (> t181 0) (< o181 o122)) (and (> t182 0) (< o182 o122)) (and (> t183 0) (< o183 o122)) (and (> t184 0) (< o184 o122)) (and (> t185 0) (< o185 o122)) (and (> t186 0) (< o186 o122)) (and (> t187 0) (< o187 o122)) (and (> t188 0) (< o188 o122)) (and (> t189 0) (< o189 o122)) (and (> t190 0) (< o190 o122)) (and (> t191 0) (< o191 o122)) (and (> t192 0) (< o192 o122)) (and (> t193 0) (< o193 o122)) (and (> t194 0) (< o194 o122)) (and (> t195 0) (< o195 o122)) (and (> t196 0) (< o196 o122)) (and (> t197 0) (< o197 o122)) (and (> t198 0) (< o198 o122)) (and (> t199 0) (< o199 o122)) (and (> t200 0) (< o200 o122)) (and (> t201 0) (< o201 o122)) (and (> t202 0) (< o202 o122)) (and (> t203 0) (< o203 o122)) (and (> t204 0) (< o204 o122)) (and (> t205 0) (< o205 o122)) (and (> t206 0) (< o206 o122)) (and (> t207 0) (< o207 o122)) (and (> t208 0) (< o208 o122)) (and (> t209 0) (< o209 o122)) (and (> t210 0) (< o210 o122)) (and (> t211 0) (< o211 o122)) (and (> t212 0) (< o212 o122)) (and (> t213 0) (< o213 o122)) (and (> t214 0) (< o214 o122)) (and (> t215 0) (< o215 o122)) (and (> t216 0) (< o216 o122)) (and (> t217 0) (< o217 o122)) (and (> t218 0) (< o218 o122)) (and (> t219 0) (< o219 o122)) (and (> t220 0) (< o220 o122)) (and (> t221 0) (< o221 o122)) (and (> t222 0) (< o222 o122)) (and (> t223 0) (< o223 o122)) (and (> t224 0) (< o224 o122)) (and (> t225 0) (< o225 o122)) (and (> t226 0) (< o226 o122)) (and (> t227 0) (< o227 o122)) (and (> t228 0) (< o228 o122)) (and (> t229 0) (< o229 o122)) (and (> t230 0) (< o230 o122)) (and (> t231 0) (< o231 o122)) (and (> t232 0) (< o232 o122)) (and (> t233 0) (< o233 o122)) (and (> t234 0) (< o234 o122)) (and (> t235 0) (< o235 o122)) (and (> t236 0) (< o236 o122)) (and (> t237 0) (< o237 o122)) (and (> t238 0) (< o238 o122)) (and (> t239 0) (< o239 o122)) (and (> t240 0) (< o240 o122)) (and (> t241 0) (< o241 o122)) (and (> t242 0) (< o242 o122)) (and (> t243 0) (< o243 o122)) (and (> t244 0) (< o244 o122)) (and (> t245 0) (< o245 o122))) (or (and (> t256 0) (< o256 o122)) (and (> t257 0) (< o257 o122)) (and (> t258 0) (< o258 o122)) (and (> t259 0) (< o259 o122)) (and (> t260 0) (< o260 o122)) (and (> t261 0) (< o261 o122)) (and (> t262 0) (< o262 o122)) (and (> t263 0) (< o263 o122)) (and (> t264 0) (< o264 o122)) (and (> t265 0) (< o265 o122)))))") while checking expression at index 3
[2021-05-13 17:28:43] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 17:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:28:43] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-13 17:28:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:28:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 20 ms returned sat
[2021-05-13 17:28:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:28:43] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2021-05-13 17:28:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 47 ms returned sat
[2021-05-13 17:28:44] [INFO ] Deduced a trap composed of 5 places in 560 ms
[2021-05-13 17:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 658 ms
[2021-05-13 17:28:44] [INFO ] Computed and/alt/rep : 2105/40609/367 causal constraints in 206 ms.
[2021-05-13 17:28:48] [INFO ] Added : 140 causal constraints over 28 iterations in 3812 ms. Result :unknown
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 73300 steps, including 857 resets, run finished after 422 ms. (steps per millisecond=173 ) properties seen :[0, 0] could not realise parikh vector
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 188/188 places, 2108/2108 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 186 transition count 2108
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 345 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2021-05-13 17:28:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2021-05-13 17:28:49] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-13 17:28:51] [INFO ] Dead Transitions using invariants and state equation in 1748 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 1000000 steps, including 1424 resets, run finished after 5709 ms. (steps per millisecond=175 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 550 resets, run finished after 2337 ms. (steps per millisecond=427 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 577 resets, run finished after 2792 ms. (steps per millisecond=358 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 4695358 steps, run timeout after 30001 ms. (steps per millisecond=156 ) properties seen :[0, 0]
Probabilistic random walk after 4695358 steps, saw 1260569 distinct states, run finished after 30001 ms. (steps per millisecond=156 ) properties seen :[0, 0]
[2021-05-13 17:29:31] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2021-05-13 17:29:31] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 17:29:31] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2021-05-13 17:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:29:32] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-13 17:29:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:29:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2021-05-13 17:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:29:32] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-13 17:29:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 17:29:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 30 ms returned sat
[2021-05-13 17:29:32] [INFO ] Deduced a trap composed of 5 places in 300 ms
[2021-05-13 17:29:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2021-05-13 17:29:32] [INFO ] Computed and/alt/rep : 2104/40609/366 causal constraints in 73 ms.
[2021-05-13 17:29:54] [INFO ] Added : 265 causal constraints over 53 iterations in 21917 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 244 ms.
[2021-05-13 17:29:55] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-13 17:29:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:29:55] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2021-05-13 17:29:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:29:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2021-05-13 17:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:29:55] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2021-05-13 17:29:55] [INFO ] [Nat]Added 22 Read/Feed constraints in 39 ms returned sat
[2021-05-13 17:29:56] [INFO ] Deduced a trap composed of 5 places in 314 ms
[2021-05-13 17:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2021-05-13 17:29:56] [INFO ] Computed and/alt/rep : 2104/40609/366 causal constraints in 83 ms.
[2021-05-13 17:30:16] [INFO ] Added : 280 causal constraints over 56 iterations in 20564 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 331 ms.
Incomplete Parikh walk after 53000 steps, including 564 resets, run finished after 326 ms. (steps per millisecond=162 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 61300 steps, including 645 resets, run finished after 319 ms. (steps per millisecond=192 ) properties seen :[0, 0] could not realise parikh vector
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 223 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 163 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2021-05-13 17:30:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2021-05-13 17:30:18] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 17:30:18] [INFO ] Implicit Places using invariants in 511 ms returned []
[2021-05-13 17:30:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2021-05-13 17:30:18] [INFO ] Computed 5 place invariants in 17 ms
[2021-05-13 17:30:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 17:30:20] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2147 ms to find 2 implicit places.
[2021-05-13 17:30:20] [INFO ] Redundant transitions in 160 ms returned []
[2021-05-13 17:30:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 17:30:20] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 17:30:21] [INFO ] Dead Transitions using invariants and state equation in 1336 ms returned []
Starting structural reductions, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 121 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2021-05-13 17:30:22] [INFO ] Redundant transitions in 117 ms returned []
[2021-05-13 17:30:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 17:30:22] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 17:30:23] [INFO ] Dead Transitions using invariants and state equation in 1185 ms returned []
Finished structural reductions, in 2 iterations. Remains : 183/185 places, 2107/2107 transitions.
Incomplete random walk after 1000000 steps, including 1423 resets, run finished after 5076 ms. (steps per millisecond=197 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 550 resets, run finished after 1817 ms. (steps per millisecond=550 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 577 resets, run finished after 1896 ms. (steps per millisecond=527 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 4982519 steps, run timeout after 30001 ms. (steps per millisecond=166 ) properties seen :[0, 0]
Probabilistic random walk after 4982519 steps, saw 1336782 distinct states, run finished after 30001 ms. (steps per millisecond=166 ) properties seen :[0, 0]
[2021-05-13 17:31:02] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 17:31:02] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 17:31:02] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2021-05-13 17:31:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:31:02] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-13 17:31:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:31:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2021-05-13 17:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:31:02] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2021-05-13 17:31:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 17:31:02] [INFO ] [Nat]Added 22 Read/Feed constraints in 41 ms returned sat
[2021-05-13 17:31:02] [INFO ] Deduced a trap composed of 5 places in 276 ms
[2021-05-13 17:31:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2021-05-13 17:31:02] [INFO ] Computed and/alt/rep : 2104/27649/366 causal constraints in 68 ms.
[2021-05-13 17:31:12] [INFO ] Added : 364 causal constraints over 73 iterations in 10084 ms. Result :sat
[2021-05-13 17:31:13] [INFO ] Deduced a trap composed of 15 places in 246 ms
[2021-05-13 17:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 556 ms
Attempting to minimize the solution found.
Minimization took 216 ms.
[2021-05-13 17:31:13] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-13 17:31:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:31:13] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-13 17:31:13] [INFO ] [Real]Added 22 Read/Feed constraints in 19 ms returned sat
[2021-05-13 17:31:14] [INFO ] Deduced a trap composed of 5 places in 276 ms
[2021-05-13 17:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2021-05-13 17:31:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:31:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-13 17:31:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:31:14] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-13 17:31:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 51 ms returned sat
[2021-05-13 17:31:14] [INFO ] Deduced a trap composed of 5 places in 283 ms
[2021-05-13 17:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2021-05-13 17:31:14] [INFO ] Computed and/alt/rep : 2104/27649/366 causal constraints in 91 ms.
[2021-05-13 17:31:25] [INFO ] Added : 364 causal constraints over 73 iterations in 10241 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 266 ms.
Incomplete Parikh walk after 44600 steps, including 353 resets, run finished after 315 ms. (steps per millisecond=141 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 62400 steps, including 540 resets, run finished after 219 ms. (steps per millisecond=284 ) properties seen :[0, 0] could not realise parikh vector
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 155 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 290 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2021-05-13 17:31:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 17:31:26] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 17:31:26] [INFO ] Implicit Places using invariants in 356 ms returned []
[2021-05-13 17:31:26] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 17:31:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 17:31:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 17:31:27] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1538 ms to find 0 implicit places.
[2021-05-13 17:31:28] [INFO ] Redundant transitions in 32 ms returned []
[2021-05-13 17:31:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 17:31:28] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 17:31:29] [INFO ] Dead Transitions using invariants and state equation in 1185 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Incomplete random walk after 100000 steps, including 142 resets, run finished after 503 ms. (steps per millisecond=198 ) properties seen :[0, 0]
[2021-05-13 17:31:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 17:31:29] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 17:31:29] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-13 17:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:31:29] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-13 17:31:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:31:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-13 17:31:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:31:30] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-13 17:31:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 17:31:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 76 ms returned sat
[2021-05-13 17:31:30] [INFO ] Deduced a trap composed of 5 places in 187 ms
[2021-05-13 17:31:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2021-05-13 17:31:30] [INFO ] Computed and/alt/rep : 2104/27649/366 causal constraints in 46 ms.
[2021-05-13 17:31:40] [INFO ] Added : 364 causal constraints over 73 iterations in 10546 ms. Result :sat
[2021-05-13 17:31:41] [INFO ] Deduced a trap composed of 15 places in 241 ms
[2021-05-13 17:31:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2021-05-13 17:31:41] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-13 17:31:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:31:41] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-13 17:31:41] [INFO ] [Real]Added 22 Read/Feed constraints in 41 ms returned sat
[2021-05-13 17:31:41] [INFO ] Deduced a trap composed of 5 places in 241 ms
[2021-05-13 17:31:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2021-05-13 17:31:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:31:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-13 17:31:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:31:42] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-13 17:31:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 49 ms returned sat
[2021-05-13 17:31:42] [INFO ] Deduced a trap composed of 5 places in 216 ms
[2021-05-13 17:31:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2021-05-13 17:31:42] [INFO ] Computed and/alt/rep : 2104/27649/366 causal constraints in 40 ms.
[2021-05-13 17:31:52] [INFO ] Added : 364 causal constraints over 73 iterations in 10507 ms. Result :sat
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1739 place count 183 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1740 place count 182 transition count 368
Applied a total of 1740 rules in 28 ms. Remains 182 /183 variables (removed 1) and now considering 368/2107 (removed 1739) transitions.
// Phase 1: matrix 368 rows 182 cols
[2021-05-13 17:31:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 17:31:53] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2021-05-13 17:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:31:53] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2021-05-13 17:31:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:31:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2021-05-13 17:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:31:53] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-13 17:31:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 17:31:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-13 17:31:53] [INFO ] Computed and/alt/rep : 365/3608/365 causal constraints in 22 ms.
[2021-05-13 17:32:01] [INFO ] Added : 362 causal constraints over 73 iterations in 8218 ms. Result :sat
[2021-05-13 17:32:01] [INFO ] Deduced a trap composed of 14 places in 52 ms
[2021-05-13 17:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
Attempting to minimize the solution found.
Minimization took 64 ms.
[2021-05-13 17:32:02] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2021-05-13 17:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:32:02] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2021-05-13 17:32:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:32:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2021-05-13 17:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:32:02] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2021-05-13 17:32:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-13 17:32:03] [INFO ] Computed and/alt/rep : 365/3608/365 causal constraints in 52 ms.
[2021-05-13 17:32:09] [INFO ] Added : 362 causal constraints over 73 iterations in 6414 ms. Result :sat
[2021-05-13 17:32:09] [INFO ] Deduced a trap composed of 14 places in 108 ms
[2021-05-13 17:32:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
Attempting to minimize the solution found.
Minimization took 57 ms.
[2021-05-13 17:32:09] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2021-05-13 17:32:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 41 ms.
[2021-05-13 17:32:10] [INFO ] Flatten gal took : 488 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-COL-V80P20N10 @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 167352 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16327544 kB

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P20N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="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-V80P20N10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038176800059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P20N10.tgz
mv BridgeAndVehicles-COL-V80P20N10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;