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.r081-smll-158922978100527.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 itstools
Input is GPPP-PT-C0100N0000100000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922978100527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 4 09:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 4 09:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 3 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 3 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 3 13:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 3 13:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000100000-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589800491231

[2020-05-18 11:14:54] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 11:14:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 11:14:54] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-05-18 11:14:54] [INFO ] Transformed 33 places.
[2020-05-18 11:14:54] [INFO ] Transformed 22 transitions.
[2020-05-18 11:14:54] [INFO ] Parsed PT model containing 33 places and 22 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10436 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=226 ) properties seen :[0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 92 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 56 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2020-05-18 11:14:55] [INFO ] Computed 12 place invariants in 7 ms
[2020-05-18 11:14:55] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned unsat
[2020-05-18 11:14:55] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-18 11:14:55] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-18 11:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:14:55] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-05-18 11:14:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:14:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-05-18 11:14:55] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 17 ms returned sat
[2020-05-18 11:14:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 11:15:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:15:00] [INFO ] [Nat]Absence check using state equation in 4945 ms returned (error "Failed to check-sat")
[2020-05-18 11:15:00] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 11:15:00] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2020-05-18 11:15:00] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-18 11:15:00] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 11:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:15:00] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-18 11:15:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:15:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-05-18 11:15:00] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 11:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 11:15:00] [INFO ] [Nat]Absence check using state equation in 41 ms returned unsat
[2020-05-18 11:15:00] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-05-18 11:15:00] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 11:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:15:00] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-18 11:15:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:15:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-18 11:15:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:15:05] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4979 ms returned unknown
[2020-05-18 11:15:05] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-05-18 11:15:05] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 11:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:15:05] [INFO ] [Real]Absence check using state equation in 19 ms returned unsat
[2020-05-18 11:15:05] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-18 11:15:05] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-18 11:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:15:05] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 16 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 20
Applied a total of 6 rules in 28 ms. Remains 29 /33 variables (removed 4) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 29 cols
[2020-05-18 11:15:05] [INFO ] Computed 10 place invariants in 2 ms
[2020-05-18 11:15:05] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/33 places, 20/22 transitions.
Incomplete random walk after 1000179 steps, including 748 resets, run finished after 617 ms. (steps per millisecond=1621 ) properties seen :[1, 0]
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1443 ms. (steps per millisecond=693 ) properties seen :[0]
// Phase 1: matrix 20 rows 29 cols
[2020-05-18 11:15:07] [INFO ] Computed 10 place invariants in 2 ms
[2020-05-18 11:15:07] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-18 11:15:07] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-18 11:15:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:15:07] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-18 11:15:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:15:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-05-18 11:15:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:15:16] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 9030 ms returned unknown
Support contains 9 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 20/20 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 28 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 28 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 27 transition count 18
Applied a total of 4 rules in 7 ms. Remains 27 /29 variables (removed 2) and now considering 18/20 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/29 places, 18/20 transitions.
Incomplete random walk after 1000041 steps, including 761 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1358 ms. (steps per millisecond=736 ) properties seen :[0]
Interrupted probabilistic random walk after 27754340 steps, run timeout after 30001 ms. (steps per millisecond=925 ) properties seen :[0]
Probabilistic random walk after 27754340 steps, saw 3885714 distinct states, run finished after 30001 ms. (steps per millisecond=925 ) properties seen :[0]
// Phase 1: matrix 18 rows 27 cols
[2020-05-18 11:15:48] [INFO ] Computed 10 place invariants in 2 ms
[2020-05-18 11:15:48] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-05-18 11:15:48] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 11:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:15:48] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-18 11:15:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:15:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-05-18 11:15:48] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 105 ms returned sat
[2020-05-18 11:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 11:15:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:15:57] [INFO ] [Nat]Absence check using state equation in 9016 ms returned unknown
Support contains 9 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 18/18 transitions.
Starting structural reductions, iteration 0 : 27/27 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 27 cols
[2020-05-18 11:15:57] [INFO ] Computed 10 place invariants in 1 ms
[2020-05-18 11:15:57] [INFO ] Implicit Places using invariants in 37 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
[2020-05-18 11:15:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2020-05-18 11:15:57] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 11:15:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 25/27 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2020-05-18 11:15:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2020-05-18 11:15:58] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 11:15:58] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/27 places, 18/18 transitions.
Incomplete random walk after 1000161 steps, including 762 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties seen :[0]
Interrupted probabilistic random walk after 28622598 steps, run timeout after 30001 ms. (steps per millisecond=954 ) properties seen :[0]
Probabilistic random walk after 28622598 steps, saw 4003786 distinct states, run finished after 30001 ms. (steps per millisecond=954 ) properties seen :[0]
// Phase 1: matrix 18 rows 25 cols
[2020-05-18 11:16:29] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 11:16:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-18 11:16:29] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-18 11:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:16:29] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-18 11:16:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:16:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-18 11:16:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:16:38] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 9145 ms returned unknown
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2020-05-18 11:16:38] [INFO ] Computed 8 place invariants in 2 ms
[2020-05-18 11:16:38] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2020-05-18 11:16:38] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 11:16:38] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2020-05-18 11:16:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2020-05-18 11:16:38] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 11:16:38] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
Incomplete random walk after 100228 steps, including 76 resets, run finished after 37 ms. (steps per millisecond=2708 ) properties seen :[0]
// Phase 1: matrix 18 rows 25 cols
[2020-05-18 11:16:38] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 11:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-18 11:16:38] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-18 11:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:16:38] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-05-18 11:16:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-18 11:16:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:16:48] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 9098 ms returned unknown
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2020-05-18 11:16:48] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 11:16:48] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-18 11:16:48] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 7 ms returned sat
[2020-05-18 11:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:16:48] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-18 11:16:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:16:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-18 11:16:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:16:57] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 9077 ms returned unknown
[2020-05-18 11:16:57] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
[2020-05-18 11:16:57] [INFO ] Flatten gal took : 6 ms
[2020-05-18 11:16:57] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-18 11:16:57] [INFO ] Flatten gal took : 10 ms
[2020-05-18 11:16:57] [INFO ] Input system was already deterministic with 18 transitions.
[2020-05-18 11:16:57] [INFO ] Input system was already deterministic with 18 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph1933919575107416314.txt, -o, /tmp/graph1933919575107416314.bin, -w, /tmp/graph1933919575107416314.weights], workingDir=null]
[2020-05-18 11:16:57] [INFO ] Ran tautology test, simplified 0 / 1 in 82 ms.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1933919575107416314.bin, -l, -1, -v, -w, /tmp/graph1933919575107416314.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 25 cols
[2020-05-18 11:16:57] [INFO ] Computed 8 place invariants in 2 ms
[2020-05-18 11:16:57] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=0 took 16 ms
inv : ATP + Ru5P + Xu5P + R5P + S7P + GAP + E4P + F6P + G6P + 2*FBP + DHAP + _1_3_BPG - Pyr - Lac = 400000
inv : -2*Ru5P + 1051*Xu5P - 210602*R5P - 209851*S7P + 300*GAP - 151*E4P + 600*F6P + 600*FBP + 300*DHAP + 2*b1 + 1053*a2 - 300*c2 = 600
inv : Pi + _1_3_BPG + _3PG + Pyr + 700*start + Lac = 700
inv : a1 + a2 = 200
inv : 28*Ru5P + 21*Xu5P + 1428*R5P + 1435*S7P + 14*GAP + 21*E4P + 28*F6P + 28*G6P + 28*FBP + 14*DHAP + 16*_1_3_BPG + 16*_3PG + 16*Pyr + 11200*start + 16*Lac + 28*Gluc - 7*a2 + 2*c2 = 11200
inv : -Ru5P - Xu5P - R5P - S7P - GAP - E4P - F6P - G6P - 2*FBP - DHAP - _1_3_BPG + ADP + Pyr + 700*start + Lac = 700
inv : c1 + c2 = 700
inv : 2*Ru5P - 1051*Xu5P + 210602*R5P + 209851*S7P - 300*GAP + 151*E4P - 600*F6P - 600*FBP - 300*DHAP + 2*b2 - 1053*a2 + 300*c2 = 0
Total of 8 invariants.
[2020-05-18 11:16:57] [INFO ] Computed 8 place invariants in 4 ms
[2020-05-18 11:16:57] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=1 took 3 ms
[2020-05-18 11:16:57] [INFO ] Decomposing Gal with order
[2020-05-18 11:16:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 11:16:57] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=2 took 18 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 25 cols
[2020-05-18 11:16:57] [INFO ] Computed 8 place invariants in 0 ms
inv : ATP + Ru5P + Xu5P + R5P + S7P + GAP + E4P + F6P + G6P + 2*FBP + DHAP + _1_3_BPG - Pyr - Lac = 400000
inv : -2*Ru5P + 1051*Xu5P - 210602*R5P - 209851*S7P + 300*GAP - 151*E4P + 600*F6P + 600*FBP + 300*DHAP + 2*b1 + 1053*a2 - 300*c2 = 600
inv : Pi + _1_3_BPG + _3PG + Pyr + 700*start + Lac = 700
inv : a1 + a2 = 200
inv : 28*Ru5P + 21*Xu5P + 1428*R5P + 1435*S7P + 14*GAP + 21*E4P + 28*F6P + 28*G6P + 28*FBP + 14*DHAP + 16*_1_3_BPG + 16*_3PG + 16*Pyr + 11200*start + 16*Lac + 28*Gluc - 7*a2 + 2*c2 = 11200
inv : -Ru5P - Xu5P - R5P - S7P - GAP - E4P - F6P - G6P - 2*FBP - DHAP - _1_3_BPG + ADP + Pyr + 700*start + Lac = 700
inv : c1 + c2 = 700
inv : 2*Ru5P - 1051*Xu5P + 210602*R5P + 209851*S7P - 300*GAP + 151*E4P - 600*F6P - 600*FBP - 300*DHAP + 2*b2 - 1053*a2 + 300*c2 = 0
Total of 8 invariants.
[2020-05-18 11:16:57] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 11:16:57] [INFO ] Removed a total of 1 redundant transitions.
[2020-05-18 11:16:57] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=3 took 11 ms
[2020-05-18 11:16:57] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=4 took 7 ms
[2020-05-18 11:16:57] [INFO ] Flatten gal took : 40 ms
[2020-05-18 11:16:57] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=5 took 24 ms
[2020-05-18 11:16:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-18 11:16:57] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 2 ms
[2020-05-18 11:16:57] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [reachable] property : GPPP-PT-C0100N0000100000-ReachabilityFireability-12 with value :((((((i0.u0.ATP>=1)&&(u3.F6P>=1))&&(u4.S7P>=1))&&(i1.u1.GAP>=1))&&(i1.u5.c1>=700))&&((((i1.u1.DHAP>=1)&&(i0.u0._1_3_BPG>=1))&&(i0.u0.ADP>=1))||((((i0.u0._1_3_BPG>=1)&&(i0.u0.ADP>=1))&&(i0.u0.ATP>=700))&&(i0.u2.Lac>=700))))
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2020-05-18 11:16:57] [INFO ] Flatten gal took : 5 ms
[2020-05-18 11:16:57] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 1 ms
[2020-05-18 11:16:57] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
ITS-tools command line returned an error code 1

