fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r075-tall-162039097500327
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for DNAwalker-PT-16redondantChoiceR

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4278.304 3600000.00 170349.00 3339.90 FFTFFFTFTFFTFTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097500327.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 DNAwalker-PT-16redondantChoiceR, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097500327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 19 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 211K 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 DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-00
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-01
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-02
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-03
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-04
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-05
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-06
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-07
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-08
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-09
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-10
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-11
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-12
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-13
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-14
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620565019109

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 12:57:01] [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-09 12:57:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:57:01] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-09 12:57:01] [INFO ] Transformed 43 places.
[2021-05-09 12:57:01] [INFO ] Transformed 490 transitions.
[2021-05-09 12:57:01] [INFO ] Parsed PT model containing 43 places and 490 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 376 resets, run finished after 101 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1]
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-09 12:57:01] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2021-05-09 12:57:01] [INFO ] Computed 0 place invariants in 8 ms
[2021-05-09 12:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:02] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-09 12:57:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:03] [INFO ] [Nat]Absence check using state equation in 1721 ms returned unsat
[2021-05-09 12:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:04] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-09 12:57:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:04] [INFO ] [Nat]Absence check using state equation in 717 ms returned unsat
[2021-05-09 12:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:04] [INFO ] [Real]Absence check using state equation in 58 ms returned unsat
[2021-05-09 12:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:05] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-09 12:57:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:57:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:05] [INFO ] [Nat]Absence check using state equation in 820 ms returned unsat
[2021-05-09 12:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:05] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-09 12:57:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:57:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:06] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2021-05-09 12:57:06] [INFO ] State equation strengthened by 161 read => feed constraints.
[2021-05-09 12:57:06] [INFO ] [Nat]Added 161 Read/Feed constraints in 32 ms returned sat
[2021-05-09 12:57:06] [INFO ] Computed and/alt/rep : 466/10380/465 causal constraints in 98 ms.
[2021-05-09 12:57:09] [INFO ] Added : 42 causal constraints over 9 iterations in 2934 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-09 12:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:09] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-09 12:57:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:10] [INFO ] [Nat]Absence check using state equation in 1025 ms returned unsat
[2021-05-09 12:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:10] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-09 12:57:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:14] [INFO ] [Nat]Absence check using state equation in 3175 ms returned sat
[2021-05-09 12:57:14] [INFO ] [Nat]Added 161 Read/Feed constraints in 41 ms returned sat
[2021-05-09 12:57:14] [INFO ] Computed and/alt/rep : 466/10380/465 causal constraints in 65 ms.
[2021-05-09 12:57:15] [INFO ] Added : 43 causal constraints over 9 iterations in 908 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2021-05-09 12:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:15] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-09 12:57:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:16] [INFO ] [Nat]Absence check using state equation in 994 ms returned unsat
[2021-05-09 12:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:16] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-09 12:57:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:17] [INFO ] [Nat]Absence check using state equation in 674 ms returned unsat
[2021-05-09 12:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:17] [INFO ] [Real]Absence check using state equation in 76 ms returned unsat
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 3900 steps, including 247 resets, run finished after 30 ms. (steps per millisecond=130 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 3500 steps, including 118 resets, run finished after 23 ms. (steps per millisecond=152 ) properties seen :[1, 0] could not realise parikh vector
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 490/490 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 43 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 42 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 41 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 40 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 39 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 38 transition count 473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 37 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 36 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 35 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 34 transition count 469
Applied a total of 21 rules in 107 ms. Remains 34 /43 variables (removed 9) and now considering 469/490 (removed 21) transitions.
// Phase 1: matrix 469 rows 34 cols
[2021-05-09 12:57:17] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-09 12:57:17] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
Finished structural reductions, in 1 iterations. Remains : 34/43 places, 469/490 transitions.
Incomplete random walk after 1000000 steps, including 50385 resets, run finished after 5207 ms. (steps per millisecond=192 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 4797 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties seen :[0]
Interrupted probabilistic random walk after 10327198 steps, run timeout after 30001 ms. (steps per millisecond=344 ) properties seen :[0]
Probabilistic random walk after 10327198 steps, saw 2803839 distinct states, run finished after 30001 ms. (steps per millisecond=344 ) properties seen :[0]
// Phase 1: matrix 469 rows 34 cols
[2021-05-09 12:57:53] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-09 12:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:53] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-09 12:57:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:57:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:57:54] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2021-05-09 12:57:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 12:57:54] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2021-05-09 12:57:54] [INFO ] Computed and/alt/rep : 463/7726/463 causal constraints in 46 ms.
[2021-05-09 12:58:00] [INFO ] Added : 35 causal constraints over 7 iterations in 6269 ms. Result :unknown
Incomplete Parikh walk after 3000 steps, including 682 resets, run finished after 25 ms. (steps per millisecond=120 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 34/34 places, 469/469 transitions.
Applied a total of 0 rules in 6 ms. Remains 34 /34 variables (removed 0) and now considering 469/469 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 34/34 places, 469/469 transitions.
Starting structural reductions, iteration 0 : 34/34 places, 469/469 transitions.
Applied a total of 0 rules in 6 ms. Remains 34 /34 variables (removed 0) and now considering 469/469 (removed 0) transitions.
// Phase 1: matrix 469 rows 34 cols
[2021-05-09 12:58:00] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-09 12:58:00] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 469 rows 34 cols
[2021-05-09 12:58:00] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 12:58:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 12:58:01] [INFO ] Implicit Places using invariants and state equation in 572 ms returned [33]
Discarding 1 places :
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 628 ms to find 1 implicit places.
[2021-05-09 12:58:01] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 464 rows 33 cols
[2021-05-09 12:58:01] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 12:58:01] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Starting structural reductions, iteration 1 : 33/34 places, 464/469 transitions.
Applied a total of 0 rules in 17 ms. Remains 33 /33 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2021-05-09 12:58:01] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 464 rows 33 cols
[2021-05-09 12:58:01] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:58:01] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 2 iterations. Remains : 33/34 places, 464/469 transitions.
Incomplete random walk after 1000000 steps, including 43977 resets, run finished after 5127 ms. (steps per millisecond=195 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 4369 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties seen :[0]
Interrupted probabilistic random walk after 9286531 steps, run timeout after 30001 ms. (steps per millisecond=309 ) properties seen :[0]
Probabilistic random walk after 9286531 steps, saw 2551101 distinct states, run finished after 30001 ms. (steps per millisecond=309 ) properties seen :[0]
// Phase 1: matrix 464 rows 33 cols
[2021-05-09 12:58:37] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 12:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:58:37] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-09 12:58:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:58:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:58:38] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2021-05-09 12:58:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 12:58:38] [INFO ] [Nat]Added 14 Read/Feed constraints in 5 ms returned sat
[2021-05-09 12:58:38] [INFO ] Computed and/alt/rep : 458/7654/458 causal constraints in 22 ms.
[2021-05-09 12:58:44] [INFO ] Added : 35 causal constraints over 7 iterations in 6265 ms. Result :unknown
Incomplete Parikh walk after 2800 steps, including 639 resets, run finished after 33 ms. (steps per millisecond=84 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 464/464 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 464/464 transitions.
Starting structural reductions, iteration 0 : 33/33 places, 464/464 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 464/464 (removed 0) transitions.
// Phase 1: matrix 464 rows 33 cols
[2021-05-09 12:58:44] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 12:58:44] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 464 rows 33 cols
[2021-05-09 12:58:44] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:58:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 12:58:45] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2021-05-09 12:58:45] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 464 rows 33 cols
[2021-05-09 12:58:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:58:45] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 464/464 transitions.
Incomplete random walk after 100000 steps, including 4384 resets, run finished after 512 ms. (steps per millisecond=195 ) properties seen :[0]
// Phase 1: matrix 464 rows 33 cols
[2021-05-09 12:58:46] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 12:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:58:46] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-09 12:58:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:58:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:58:46] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2021-05-09 12:58:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 12:58:46] [INFO ] [Nat]Added 14 Read/Feed constraints in 6 ms returned sat
[2021-05-09 12:58:46] [INFO ] Computed and/alt/rep : 458/7654/458 causal constraints in 28 ms.
[2021-05-09 12:58:52] [INFO ] Added : 35 causal constraints over 7 iterations in 6269 ms. Result :unknown
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 464/464 (removed 0) transitions.
// Phase 1: matrix 464 rows 33 cols
[2021-05-09 12:58:52] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:58:52] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-09 12:58:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:58:53] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2021-05-09 12:58:53] [INFO ] Computed and/alt/rep : 458/7458/458 causal constraints in 25 ms.
[2021-05-09 12:58:59] [INFO ] Added : 35 causal constraints over 7 iterations in 6366 ms. Result :unknown
[2021-05-09 12:58:59] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2021-05-09 12:58:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
[2021-05-09 12:59:00] [INFO ] Flatten gal took : 82 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DNAwalker-PT-16redondantChoiceR @ 3570 seconds

FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3528
rslt: Output for ReachabilityCardinality @ DNAwalker-PT-16redondantChoiceR

{
"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": "Sun May 9 12:59:06 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 22776,
"runtime": 42.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": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p21 <= p11) OR (p0 + 1 <= p32) OR (p32 <= p30) OR (3 <= p9))))",
"processed_size": 73,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 1389,
"conflict_clusters": 2,
"places": 33,
"places_significant": 33,
"singleton_clusters": 0,
"transitions": 464
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"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: 497/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 464 transitions, 33 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: A (G (((p21 <= p11) OR (p0 + 1 <= p32) OR (p32 <= p30) OR (3 <= p9))))
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 (((p21 <= p11) OR (p0 + 1 <= p32) OR (p32 <= p30) OR (3 <= p9))))
lola: processed formula length: 73
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: ((p11 + 1 <= p21) AND (p32 <= p0) AND (p30 + 1 <= p32) AND (p9 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 12 markings, 11 edges
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.
lola: memory consumption: 22776 KB
lola: time consumption: 42 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="DNAwalker-PT-16redondantChoiceR"
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 DNAwalker-PT-16redondantChoiceR, 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 r075-tall-162039097500327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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