Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815700334.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-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 itslola
Input is FlexibleBarrier-PT-12b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815700334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 3.7K Apr 4 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 4 07:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 07:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 3 21:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 3 21:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 3 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 3 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 536K Mar 24 05:37 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 FlexibleBarrier-PT-12b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591368426719

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 14:47:09] [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-05 14:47:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 14:47:09] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2020-06-05 14:47:09] [INFO ] Transformed 1988 places.
[2020-06-05 14:47:09] [INFO ] Transformed 2289 transitions.
[2020-06-05 14:47:09] [INFO ] Found NUPN structural information;
[2020-06-05 14:47:09] [INFO ] Parsed PT model containing 1988 places and 2289 transitions in 358 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 74 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 115 resets, run finished after 153 ms. (steps per millisecond=65 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2289 rows 1988 cols
[2020-06-05 14:47:10] [INFO ] Computed 14 place invariants in 145 ms
[2020-06-05 14:47:11] [INFO ] [Real]Absence check using 14 positive place invariants in 125 ms returned sat
[2020-06-05 14:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:47:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:47:15] [INFO ] [Real]Absence check using state equation in 4186 ms returned (error "Failed to check-sat")
[2020-06-05 14:47:16] [INFO ] [Real]Absence check using 14 positive place invariants in 104 ms returned sat
[2020-06-05 14:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:47:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:47:20] [INFO ] [Real]Absence check using state equation in 4460 ms returned (error "Failed to check-sat")
[2020-06-05 14:47:21] [INFO ] [Real]Absence check using 14 positive place invariants in 141 ms returned sat
[2020-06-05 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:47:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:47:25] [INFO ] [Real]Absence check using state equation in 4447 ms returned (error "Failed to check-sat")
[2020-06-05 14:47:26] [INFO ] [Real]Absence check using 14 positive place invariants in 146 ms returned sat
[2020-06-05 14:47:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:47:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:47:30] [INFO ] [Real]Absence check using state equation in 4277 ms returned (error "Failed to check-sat")
[2020-06-05 14:47:31] [INFO ] [Real]Absence check using 14 positive place invariants in 109 ms returned sat
[2020-06-05 14:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:47:35] [INFO ] [Real]Absence check using state equation in 4493 ms returned (error "Failed to check-sat")
[2020-06-05 14:47:36] [INFO ] [Real]Absence check using 14 positive place invariants in 148 ms returned sat
[2020-06-05 14:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:47:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:47:40] [INFO ] [Real]Absence check using state equation in 4440 ms returned (error "Failed to check-sat")
[2020-06-05 14:47:41] [INFO ] [Real]Absence check using 14 positive place invariants in 111 ms returned sat
[2020-06-05 14:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:47:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:47:45] [INFO ] [Real]Absence check using state equation in 4399 ms returned (error "Failed to check-sat")
[2020-06-05 14:47:46] [INFO ] [Real]Absence check using 14 positive place invariants in 149 ms returned sat
[2020-06-05 14:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:47:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:47:50] [INFO ] [Real]Absence check using state equation in 4467 ms returned (error "Failed to check-sat")
[2020-06-05 14:47:51] [INFO ] [Real]Absence check using 14 positive place invariants in 106 ms returned sat
[2020-06-05 14:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:47:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:47:55] [INFO ] [Real]Absence check using state equation in 4370 ms returned (error "Failed to check-sat")
[2020-06-05 14:47:56] [INFO ] [Real]Absence check using 14 positive place invariants in 170 ms returned sat
[2020-06-05 14:47:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:48:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:48:00] [INFO ] [Real]Absence check using state equation in 4299 ms returned (error "Failed to check-sat")
[2020-06-05 14:48:01] [INFO ] [Real]Absence check using 14 positive place invariants in 159 ms returned sat
[2020-06-05 14:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:48:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:48:05] [INFO ] [Real]Absence check using state equation in 4389 ms returned (error "Failed to check-sat")
[2020-06-05 14:48:06] [INFO ] [Real]Absence check using 14 positive place invariants in 107 ms returned sat
[2020-06-05 14:48:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:48:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:48:10] [INFO ] [Real]Absence check using state equation in 4463 ms returned (error "Failed to check-sat")
Support contains 55 out of 1988 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1869 edges and 1988 vertex of which 54 / 1988 are part of one of the 9 SCC in 24 ms
Free SCC test removed 45 places
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Performed 491 Post agglomeration using F-continuation condition.Transition count delta: 491
Iterating post reduction 0 with 545 rules applied. Total rules applied 546 place count 1943 transition count 1744
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 492 rules applied. Total rules applied 1038 place count 1452 transition count 1743
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 1038 place count 1452 transition count 1634
Deduced a syphon composed of 109 places in 2 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 1256 place count 1343 transition count 1634
Symmetric choice reduction at 2 with 708 rule applications. Total rules 1964 place count 1343 transition count 1634
Deduced a syphon composed of 708 places in 4 ms
Reduce places removed 708 places and 708 transitions.
Iterating global reduction 2 with 1416 rules applied. Total rules applied 3380 place count 635 transition count 926
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3380 place count 635 transition count 922
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 3388 place count 631 transition count 922
Symmetric choice reduction at 2 with 100 rule applications. Total rules 3488 place count 631 transition count 922
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 100 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 3688 place count 531 transition count 822
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 2 with 83 rules applied. Total rules applied 3771 place count 531 transition count 739
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 3929 place count 452 transition count 660
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 3949 place count 452 transition count 640
Symmetric choice reduction at 4 with 11 rule applications. Total rules 3960 place count 452 transition count 640
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 3982 place count 441 transition count 629
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3984 place count 440 transition count 629
Free-agglomeration rule applied 298 times.
Iterating global reduction 4 with 298 rules applied. Total rules applied 4282 place count 440 transition count 331
Reduce places removed 298 places and 0 transitions.
Drop transitions removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 4 with 363 rules applied. Total rules applied 4645 place count 142 transition count 266
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4646 place count 142 transition count 266
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 4683 place count 142 transition count 229
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4686 place count 142 transition count 226
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 4689 place count 139 transition count 226
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 4694 place count 139 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4695 place count 138 transition count 220
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 137 vertex of which 23 / 137 are part of one of the 11 SCC in 0 ms
Free SCC test removed 12 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 4698 place count 125 transition count 219
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 4722 place count 124 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 4722 place count 124 transition count 184
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 4746 place count 112 transition count 184
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 4757 place count 112 transition count 173
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 4781 place count 100 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4782 place count 100 transition count 160
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 4794 place count 100 transition count 148
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 4816 place count 88 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 4817 place count 88 transition count 138
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 4820 place count 88 transition count 135
Applied a total of 4820 rules in 732 ms. Remains 88 /1988 variables (removed 1900) and now considering 135/2289 (removed 2154) transitions.
Finished structural reductions, in 1 iterations. Remains : 88/1988 places, 135/2289 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3410 ms. (steps per millisecond=293 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 937 ms. (steps per millisecond=1067 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1075 ms. (steps per millisecond=930 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 957 ms. (steps per millisecond=1044 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1260 ms. (steps per millisecond=793 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties seen :[1, 1, 1, 1, 1, 1, 0]
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-05 14:48:19] [INFO ] Flow matrix only has 127 transitions (discarded 8 similar events)
// Phase 1: matrix 127 rows 88 cols
[2020-06-05 14:48:19] [INFO ] Computed 13 place invariants in 0 ms
[2020-06-05 14:48:19] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2020-06-05 14:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:48:19] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-06-05 14:48:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 14:48:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2020-06-05 14:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 14:48:19] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2020-06-05 14:48:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-05 14:48:19] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 14:48:20] [INFO ] Deduced a trap composed of 22 places in 53 ms
[2020-06-05 14:48:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

--------------------
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="FlexibleBarrier-PT-12b"
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 FlexibleBarrier-PT-12b, 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 r170-smll-158987815700334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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