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

About the Execution of 2020-gold for HypercubeGrid-PT-C4K3P3B12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11355.787 3600000.00 701498.00 2960.40 TTTTTTFTTTTTTFTT 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.r132-tall-162075428200132.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 HypercubeGrid-PT-C4K3P3B12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428200132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 11:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 22 21:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 21:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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
-rwxr-xr-x 1 mcc users 3.0M 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 HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-00
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-01
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-02
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-03
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-04
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-05
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-06
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-07
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-08
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-09
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-10
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-11
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-12
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-13
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-14
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620909720049

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 12:42:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 12:42:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 12:42:01] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2021-05-13 12:42:01] [INFO ] Transformed 2457 places.
[2021-05-13 12:42:01] [INFO ] Transformed 5400 transitions.
[2021-05-13 12:42:01] [INFO ] Parsed PT model containing 2457 places and 5400 transitions in 314 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 1760 ms. (steps per millisecond=5 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1]
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 272 ms. (steps per millisecond=36 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 300 ms. (steps per millisecond=33 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 278 ms. (steps per millisecond=35 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 274 ms. (steps per millisecond=36 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 258 ms. (steps per millisecond=38 ) properties seen :[0, 0, 0, 0, 1, 0, 0]
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 261 ms. (steps per millisecond=38 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 268 ms. (steps per millisecond=37 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 5400 rows 2457 cols
[2021-05-13 12:42:06] [INFO ] Computed 946 place invariants in 537 ms
[2021-05-13 12:42:07] [INFO ] [Real]Absence check using 945 positive place invariants in 991 ms returned sat
[2021-05-13 12:42:07] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 61 ms returned sat
[2021-05-13 12:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:42:11] [INFO ] [Real]Absence check using state equation in 3627 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 12:42:12] [INFO ] [Real]Absence check using 945 positive place invariants in 958 ms returned sat
[2021-05-13 12:42:12] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 58 ms returned sat
[2021-05-13 12:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:42:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:42:16] [INFO ] [Real]Absence check using state equation in 3798 ms returned (error "Failed to check-sat")
[2021-05-13 12:42:17] [INFO ] [Real]Absence check using 945 positive place invariants in 960 ms returned sat
[2021-05-13 12:42:17] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 59 ms returned sat
[2021-05-13 12:42:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:42:21] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:42:21] [INFO ] [Real]Absence check using state equation in 3794 ms returned (error "Failed to check-sat")
[2021-05-13 12:42:22] [INFO ] [Real]Absence check using 945 positive place invariants in 955 ms returned sat
[2021-05-13 12:42:22] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 59 ms returned sat
[2021-05-13 12:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:42:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:42:26] [INFO ] [Real]Absence check using state equation in 3790 ms returned (error "Failed to check-sat")
[2021-05-13 12:42:27] [INFO ] [Real]Absence check using 945 positive place invariants in 947 ms returned sat
[2021-05-13 12:42:27] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 56 ms returned sat
[2021-05-13 12:42:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:42:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:42:31] [INFO ] [Real]Absence check using state equation in 3820 ms returned (error "Failed to check-sat")
[2021-05-13 12:42:32] [INFO ] [Real]Absence check using 945 positive place invariants in 948 ms returned sat
[2021-05-13 12:42:32] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 57 ms returned sat
[2021-05-13 12:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:42:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:42:36] [INFO ] [Real]Absence check using state equation in 3813 ms returned (error "Failed to check-sat")
Support contains 48 out of 2457 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2457/2457 places, 5400/5400 transitions.
Applied a total of 0 rules in 405 ms. Remains 2457 /2457 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2457/2457 places, 5400/5400 transitions.
Interrupted random walk after 264672 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :[1, 1, 0, 0, 0, 1]
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 196072 steps, including 0 resets, run timeout after 5015 ms. (steps per millisecond=39 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 194694 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=38 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 199285 steps, including 0 resets, run timeout after 5023 ms. (steps per millisecond=39 ) properties seen :[0, 0, 0]
// Phase 1: matrix 5400 rows 2457 cols
[2021-05-13 12:43:22] [INFO ] Computed 946 place invariants in 156 ms
[2021-05-13 12:43:23] [INFO ] [Real]Absence check using 945 positive place invariants in 956 ms returned sat
[2021-05-13 12:43:23] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 59 ms returned sat
[2021-05-13 12:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:43:50] [INFO ] [Real]Absence check using state equation in 27129 ms returned sat
[2021-05-13 12:43:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:43:51] [INFO ] [Nat]Absence check using 945 positive place invariants in 955 ms returned sat
[2021-05-13 12:43:51] [INFO ] [Nat]Absence check using 945 positive and 1 generalized place invariants in 60 ms returned sat
[2021-05-13 12:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:44:18] [INFO ] [Nat]Absence check using state equation in 26664 ms returned sat
[2021-05-13 12:44:18] [INFO ] Computed and/alt/rep : 4752/4752/4752 causal constraints in 288 ms.
[2021-05-13 12:44:35] [INFO ] Added : 400 causal constraints over 80 iterations in 16895 ms. Result :(error "Failed to check-sat")
[2021-05-13 12:44:36] [INFO ] [Real]Absence check using 945 positive place invariants in 957 ms returned sat
[2021-05-13 12:44:36] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 59 ms returned sat
[2021-05-13 12:44:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:45:04] [INFO ] [Real]Absence check using state equation in 27412 ms returned sat
[2021-05-13 12:45:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:45:05] [INFO ] [Nat]Absence check using 945 positive place invariants in 961 ms returned sat
[2021-05-13 12:45:05] [INFO ] [Nat]Absence check using 945 positive and 1 generalized place invariants in 60 ms returned sat
[2021-05-13 12:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:45:31] [INFO ] [Nat]Absence check using state equation in 26354 ms returned sat
[2021-05-13 12:45:32] [INFO ] Computed and/alt/rep : 4752/4752/4752 causal constraints in 188 ms.
[2021-05-13 12:45:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t3070 0) (and (> t4936 0) (< o4936 o3070)))") while checking expression at index 1
[2021-05-13 12:45:50] [INFO ] [Real]Absence check using 945 positive place invariants in 973 ms returned sat
[2021-05-13 12:45:50] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 57 ms returned sat
[2021-05-13 12:45:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:46:17] [INFO ] [Real]Absence check using state equation in 26627 ms returned sat
[2021-05-13 12:46:17] [INFO ] Computed and/alt/rep : 4752/4752/4752 causal constraints in 258 ms.
[2021-05-13 12:46:34] [INFO ] Added : 390 causal constraints over 78 iterations in 16994 ms. Result :unknown
Interrupted Parikh walk after 436356 steps, including 37 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen :[1, 0, 1]
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 18 out of 2457 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2457/2457 places, 5400/5400 transitions.
Applied a total of 0 rules in 206 ms. Remains 2457 /2457 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2457/2457 places, 5400/5400 transitions.
Interrupted random walk after 265313 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :[0]
Interrupted Best-First random walk after 197011 steps, including 0 resets, run timeout after 5021 ms. (steps per millisecond=39 ) properties seen :[0]
Probabilistic random walk after 796857 steps, saw 585 distinct states, run finished after 30004 ms. (steps per millisecond=26 ) properties seen :[0]
// Phase 1: matrix 5400 rows 2457 cols
[2021-05-13 12:48:09] [INFO ] Computed 946 place invariants in 99 ms
[2021-05-13 12:48:10] [INFO ] [Real]Absence check using 945 positive place invariants in 951 ms returned sat
[2021-05-13 12:48:10] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 59 ms returned sat
[2021-05-13 12:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:48:36] [INFO ] [Real]Absence check using state equation in 25835 ms returned sat
[2021-05-13 12:48:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:48:38] [INFO ] [Nat]Absence check using 945 positive place invariants in 960 ms returned sat
[2021-05-13 12:48:38] [INFO ] [Nat]Absence check using 945 positive and 1 generalized place invariants in 60 ms returned sat
[2021-05-13 12:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:49:06] [INFO ] [Nat]Absence check using state equation in 28133 ms returned sat
[2021-05-13 12:49:06] [INFO ] Computed and/alt/rep : 4752/4752/4752 causal constraints in 242 ms.
[2021-05-13 12:49:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t2510 0) (and (> t5018 0) (< o5018 o2510)))") while checking expression at index 0
Support contains 18 out of 2457 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2457/2457 places, 5400/5400 transitions.
Applied a total of 0 rules in 148 ms. Remains 2457 /2457 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2457/2457 places, 5400/5400 transitions.
Starting structural reductions, iteration 0 : 2457/2457 places, 5400/5400 transitions.
Applied a total of 0 rules in 125 ms. Remains 2457 /2457 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
// Phase 1: matrix 5400 rows 2457 cols
[2021-05-13 12:49:22] [INFO ] Computed 946 place invariants in 97 ms
[2021-05-13 12:49:23] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:49:41] [INFO ] Implicit Places using invariants in 19307 ms returned []
// Phase 1: matrix 5400 rows 2457 cols
[2021-05-13 12:49:41] [INFO ] Computed 946 place invariants in 98 ms
[2021-05-13 12:49:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:50:13] [INFO ] Performed 2007/2457 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-13 12:50:20] [INFO ] Implicit Places using invariants and state equation in 38784 ms returned []
Implicit Place search using SMT with State Equation took 58091 ms to find 0 implicit places.
[2021-05-13 12:50:20] [INFO ] Redundant transitions in 501 ms returned []
// Phase 1: matrix 5400 rows 2457 cols
[2021-05-13 12:50:20] [INFO ] Computed 946 place invariants in 97 ms
[2021-05-13 12:50:22] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:50:52] [INFO ] Performed 4643/5400 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-13 12:50:57] [INFO ] Dead Transitions using invariants and state equation in 36385 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2457/2457 places, 5400/5400 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 12443 ms. (steps per millisecond=8 ) properties seen :[0]
// Phase 1: matrix 5400 rows 2457 cols
[2021-05-13 12:51:09] [INFO ] Computed 946 place invariants in 97 ms
[2021-05-13 12:51:10] [INFO ] [Real]Absence check using 945 positive place invariants in 954 ms returned sat
[2021-05-13 12:51:11] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 59 ms returned sat
[2021-05-13 12:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:51:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:51:29] [INFO ] [Real]Absence check using state equation in 18801 ms returned unknown
Applied a total of 0 rules in 124 ms. Remains 2457 /2457 variables (removed 0) and now considering 5400/5400 (removed 0) transitions.
// Phase 1: matrix 5400 rows 2457 cols
[2021-05-13 12:51:30] [INFO ] Computed 946 place invariants in 97 ms
[2021-05-13 12:51:31] [INFO ] [Real]Absence check using 945 positive place invariants in 953 ms returned sat
[2021-05-13 12:51:31] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 58 ms returned sat
[2021-05-13 12:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:51:58] [INFO ] [Real]Absence check using state equation in 27511 ms returned sat
[2021-05-13 12:51:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:52:00] [INFO ] [Nat]Absence check using 945 positive place invariants in 964 ms returned sat
[2021-05-13 12:52:00] [INFO ] [Nat]Absence check using 945 positive and 1 generalized place invariants in 60 ms returned sat
[2021-05-13 12:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:52:27] [INFO ] [Nat]Absence check using state equation in 27823 ms returned sat
[2021-05-13 12:52:28] [INFO ] Computed and/alt/rep : 4752/4752/4752 causal constraints in 238 ms.
[2021-05-13 12:52:43] [INFO ] Added : 385 causal constraints over 77 iterations in 15892 ms. Result :(error "Failed to check-sat")
[2021-05-13 12:52:43] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-13 12:52:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 53 ms.
[2021-05-13 12:52:44] [INFO ] Flatten gal took : 448 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ HypercubeGrid-PT-C4K3P3B12 @ 3570 seconds

FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3549
rslt: Output for ReachabilityFireability @ HypercubeGrid-PT-C4K3P3B12

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 12:52:45 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 175484,
"runtime": 21.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"JSON": "ReachabilityFireability.json",
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 4,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p716) AND (1 <= p923) AND (1 <= p665) AND (1 <= p1832) AND (1 <= p653) AND (1 <= p1817) AND (1 <= p697) AND (1 <= p1983) AND ((p824 <= 0) OR (p2120 <= 0)) AND ((p674 <= 0) OR (p1087 <= 0)) AND ((p663 <= 0) OR (p963 <= 0)) AND (((1 <= p243) AND (1 <= p1278)) OR ((1 <= p675) AND (1 <= p1848))))))",
"processed_size": 312,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 21600,
"conflict_clusters": 945,
"places": 2457,
"places_significant": 1511,
"singleton_clusters": 0,
"transitions": 5400
},
"result":
{
"edges": 5,
"markings": 6,
"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": 208,
"problems": 16
},
"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: 7857/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 78624
lola: finding significant places
lola: 2457 places, 5400 transitions, 1511 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 ReachabilityFireability.xml
lola: E (F (((1 <= p716) AND (1 <= p923) AND (1 <= p665) AND (1 <= p1832) AND (1 <= p653) AND (1 <= p1817) AND (1 <= p697) AND (1 <= p1983) AND ((p824 <= 0) OR (p2120 <= 0)) AND ((p674 <= 0) OR (p1087 <= 0)) AND ((p663 <= 0) OR (p963 <= 0)) AND (((1 <= p243) AND (1 <= p1278)) OR ((1 <= p675) AND (1 <= p1848))))))
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 (((1 <= p716) AND (1 <= p923) AND (1 <= p665) AND (1 <= p1832) AND (1 <= p653) AND (1 <= p1817) AND (1 <= p697) AND (1 <= p1983) AND ((p824 <= 0) OR (p2120 <= 0)) AND ((p674 <= 0) OR (p1087 <= 0)) AND ((p663 <= 0) OR (p963 <= 0)) AND (((1 <= p243) AND (1 <= p1278)) OR ((1 <= p675) AND (1 <= p1848))))))
lola: processed formula length: 312
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p716) AND (1 <= p923) AND (1 <= p665) AND (1 <= p1832) AND (1 <= p653) AND (1 <= p1817) AND (1 <= p697) AND (1 <= p1983) AND ((p824 <= 0) OR (p2120 <= 0)) AND ((p674 <= 0) OR (p1087 <= 0)) AND ((p663 <= 0) OR (p963 <= 0)) AND (((1 <= p243) AND (1 <= p1278)) OR ((1 <= p675) AND (1 <= p1848))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 208 literals and 16 conjunctive subformulas
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: memory consumption: 175484 KB
lola: time consumption: 21 seconds
lola: print data as JSON (--json)
lola: memory consumption: 175484 KB
lola: time consumption: 21 seconds
lola: writing JSON to ReachabilityFireability.json
lola: print data as JSON (--json)
lola: closed JSON file ReachabilityFireability.json
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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="HypercubeGrid-PT-C4K3P3B12"
export BK_EXAMINATION="ReachabilityFireability"
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 HypercubeGrid-PT-C4K3P3B12, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428200132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HypercubeGrid-PT-C4K3P3B12.tgz
mv HypercubeGrid-PT-C4K3P3B12 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;