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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 422K 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 ResAllocation-PT-R100C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621430485386

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:21:27] [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-19 13:21:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:21:27] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2021-05-19 13:21:27] [INFO ] Transformed 400 places.
[2021-05-19 13:21:27] [INFO ] Transformed 202 transitions.
[2021-05-19 13:21:27] [INFO ] Parsed PT model containing 400 places and 202 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 99 ms. (steps per millisecond=101 ) properties seen :[0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0]
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 0, 1]
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 202 rows 400 cols
[2021-05-19 13:21:28] [INFO ] Computed 200 place invariants in 9 ms
[2021-05-19 13:21:28] [INFO ] [Real]Absence check using 200 positive place invariants in 51 ms returned unsat
[2021-05-19 13:21:28] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned unsat
[2021-05-19 13:21:28] [INFO ] [Real]Absence check using 200 positive place invariants in 60 ms returned sat
[2021-05-19 13:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:28] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2021-05-19 13:21:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:21:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 65 ms returned sat
[2021-05-19 13:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:29] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2021-05-19 13:21:29] [INFO ] Deduced a trap composed of 5 places in 46 ms
[2021-05-19 13:21:29] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-19 13:21:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 95 ms
[2021-05-19 13:21:29] [INFO ] [Real]Absence check using 200 positive place invariants in 56 ms returned sat
[2021-05-19 13:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:29] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-19 13:21:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:21:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 59 ms returned sat
[2021-05-19 13:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:30] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2021-05-19 13:21:30] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 12 ms.
[2021-05-19 13:21:30] [INFO ] Added : 98 causal constraints over 20 iterations in 357 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-19 13:21:30] [INFO ] [Real]Absence check using 200 positive place invariants in 72 ms returned sat
[2021-05-19 13:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:31] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2021-05-19 13:21:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:21:31] [INFO ] [Nat]Absence check using 200 positive place invariants in 90 ms returned sat
[2021-05-19 13:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:31] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2021-05-19 13:21:31] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-19 13:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-19 13:21:31] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 13 ms.
[2021-05-19 13:21:31] [INFO ] Added : 98 causal constraints over 20 iterations in 281 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-19 13:21:32] [INFO ] [Real]Absence check using 200 positive place invariants in 70 ms returned unsat
[2021-05-19 13:21:32] [INFO ] [Real]Absence check using 200 positive place invariants in 56 ms returned sat
[2021-05-19 13:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:32] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-19 13:21:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:21:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 72 ms returned sat
[2021-05-19 13:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:32] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2021-05-19 13:21:33] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2021-05-19 13:21:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-19 13:21:33] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 12 ms.
[2021-05-19 13:21:33] [INFO ] Added : 192 causal constraints over 39 iterations in 533 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 290600 steps, including 157 resets, run finished after 1360 ms. (steps per millisecond=213 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 251600 steps, including 99 resets, run finished after 821 ms. (steps per millisecond=306 ) properties seen :[1, 0] could not realise parikh vector
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 237000 steps, including 99 resets, run finished after 764 ms. (steps per millisecond=310 ) properties seen :[0] could not realise parikh vector
Support contains 11 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 397 transition count 200
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 397 transition count 199
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 394 transition count 199
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 394 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 392 transition count 198
Applied a total of 12 rules in 87 ms. Remains 392 /400 variables (removed 8) and now considering 198/202 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 392/400 places, 198/202 transitions.
Incomplete random walk after 1000000 steps, including 404 resets, run finished after 3615 ms. (steps per millisecond=276 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 68 resets, run finished after 1824 ms. (steps per millisecond=548 ) properties seen :[0]
Interrupted probabilistic random walk after 13189043 steps, run timeout after 30001 ms. (steps per millisecond=439 ) properties seen :[0]
Probabilistic random walk after 13189043 steps, saw 2587891 distinct states, run finished after 30001 ms. (steps per millisecond=439 ) properties seen :[0]
// Phase 1: matrix 198 rows 392 cols
[2021-05-19 13:22:12] [INFO ] Computed 196 place invariants in 7 ms
[2021-05-19 13:22:12] [INFO ] [Real]Absence check using 196 positive place invariants in 89 ms returned sat
[2021-05-19 13:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:22:12] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2021-05-19 13:22:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:22:12] [INFO ] [Nat]Absence check using 196 positive place invariants in 58 ms returned sat
[2021-05-19 13:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:22:13] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2021-05-19 13:22:13] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2021-05-19 13:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2021-05-19 13:22:13] [INFO ] Computed and/alt/rep : 196/196/196 causal constraints in 15 ms.
[2021-05-19 13:22:13] [INFO ] Added : 188 causal constraints over 38 iterations in 620 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 222300 steps, including 144 resets, run finished after 781 ms. (steps per millisecond=284 ) properties seen :[0] could not realise parikh vector
Support contains 11 out of 392 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 392/392 places, 198/198 transitions.
Applied a total of 0 rules in 13 ms. Remains 392 /392 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 392/392 places, 198/198 transitions.
Starting structural reductions, iteration 0 : 392/392 places, 198/198 transitions.
Applied a total of 0 rules in 10 ms. Remains 392 /392 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 392 cols
[2021-05-19 13:22:14] [INFO ] Computed 196 place invariants in 2 ms
[2021-05-19 13:22:15] [INFO ] Implicit Places using invariants in 560 ms returned [199, 201, 203, 205, 207, 209, 211, 215, 217, 219, 221, 223, 225, 227, 229, 231, 233, 235, 237, 239, 241, 243, 245, 247, 249, 251, 253, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 277, 279, 281, 283, 285, 287, 289, 291, 293, 295, 297, 299, 301, 303, 305, 307, 309, 311, 313, 315, 317, 319, 323, 325, 327, 329, 331, 333, 335, 337, 339, 341, 343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379, 381, 383, 385, 387, 389, 391]
Discarding 95 places :
Implicit Place search using SMT only with invariants took 565 ms to find 95 implicit places.
[2021-05-19 13:22:15] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 198 rows 297 cols
[2021-05-19 13:22:15] [INFO ] Computed 101 place invariants in 3 ms
[2021-05-19 13:22:15] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Starting structural reductions, iteration 1 : 297/392 places, 198/198 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2021-05-19 13:22:15] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 198 rows 297 cols
[2021-05-19 13:22:15] [INFO ] Computed 101 place invariants in 2 ms
[2021-05-19 13:22:15] [INFO ] Dead Transitions using invariants and state equation in 239 ms returned []
Finished structural reductions, in 2 iterations. Remains : 297/392 places, 198/198 transitions.
Incomplete random walk after 1000000 steps, including 404 resets, run finished after 2630 ms. (steps per millisecond=380 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 70 resets, run finished after 1443 ms. (steps per millisecond=693 ) properties seen :[0]
Interrupted probabilistic random walk after 13460461 steps, run timeout after 30001 ms. (steps per millisecond=448 ) properties seen :[0]
Probabilistic random walk after 13460461 steps, saw 2639405 distinct states, run finished after 30001 ms. (steps per millisecond=448 ) properties seen :[0]
// Phase 1: matrix 198 rows 297 cols
[2021-05-19 13:22:49] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-19 13:22:49] [INFO ] [Real]Absence check using 101 positive place invariants in 50 ms returned sat
[2021-05-19 13:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:22:50] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2021-05-19 13:22:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:22:50] [INFO ] [Nat]Absence check using 101 positive place invariants in 49 ms returned sat
[2021-05-19 13:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:22:50] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2021-05-19 13:22:50] [INFO ] Deduced a trap composed of 5 places in 34 ms
[2021-05-19 13:22:50] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-19 13:22:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2021-05-19 13:22:50] [INFO ] Computed and/alt/rep : 196/196/196 causal constraints in 16 ms.
[2021-05-19 13:22:51] [INFO ] Added : 190 causal constraints over 38 iterations in 578 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 290600 steps, including 159 resets, run finished after 837 ms. (steps per millisecond=347 ) properties seen :[0] could not realise parikh vector
Support contains 11 out of 297 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 297/297 places, 198/198 transitions.
Applied a total of 0 rules in 6 ms. Remains 297 /297 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 198/198 transitions.
Starting structural reductions, iteration 0 : 297/297 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 297 /297 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 297 cols
[2021-05-19 13:22:52] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-19 13:22:52] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 198 rows 297 cols
[2021-05-19 13:22:52] [INFO ] Computed 101 place invariants in 2 ms
[2021-05-19 13:22:53] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2021-05-19 13:22:53] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 198 rows 297 cols
[2021-05-19 13:22:53] [INFO ] Computed 101 place invariants in 3 ms
[2021-05-19 13:22:53] [INFO ] Dead Transitions using invariants and state equation in 212 ms returned []
Finished structural reductions, in 1 iterations. Remains : 297/297 places, 198/198 transitions.
Incomplete random walk after 100000 steps, including 40 resets, run finished after 332 ms. (steps per millisecond=301 ) properties seen :[0]
// Phase 1: matrix 198 rows 297 cols
[2021-05-19 13:22:54] [INFO ] Computed 101 place invariants in 2 ms
[2021-05-19 13:22:54] [INFO ] [Real]Absence check using 101 positive place invariants in 51 ms returned sat
[2021-05-19 13:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:22:54] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2021-05-19 13:22:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:22:54] [INFO ] [Nat]Absence check using 101 positive place invariants in 47 ms returned sat
[2021-05-19 13:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:22:54] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2021-05-19 13:22:54] [INFO ] Deduced a trap composed of 5 places in 33 ms
[2021-05-19 13:22:54] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-19 13:22:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2021-05-19 13:22:54] [INFO ] Computed and/alt/rep : 196/196/196 causal constraints in 16 ms.
[2021-05-19 13:22:55] [INFO ] Added : 190 causal constraints over 38 iterations in 550 ms. Result :sat
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 296 transition count 197
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 296 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 295 transition count 196
Applied a total of 4 rules in 44 ms. Remains 295 /297 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 295 cols
[2021-05-19 13:22:55] [INFO ] Computed 101 place invariants in 2 ms
[2021-05-19 13:22:55] [INFO ] [Real]Absence check using 101 positive place invariants in 40 ms returned sat
[2021-05-19 13:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:22:55] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-19 13:22:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:22:55] [INFO ] [Nat]Absence check using 101 positive place invariants in 48 ms returned sat
[2021-05-19 13:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:22:56] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2021-05-19 13:22:56] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2021-05-19 13:22:56] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-19 13:22:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2021-05-19 13:22:56] [INFO ] Computed and/alt/rep : 194/194/194 causal constraints in 16 ms.
[2021-05-19 13:22:56] [INFO ] Added : 188 causal constraints over 38 iterations in 571 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-19 13:22:56] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2021-05-19 13:22:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
[2021-05-19 13:22:57] [INFO ] Flatten gal took : 70 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ResAllocation-PT-R100C002 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ ResAllocation-PT-R100C002

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 13:22:57 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 18600,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G (((p54 <= p261) OR (p268 <= p206) OR (p182 <= p272) OR (p188 <= p0) OR ((p285 <= p278) AND (1 <= p285)))))",
"processed_size": 115,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 792,
"conflict_clusters": 99,
"places": 297,
"places_significant": 196,
"singleton_clusters": 0,
"transitions": 198
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"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: 495/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 297
lola: finding significant places
lola: 297 places, 198 transitions, 196 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 <= p196)
lola: A (G (((p54 <= p261) OR (p268 <= p206) OR (p182 <= p272) OR (p188 <= p0) OR ((p285 <= p278) AND (1 <= p285)))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p54 <= p261) OR (p268 <= p206) OR (p182 <= p272) OR (p188 <= p0) OR ((p285 <= p278) AND (1 <= p285)))))
lola: processed formula length: 115
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p261 + 1 <= p54) AND (p206 + 1 <= p268) AND (p272 + 1 <= p182) AND (p0 + 1 <= p188) AND ((p278 + 1 <= p285) OR (p285 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 18600 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

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

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