[2020-05-18 11:16:57] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=6 took 88 ms
its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityFireability.prop.
Read [reachable] property : GPPP-PT-C0100N0000100000-ReachabilityFireability-12 with value :((((((ATP>=1)&&(F6P>=1))&&(S7P>=1))&&(GAP>=1))&&(c1>=700))&&((((DHAP>=1)&&(_1_3_BPG>=1))&&(ADP>=1))||((((_1_3_BPG>=1)&&(ADP>=1))&&(ATP>=700))&&(Lac>=700))))
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
[2020-05-18 11:16:57] [INFO ] Proved 25 variables to be positive in 133 ms
[2020-05-18 11:16:57] [INFO ] Flatten gal took : 5 ms
[2020-05-18 11:16:57] [INFO ] Input system was already deterministic with 18 transitions.
[2020-05-18 11:16:57] [INFO ] Transformed 25 places.
[2020-05-18 11:16:57] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
[2020-05-18 11:16:57] [INFO ] Proved 25 variables to be positive in 219 ms
[2020-05-18 11:16:57] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2020-05-18 11:16:57] [INFO ] Computation of disable matrix completed :0/18 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 11:16:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 11:16:57] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2020-05-18 11:16:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-18 11:16:57] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 1 ms
[2020-05-18 11:16:57] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file ReachabilityFireability.prop.
Read [reachable] property : GPPP-PT-C0100N0000100000-ReachabilityFireability-12 with value :((((((ATP>=1)&&(F6P>=1))&&(S7P>=1))&&(GAP>=1))&&(c1>=700))&&((((DHAP>=1)&&(_1_3_BPG>=1))&&(ADP>=1))||((((_1_3_BPG>=1)&&(ADP>=1))&&(ATP>=700))&&(Lac>=700))))
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2020-05-18 11:16:58] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=7 took 367 ms
[2020-05-18 11:16:58] [INFO ] Computing symmetric co enabling matrix : 18 transitions.
[2020-05-18 11:16:58] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=8 took 451 ms
[2020-05-18 11:16:58] [INFO ] Computation of Finished co-enabling matrix. took 738 ms. Total solver calls (SAT/UNSAT): 153(124/29)
[2020-05-18 11:16:58] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2020-05-18 11:16:59] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=9 took 681 ms
[2020-05-18 11:17:00] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=10 took 803 ms
[2020-05-18 11:17:00] [INFO ] Computation of Completed DNA matrix. took 1226 ms. Total solver calls (SAT/UNSAT): 37(0/37)
[2020-05-18 11:17:00] [INFO ] Built C files in 2649ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 554 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, GPPPPTC0100N0000100000ReachabilityFireability12==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, GPPPPTC0100N0000100000ReachabilityFireability12==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, GPPPPTC0100N0000100000ReachabilityFireability12==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-18 11:17:01] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=11 took 1246 ms
[2020-05-18 11:17:04] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=12 took 2740 ms
[2020-05-18 11:17:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesGPPP-PT-C0100N0000100000-ReachabilityFireability-12
[2020-05-18 11:17:06] [INFO ] KInduction solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(SAT) depth K=0 took 8866 ms
[2020-05-18 11:17:06] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate GPPP-PT-C0100N0000100000-ReachabilityFireability-12
[2020-05-18 11:17:06] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for GPPP-PT-C0100N0000100000-ReachabilityFireability-12
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-12 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2020-05-18 11:17:06] [INFO ] KInduction solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(FALSE) depth K=1 took 13 ms
[2020-05-18 11:17:09] [INFO ] BMC solution for property GPPP-PT-C0100N0000100000-ReachabilityFireability-12(UNSAT) depth K=13 took 5018 ms
[2020-05-18 11:17:09] [INFO ] SMT solved all 1 properties. Interrupting other analysis methods.

BK_STOP 1589800630112

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="GPPP-PT-C0100N0000100000"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is GPPP-PT-C0100N0000100000, 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 r081-smll-158922978100527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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