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-162038176900115.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-PT-V50P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176900115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 91K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 424K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 798K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M 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 11K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 133K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 418K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 23 02:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 23 02:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 148K Mar 22 11:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 431K Mar 22 11:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.5M 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-PT-V50P20N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620931128953

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:38:51] [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:38:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:38:51] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2021-05-13 18:38:51] [INFO ] Transformed 128 places.
[2021-05-13 18:38:51] [INFO ] Transformed 1328 transitions.
[2021-05-13 18:38:51] [INFO ] Parsed PT model containing 128 places and 1328 transitions in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 132 ms. (steps per millisecond=75 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0]
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 1, 0, 1]
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0]
[2021-05-13 18:38:52] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2021-05-13 18:38:52] [INFO ] Computed 7 place invariants in 16 ms
[2021-05-13 18:38:52] [INFO ] [Real]Absence check using 7 positive place invariants in 29 ms returned sat
[2021-05-13 18:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:38:52] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-13 18:38:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:38:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 27 ms returned sat
[2021-05-13 18:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:38:52] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-13 18:38:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:38:52] [INFO ] [Nat]Added 22 Read/Feed constraints in 28 ms returned sat
[2021-05-13 18:38:52] [INFO ] Deduced a trap composed of 5 places in 211 ms
[2021-05-13 18:38:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2021-05-13 18:38:53] [INFO ] Computed and/alt/rep : 1325/22399/247 causal constraints in 93 ms.
[2021-05-13 18:38:57] [INFO ] Added : 185 causal constraints over 37 iterations in 4517 ms. Result :unknown
[2021-05-13 18:38:57] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned unsat
[2021-05-13 18:38:57] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned unsat
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 30200 steps, including 364 resets, run finished after 312 ms. (steps per millisecond=96 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 1328/1328 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 1222 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.49 ms
Applied a total of 1 rules in 507 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2021-05-13 18:38:58] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-13 18:38:58] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-13 18:39:02] [INFO ] Dead Transitions using invariants and state equation in 3501 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/128 places, 1328/1328 transitions.
Incomplete random walk after 1000000 steps, including 2273 resets, run finished after 4462 ms. (steps per millisecond=224 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 861 resets, run finished after 2436 ms. (steps per millisecond=410 ) properties seen :[0]
Interrupted probabilistic random walk after 6312874 steps, run timeout after 30001 ms. (steps per millisecond=210 ) properties seen :[0]
Probabilistic random walk after 6312874 steps, saw 1569391 distinct states, run finished after 30002 ms. (steps per millisecond=210 ) properties seen :[0]
[2021-05-13 18:39:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-13 18:39:38] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 18:39:39] [INFO ] [Real]Absence check using 6 positive place invariants in 22 ms returned sat
[2021-05-13 18:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:39:39] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2021-05-13 18:39:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:39:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2021-05-13 18:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:39:39] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-13 18:39:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:39:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 59 ms returned sat
[2021-05-13 18:39:40] [INFO ] Deduced a trap composed of 5 places in 608 ms
[2021-05-13 18:39:40] [INFO ] Deduced a trap composed of 5 places in 495 ms
[2021-05-13 18:39:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1157 ms
[2021-05-13 18:39:41] [INFO ] Computed and/alt/rep : 1325/22399/247 causal constraints in 100 ms.
[2021-05-13 18:39:50] [INFO ] Added : 228 causal constraints over 47 iterations in 9173 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 202 ms.
Incomplete Parikh walk after 15100 steps, including 369 resets, run finished after 73 ms. (steps per millisecond=206 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 112 ms. Remains 127 /127 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 1328/1328 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 200 ms. Remains 127 /127 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-13 18:39:50] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-13 18:39:50] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 18:39:51] [INFO ] Implicit Places using invariants in 403 ms returned []
[2021-05-13 18:39:51] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-13 18:39:51] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 18:39:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:39:53] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2294 ms to find 2 implicit places.
[2021-05-13 18:39:53] [INFO ] Redundant transitions in 179 ms returned []
[2021-05-13 18:39:53] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-13 18:39:53] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-13 18:39:56] [INFO ] Dead Transitions using invariants and state equation in 3204 ms returned []
Starting structural reductions, iteration 1 : 125/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 69 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-13 18:39:56] [INFO ] Redundant transitions in 91 ms returned []
[2021-05-13 18:39:56] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-13 18:39:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:39:57] [INFO ] Dead Transitions using invariants and state equation in 1231 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/127 places, 1328/1328 transitions.
Incomplete random walk after 1000000 steps, including 2273 resets, run finished after 4055 ms. (steps per millisecond=246 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 860 resets, run finished after 1890 ms. (steps per millisecond=529 ) properties seen :[0]
Interrupted probabilistic random walk after 7721829 steps, run timeout after 30001 ms. (steps per millisecond=257 ) properties seen :[0]
Probabilistic random walk after 7721829 steps, saw 1868597 distinct states, run finished after 30001 ms. (steps per millisecond=257 ) properties seen :[0]
[2021-05-13 18:40:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-13 18:40:33] [INFO ] Computed 5 place invariants in 14 ms
[2021-05-13 18:40:33] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2021-05-13 18:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:40:34] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2021-05-13 18:40:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:40:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2021-05-13 18:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:40:34] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2021-05-13 18:40:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:40:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 108 ms returned sat
[2021-05-13 18:40:35] [INFO ] Deduced a trap composed of 5 places in 396 ms
[2021-05-13 18:40:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2021-05-13 18:40:35] [INFO ] Computed and/alt/rep : 1325/17299/247 causal constraints in 70 ms.
[2021-05-13 18:40:40] [INFO ] Added : 240 causal constraints over 51 iterations in 5308 ms. Result :sat
[2021-05-13 18:40:40] [INFO ] Deduced a trap composed of 14 places in 154 ms
[2021-05-13 18:40:41] [INFO ] Deduced a trap composed of 5 places in 384 ms
[2021-05-13 18:40:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 957 ms
Attempting to minimize the solution found.
Minimization took 100 ms.
Incomplete Parikh walk after 22400 steps, including 322 resets, run finished after 98 ms. (steps per millisecond=228 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 88 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1328/1328 transitions.
Starting structural reductions, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 89 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-13 18:40:41] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-13 18:40:41] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:40:42] [INFO ] Implicit Places using invariants in 521 ms returned []
[2021-05-13 18:40:42] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-13 18:40:42] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:40:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:40:44] [INFO ] Implicit Places using invariants and state equation in 2414 ms returned []
Implicit Place search using SMT with State Equation took 2962 ms to find 0 implicit places.
[2021-05-13 18:40:44] [INFO ] Redundant transitions in 67 ms returned []
[2021-05-13 18:40:44] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-13 18:40:44] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:40:46] [INFO ] Dead Transitions using invariants and state equation in 1650 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1328/1328 transitions.
Incomplete random walk after 100000 steps, including 227 resets, run finished after 359 ms. (steps per millisecond=278 ) properties seen :[0]
[2021-05-13 18:40:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-13 18:40:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:40:47] [INFO ] [Real]Absence check using 5 positive place invariants in 53 ms returned sat
[2021-05-13 18:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:40:47] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-13 18:40:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:40:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 54 ms returned sat
[2021-05-13 18:40:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:40:47] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-13 18:40:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:40:47] [INFO ] [Nat]Added 22 Read/Feed constraints in 100 ms returned sat
[2021-05-13 18:40:48] [INFO ] Deduced a trap composed of 5 places in 616 ms
[2021-05-13 18:40:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 696 ms
[2021-05-13 18:40:48] [INFO ] Computed and/alt/rep : 1325/17299/247 causal constraints in 70 ms.
[2021-05-13 18:40:54] [INFO ] Added : 240 causal constraints over 51 iterations in 5973 ms. Result :sat
[2021-05-13 18:40:54] [INFO ] Deduced a trap composed of 14 places in 195 ms
[2021-05-13 18:40:55] [INFO ] Deduced a trap composed of 5 places in 692 ms
[2021-05-13 18:40:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1351 ms
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 125 transition count 250
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 125 transition count 248
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1082 place count 123 transition count 248
Applied a total of 1082 rules in 51 ms. Remains 123 /125 variables (removed 2) and now considering 248/1328 (removed 1080) transitions.
// Phase 1: matrix 248 rows 123 cols
[2021-05-13 18:40:55] [INFO ] Computed 5 place invariants in 14 ms
[2021-05-13 18:40:55] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2021-05-13 18:40:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:40:55] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-13 18:40:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:40:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 26 ms returned sat
[2021-05-13 18:40:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:40:56] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2021-05-13 18:40:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-13 18:40:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2021-05-13 18:40:56] [INFO ] Computed and/alt/rep : 245/2375/245 causal constraints in 42 ms.
[2021-05-13 18:40:58] [INFO ] Added : 243 causal constraints over 49 iterations in 2055 ms. Result :sat
[2021-05-13 18:40:58] [INFO ] Deduced a trap composed of 15 places in 37 ms
[2021-05-13 18:40:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
Attempting to minimize the solution found.
Minimization took 41 ms.
[2021-05-13 18:40:58] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2021-05-13 18:40:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
[2021-05-13 18:40:59] [INFO ] Flatten gal took : 256 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V50P20N10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V50P20N10

{
"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:40:59 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 41980,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((p54 <= 0) AND ((1 <= p53)))))",
"processed_size": 37,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 9807,
"conflict_clusters": 4,
"places": 125,
"places_significant": 120,
"singleton_clusters": 0,
"transitions": 1328
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"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: 1453/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4000
lola: finding significant places
lola: 125 places, 1328 transitions, 120 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p55 + p56)
lola: LP says that atomic proposition is always false: (2 <= p111 + p112)
lola: E (F (((p54 <= 0) AND ((1 <= p53)))))
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 (((p54 <= 0) AND ((1 <= p53)))))
lola: processed formula length: 37
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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p54 <= 0) AND ((1 <= p53)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: memory consumption: 41980 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P20N10"
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-PT-V50P20N10, 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-162038176900115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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