Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928300270.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is HypercubeGrid-PT-C5K3P3B15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928300270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 5.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 10 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rwxr-xr-x 1 mcc users 14M Apr 27 15:14 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-C5K3P3B15-ReachabilityCardinality-00
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-01
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-02
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-03
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-04
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-05
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-06
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-07
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-08
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-09
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591202112448

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:35:13] [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]
[2020-06-03 16:35:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:35:14] [INFO ] Load time of PNML (sax parser for PT used): 721 ms
[2020-06-03 16:35:14] [INFO ] Transformed 9153 places.
[2020-06-03 16:35:14] [INFO ] Transformed 25110 transitions.
[2020-06-03 16:35:14] [INFO ] Parsed PT model containing 9153 places and 25110 transitions in 858 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 115 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 5983 ms. (steps per millisecond=1 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1]
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 602 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 614 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 611 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 575 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 606 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 635 ms. (steps per millisecond=15 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 647 ms. (steps per millisecond=15 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 620 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 641 ms. (steps per millisecond=15 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 583 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 577 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 25110 rows 9153 cols
[2020-06-03 16:35:29] [INFO ] Computed 3484 place invariants in 1952 ms
[2020-06-03 16:35:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:35:34] [INFO ] [Real]Absence check using 3483 positive place invariants in 4354 ms returned (error "Failed to check-sat")
[2020-06-03 16:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:35:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2020-06-03 16:35:39] [INFO ] [Real]Absence check using 3483 positive place invariants in 4343 ms returned (error "Failed to check-sat")
[2020-06-03 16:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:35:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2020-06-03 16:35:44] [INFO ] [Real]Absence check using 3483 positive place invariants in 3666 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 16:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:35:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-06-03 16:35:49] [INFO ] [Real]Absence check using 3483 positive place invariants in 3508 ms returned (error "Failed to check-sat")
[2020-06-03 16:35:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:35:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 3
[2020-06-03 16:35:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:35:55] [INFO ] [Real]Absence check using 3483 positive place invariants in 3898 ms returned (error "Failed to check-sat")
[2020-06-03 16:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:35:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
[2020-06-03 16:36:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:36:00] [INFO ] [Real]Absence check using 3483 positive place invariants in 3494 ms returned (error "Failed to check-sat")
[2020-06-03 16:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:36:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 5
[2020-06-03 16:36:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:36:05] [INFO ] [Real]Absence check using 3483 positive place invariants in 3880 ms returned (error "Failed to check-sat")
[2020-06-03 16:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:36:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 6
[2020-06-03 16:36:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:36:10] [INFO ] [Real]Absence check using 3483 positive place invariants in 3666 ms returned (error "Failed to check-sat")
[2020-06-03 16:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:36:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 7
[2020-06-03 16:36:13] [INFO ] [Real]Absence check using 3483 positive place invariants in 2757 ms returned unsat
[2020-06-03 16:36:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:36:18] [INFO ] [Real]Absence check using 3483 positive place invariants in 4430 ms returned (error "Failed to check-sat")
[2020-06-03 16:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:36:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 9
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 39 out of 9153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1585 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Interrupted random walk after 55755 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 80648 steps, including 0 resets, run timeout after 5032 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 81841 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 81945 steps, including 0 resets, run timeout after 5053 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 84968 steps, including 0 resets, run timeout after 5039 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 87319 steps, including 0 resets, run timeout after 5028 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 86895 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 90389 steps, including 0 resets, run timeout after 5034 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 89878 steps, including 0 resets, run timeout after 5044 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 25110 rows 9153 cols
[2020-06-03 16:37:32] [INFO ] Computed 3484 place invariants in 1434 ms
[2020-06-03 16:37:41] [INFO ] [Real]Absence check using 3483 positive place invariants in 8231 ms returned unsat
[2020-06-03 16:37:58] [INFO ] [Real]Absence check using 3483 positive place invariants in 16026 ms returned sat
[2020-06-03 16:37:58] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 747 ms returned sat
[2020-06-03 16:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:38:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:38:26] [INFO ] [Real]Absence check using state equation in 27144 ms returned (error "Failed to check-sat")
[2020-06-03 16:38:30] [INFO ] [Real]Absence check using 3483 positive place invariants in 3812 ms returned unsat
[2020-06-03 16:38:43] [INFO ] [Real]Absence check using 3483 positive place invariants in 11887 ms returned unsat
[2020-06-03 16:39:02] [INFO ] [Real]Absence check using 3483 positive place invariants in 19034 ms returned sat
[2020-06-03 16:39:03] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 771 ms returned sat
[2020-06-03 16:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:39:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:39:28] [INFO ] [Real]Absence check using state equation in 24667 ms returned unknown
[2020-06-03 16:39:57] [INFO ] [Real]Absence check using 3483 positive place invariants in 28359 ms returned sat
[2020-06-03 16:39:57] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 821 ms returned sat
[2020-06-03 16:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:40:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:40:13] [INFO ] [Real]Absence check using state equation in 15267 ms returned (error "Failed to check-sat")
[2020-06-03 16:40:19] [INFO ] [Real]Absence check using 3483 positive place invariants in 5305 ms returned unsat
[2020-06-03 16:40:39] [INFO ] [Real]Absence check using 3483 positive place invariants in 18970 ms returned sat
[2020-06-03 16:40:39] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 738 ms returned sat
[2020-06-03 16:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:41:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:41:04] [INFO ] [Real]Absence check using state equation in 24767 ms returned unknown
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 14 out of 9153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1701 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Interrupted random walk after 57412 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 90398 steps, including 0 resets, run timeout after 5017 ms. (steps per millisecond=18 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 86999 steps, including 0 resets, run timeout after 5027 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 90174 steps, including 0 resets, run timeout after 5028 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 88790 steps, including 0 resets, run timeout after 5016 ms. (steps per millisecond=17 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 279118 steps, run timeout after 30019 ms. (steps per millisecond=9 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 279118 steps, saw 110 distinct states, run finished after 30032 ms. (steps per millisecond=9 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 25110 rows 9153 cols
[2020-06-03 16:42:28] [INFO ] Computed 3484 place invariants in 1418 ms
[2020-06-03 16:43:01] [INFO ] [Real]Absence check using 3483 positive place invariants in 32487 ms returned sat
[2020-06-03 16:43:02] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 742 ms returned sat
[2020-06-03 16:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:43:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:43:13] [INFO ] [Real]Absence check using state equation in 10494 ms returned (error "Failed to check-sat")
[2020-06-03 16:43:32] [INFO ] [Real]Absence check using 3483 positive place invariants in 18755 ms returned sat
[2020-06-03 16:43:33] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 819 ms returned sat
[2020-06-03 16:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:43:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:43:58] [INFO ] [Real]Absence check using state equation in 24887 ms returned (error "Failed to check-sat")
[2020-06-03 16:44:13] [INFO ] [Real]Absence check using 3483 positive place invariants in 14238 ms returned sat
[2020-06-03 16:44:13] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 777 ms returned sat
[2020-06-03 16:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:44:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:44:43] [INFO ] [Real]Absence check using state equation in 29339 ms returned (error "Failed to check-sat")
[2020-06-03 16:44:57] [INFO ] [Real]Absence check using 3483 positive place invariants in 13469 ms returned sat
[2020-06-03 16:44:58] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 744 ms returned sat
[2020-06-03 16:44:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:45:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:45:28] [INFO ] [Real]Absence check using state equation in 30238 ms returned (error "Failed to check-sat")
Support contains 14 out of 9153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1676 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Starting structural reductions, iteration 0 : 9153/9153 places, 25110/25110 transitions.
Applied a total of 0 rules in 1195 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
// Phase 1: matrix 25110 rows 9153 cols
[2020-06-03 16:45:32] [INFO ] Computed 3484 place invariants in 1428 ms
[2020-06-03 16:45:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:46:04] [INFO ] Performed 1247/9153 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-03 16:46:34] [INFO ] Performed 2572/9153 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2020-06-03 16:47:04] [INFO ] Performed 4603/9153 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2020-06-03 16:47:34] [INFO ] Performed 6700/9153 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2020-06-03 16:47:34] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2020-06-03 16:47:34] [INFO ] Implicit Places using invariants in 123092 ms returned []
Implicit Place search using SMT only with invariants took 123105 ms to find 0 implicit places.
// Phase 1: matrix 25110 rows 9153 cols
[2020-06-03 16:47:35] [INFO ] Computed 3484 place invariants in 1483 ms
[2020-06-03 16:47:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:48:07] [INFO ] Performed 1381/25110 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2020-06-03 16:48:35] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= s2594 1) (>= s6158 1))") after 61552 ms
Finished structural reductions, in 1 iterations. Remains : 9153/9153 places, 25110/25110 transitions.
Interrupted random walk after 55870 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :[0, 1, 0, 1]
// Phase 1: matrix 25110 rows 9153 cols
[2020-06-03 16:49:07] [INFO ] Computed 3484 place invariants in 1436 ms
[2020-06-03 16:49:27] [INFO ] [Real]Absence check using 3483 positive place invariants in 19374 ms returned sat
[2020-06-03 16:49:27] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 29 ms returned (error "Failed to check-sat")
[2020-06-03 16:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:49:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2020-06-03 16:49:47] [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: Broken pipe (= 1 (+ s2873 s4493))") while checking expression at index 1
Applied a total of 0 rules in 1295 ms. Remains 9153 /9153 variables (removed 0) and now considering 25110/25110 (removed 0) transitions.
// Phase 1: matrix 25110 rows 9153 cols
[2020-06-03 16:49:50] [INFO ] Computed 3484 place invariants in 1547 ms
[2020-06-03 16:50:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:50:35] [INFO ] [Real]Absence check using 3483 positive place invariants in 43695 ms returned (error "Failed to check-sat")
[2020-06-03 16:50:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 0
[2020-06-03 16:51:20] [INFO ] [Real]Absence check using 3483 positive place invariants in 43665 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 16:51:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2020-06-03 16:51:48] [INFO ] [Real]Absence check using 3483 positive place invariants in 26369 ms returned sat
[2020-06-03 16:51:49] [INFO ] [Real]Absence check using 3483 positive and 1 generalized place invariants in 800 ms returned sat
[2020-06-03 16:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:52:05] [INFO ] [Real]Absence check using state equation in 16570 ms returned (error "Failed to check-sat")
[2020-06-03 16:52:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:52:50] [INFO ] [Real]Absence check using 3483 positive place invariants in 43709 ms returned (error "Failed to check-sat")
[2020-06-03 16:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-06-03 16:52:50] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2020-06-03 16:52:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 174 ms.
[2020-06-03 16:52:55] [INFO ] Flatten gal took : 3424 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ HypercubeGrid-PT-C5K3P3B15 @ 3570 seconds

FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3447
rslt: Output for ReachabilityCardinality @ HypercubeGrid-PT-C5K3P3B15

{
"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",
"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": "Wed Jun 3 16:52:56 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 862
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((2 <= p457)))",
"processed_size": 19,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1149
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p2569 <= p2423)))",
"processed_size": 24,
"rewrites": 1
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1724
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p1989 <= p3366) AND (1 <= p6753))))",
"processed_size": 43,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3448
},
"exit":
{
"localtimelimitreached": false
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p5400 <= p217) OR (p6808 <= p1057) OR (p8761 <= p5104) OR (p7222 <= p3582))))",
"processed_size": 88,
"rewrites": 2
},
"result":
{
"edges": 182,
"markings": 183,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 2024000,
"runtime": 123.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 100440,
"conflict_clusters": 3483,
"places": 9153,
"places_significant": 5669,
"singleton_clusters": 0,
"transitions": 25110
},
"result":
{
"preliminary_value": "no yes yes no ",
"value": "no yes yes no "
},
"task":
{
"type": "compound"
}
}
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: 34263/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 292896
lola: finding significant places
lola: 9153 places, 25110 transitions, 5669 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 (((p5400 <= p217) OR (p6808 <= p1057) OR (p8761 <= p5104) OR (p7222 <= p3582)))) : E (F ((p2569 <= p2423))) : E (F (((p1989 <= p3366) AND (1 <= p6753)))) : A (G ((2 <= p457)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 862 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p457)))
lola: ========================================
lola: SUBTASK
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 ((2 <= p457)))
lola: processed formula length: 19
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: 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: state equation task get result unparse finished++ id 0
lola: formula 0: (p457 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 1149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p2569 <= p2423)))
lola: ========================================
lola: SUBTASK
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 ((p2569 <= p2423)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2569 <= p2423)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 2 will run for 1724 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p1989 <= p3366) AND (1 <= p6753))))
lola: ========================================
lola: SUBTASK
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 (((p1989 <= p3366) AND (1 <= p6753))))
lola: processed formula length: 43
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1989 <= p3366) AND (1 <= p6753))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 3448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p5400 <= p217) OR (p6808 <= p1057) OR (p8761 <= p5104) OR (p7222 <= p3582))))
lola: ========================================
lola: SUBTASK
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 (((p5400 <= p217) OR (p6808 <= p1057) OR (p8761 <= p5104) OR (p7222 <= p3582))))
lola: processed formula length: 88
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: 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p217 + 1 <= p5400) AND (p1057 + 1 <= p6808) AND (p5104 + 1 <= p8761) AND (p3582 + 1 <= p7222))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 183 markings, 182 edges
lola: RESULT
lola:
SUMMARY: no yes yes no
lola:
preliminary result: no yes yes no
lola: ========================================
lola: memory consumption: 2024000 KB
lola: time consumption: 123 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="HypercubeGrid-PT-C5K3P3B15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is HypercubeGrid-PT-C5K3P3B15, 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 r184-oct2-158987928300270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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