About the Execution of ITS-Tools for Angiogenesis-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.450 | 12569.00 | 23954.00 | 295.20 | TTFFFTFFTFFFTFFF | normal |
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.r006-smll-158897515900317.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 Angiogenesis-PT-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897515900317
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.6K Apr 28 14:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 28 14:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 28 14:22 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 28 14:22 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 28 14:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 28 14:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 28 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 28 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 28 14:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 28 14:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 28 14:22 instance
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 iscolored
-rw-r--r-- 1 mcc users 34K Apr 28 14:22 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 Angiogenesis-PT-01-00
FORMULA_NAME Angiogenesis-PT-01-01
FORMULA_NAME Angiogenesis-PT-01-02
FORMULA_NAME Angiogenesis-PT-01-03
FORMULA_NAME Angiogenesis-PT-01-04
FORMULA_NAME Angiogenesis-PT-01-05
FORMULA_NAME Angiogenesis-PT-01-06
FORMULA_NAME Angiogenesis-PT-01-07
FORMULA_NAME Angiogenesis-PT-01-08
FORMULA_NAME Angiogenesis-PT-01-09
FORMULA_NAME Angiogenesis-PT-01-10
FORMULA_NAME Angiogenesis-PT-01-11
FORMULA_NAME Angiogenesis-PT-01-12
FORMULA_NAME Angiogenesis-PT-01-13
FORMULA_NAME Angiogenesis-PT-01-14
FORMULA_NAME Angiogenesis-PT-01-15
=== Now, execution of the tool begins
BK_START 1589480441137
[2020-05-14 18:20:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-14 18:20:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-14 18:20:44] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2020-05-14 18:20:44] [INFO ] Transformed 39 places.
[2020-05-14 18:20:44] [INFO ] Transformed 64 transitions.
[2020-05-14 18:20:44] [INFO ] Found NUPN structural information;
[2020-05-14 18:20:44] [INFO ] Parsed PT model containing 39 places and 64 transitions in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 664 ms. (steps per millisecond=150 ) properties seen :[1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0]
// Phase 1: matrix 64 rows 39 cols
[2020-05-14 18:20:45] [INFO ] Computed 8 place invariants in 10 ms
[2020-05-14 18:20:45] [INFO ] [Real]Absence check using 8 positive place invariants in 46 ms returned sat
[2020-05-14 18:20:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:45] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-05-14 18:20:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 21 ms returned sat
[2020-05-14 18:20:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:45] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2020-05-14 18:20:45] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 20 ms.
[2020-05-14 18:20:46] [INFO ] Added : 60 causal constraints over 13 iterations in 304 ms. Result :sat
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-14 18:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-05-14 18:20:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned unsat
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-14 18:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-14 18:20:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-14 18:20:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-05-14 18:20:46] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 10 ms.
[2020-05-14 18:20:46] [INFO ] Added : 60 causal constraints over 12 iterations in 140 ms. Result :sat
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-14 18:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-14 18:20:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned unsat
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-14 18:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-14 18:20:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned unsat
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-14 18:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-05-14 18:20:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-14 18:20:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:46] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-05-14 18:20:46] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-05-14 18:20:46] [INFO ] Added : 51 causal constraints over 11 iterations in 106 ms. Result :sat
[2020-05-14 18:20:46] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-14 18:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-05-14 18:20:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-14 18:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:47] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-05-14 18:20:47] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 5 ms.
[2020-05-14 18:20:47] [INFO ] Added : 60 causal constraints over 13 iterations in 143 ms. Result :sat
[2020-05-14 18:20:47] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-14 18:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:47] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-05-14 18:20:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-14 18:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:47] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-05-14 18:20:47] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 8 ms.
[2020-05-14 18:20:47] [INFO ] Added : 60 causal constraints over 13 iterations in 217 ms. Result :sat
[2020-05-14 18:20:47] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-14 18:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:47] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-14 18:20:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-05-14 18:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:47] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2020-05-14 18:20:47] [INFO ] Deduced a trap composed of 23 places in 55 ms
[2020-05-14 18:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2020-05-14 18:20:47] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 10 ms.
[2020-05-14 18:20:48] [INFO ] Added : 60 causal constraints over 13 iterations in 240 ms. Result :sat
[2020-05-14 18:20:48] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-14 18:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-14 18:20:48] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 12 ms.
[2020-05-14 18:20:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-14 18:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:48] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-05-14 18:20:48] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 11 ms.
[2020-05-14 18:20:48] [INFO ] Added : 61 causal constraints over 13 iterations in 211 ms. Result :sat
[2020-05-14 18:20:48] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-14 18:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:48] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-14 18:20:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-14 18:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:48] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2020-05-14 18:20:48] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 10 ms.
[2020-05-14 18:20:48] [INFO ] Added : 58 causal constraints over 12 iterations in 158 ms. Result :sat
[2020-05-14 18:20:48] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-05-14 18:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:48] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-14 18:20:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-14 18:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:48] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2020-05-14 18:20:48] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 10 ms.
[2020-05-14 18:20:49] [INFO ] Added : 61 causal constraints over 13 iterations in 164 ms. Result :sat
[2020-05-14 18:20:49] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned unsat
[2020-05-14 18:20:49] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned unsat
[2020-05-14 18:20:49] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-14 18:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:49] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-14 18:20:49] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 11 ms.
[2020-05-14 18:20:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-05-14 18:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:49] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2020-05-14 18:20:49] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-05-14 18:20:49] [INFO ] Added : 60 causal constraints over 12 iterations in 181 ms. Result :sat
[2020-05-14 18:20:49] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-14 18:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:49] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-14 18:20:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-14 18:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:49] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-05-14 18:20:49] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-05-14 18:20:49] [INFO ] Added : 57 causal constraints over 12 iterations in 164 ms. Result :sat
[2020-05-14 18:20:49] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-14 18:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:49] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-05-14 18:20:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2020-05-14 18:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:50] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-05-14 18:20:50] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 10 ms.
[2020-05-14 18:20:50] [INFO ] Added : 59 causal constraints over 12 iterations in 171 ms. Result :sat
[2020-05-14 18:20:50] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-14 18:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:50] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-14 18:20:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned unsat
[2020-05-14 18:20:50] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-14 18:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:50] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-05-14 18:20:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-14 18:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:50] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-05-14 18:20:50] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 10 ms.
[2020-05-14 18:20:50] [INFO ] Added : 57 causal constraints over 13 iterations in 160 ms. Result :sat
[2020-05-14 18:20:50] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-14 18:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:50] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-05-14 18:20:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-14 18:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:50] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2020-05-14 18:20:50] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-05-14 18:20:51] [INFO ] Added : 57 causal constraints over 13 iterations in 159 ms. Result :sat
[2020-05-14 18:20:51] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-14 18:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:51] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-14 18:20:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2020-05-14 18:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:51] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-05-14 18:20:51] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-05-14 18:20:51] [INFO ] Added : 5 causal constraints over 2 iterations in 29 ms. Result :sat
[2020-05-14 18:20:51] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-14 18:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:51] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-14 18:20:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-14 18:20:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-05-14 18:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-14 18:20:51] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2020-05-14 18:20:51] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-05-14 18:20:51] [INFO ] Added : 5 causal constraints over 2 iterations in 29 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-05-14 18:20:51] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-14 18:20:51] [INFO ] Flatten gal took : 78 ms
FORMULA Angiogenesis-PT-01-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-14 18:20:51] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-14 18:20:51] [INFO ] Applying decomposition
[2020-05-14 18:20:51] [INFO ] Flatten gal took : 23 ms
[2020-05-14 18:20:51] [INFO ] Input system was already deterministic with 64 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 64 rows 39 cols
[2020-05-14 18:20:51] [INFO ] Computed 8 place invariants in 3 ms
inv : KdStar + KdStarG + KdStarGP3 + KdStarGStar + KdStarGStarP3 + KdStarGStarP3k + KdStarGStarP3kP3 + KdStarGStarP3kStar + KdStarGStarP3kStarP2 + KdStarGStarP3kStarP3 + KdStarGStarP3kStarP3P2 + KdStarGStarPg + KdStarGStarPgP3 + KdStarGStarPgStar + KdStarGStarPgStarP2 + KdStarGStarPgStarP3 + KdStarGStarPgStarP3P2 + KdStarPg + KdStarPgStar + KdStarPgStarP2 = 1
inv : Gab1 + GP3 + GStarP3 + GStarP3kP3 + GStarPgP3 + KdStarG + KdStarGP3 + KdStarGStar + KdStarGStarP3 + KdStarGStarP3k + KdStarGStarP3kP3 + KdStarGStarP3kStar + KdStarGStarP3kStarP2 + KdStarGStarP3kStarP3 + KdStarGStarP3kStarP3P2 + KdStarGStarPg + KdStarGStarPgP3 + KdStarGStarPgStar + KdStarGStarPgStarP2 + KdStarGStarPgStarP3 + KdStarGStarPgStarP3P2 = 1
inv : DAGE + Enz = 1
inv : GStarPgP3 + KdStarGStarPg + KdStarGStarPgP3 + KdStarGStarPgStar + KdStarGStarPgStarP2 + KdStarGStarPgStarP3 + KdStarGStarPgStarP3P2 + KdStarPg + KdStarPgStar + KdStarPgStarP2 + Pg = 1
inv : Pten + PtP2 + PtP3 + PtP3P2 = 1
inv : AktP3 + DAG + DAGE + GP3 + GStarP3 + GStarP3kP3 + GStarPgP3 + KdStarGP3 + KdStarGStarP3 + KdStarGStarP3kP3 + KdStarGStarP3kStarP2 + KdStarGStarP3kStarP3 + 2*KdStarGStarP3kStarP3P2 + KdStarGStarPgP3 + KdStarGStarPgStarP2 + KdStarGStarPgStarP3 + 2*KdStarGStarPgStarP3P2 + KdStarPgStarP2 + Pip2 + Pip3 + PtP2 + PtP3 + 2*PtP3P2 = 1
inv : Akt + AktP3 + AktStar = 1
inv : GStarP3kP3 + KdStarGStarP3k + KdStarGStarP3kP3 + KdStarGStarP3kStar + KdStarGStarP3kStarP2 + KdStarGStarP3kStarP3 + KdStarGStarP3kStarP3P2 + P3k = 1
Total of 8 invariants.
[2020-05-14 18:20:51] [INFO ] Computed 8 place invariants in 4 ms
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/graph696740722710087451.txt, -o, /tmp/graph696740722710087451.bin, -w, /tmp/graph696740722710087451.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph696740722710087451.bin, -l, -1, -v, -w, /tmp/graph696740722710087451.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-14 18:20:52] [INFO ] Proved 39 variables to be positive in 91 ms
[2020-05-14 18:20:52] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2020-05-14 18:20:52] [INFO ] Computation of disable matrix completed :0/64 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-14 18:20:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-14 18:20:52] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2020-05-14 18:20:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-14 18:20:52] [INFO ] Decomposing Gal with order
[2020-05-14 18:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-14 18:20:52] [INFO ] Removed a total of 39 redundant transitions.
[2020-05-14 18:20:52] [INFO ] Flatten gal took : 79 ms
[2020-05-14 18:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2020-05-14 18:20:52] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-14 18:20:52] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !((G(!(G(((F(!(F(G("((i3.u2.GStarP3kP3==0)||(i6.u13.PtP2==1))")))))||("(i1.u4.KdStarGStar==0)"))||("(i6.u11.AktP3==1)"))))))
Formula 0 simplified : !G!G("(i1.u4.KdStarGStar==0)" | "(i6.u11.AktP3==1)" | F!FG"((i3.u2.GStarP3kP3==0)||(i6.u13.PtP2==1))")
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i1.u4.k2, i6.k55, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :14/47/2/63
Computing Next relation with stutter on 4 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.097144,18436,1,0,1685,164,1002,2338,183,377,9068
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Angiogenesis-PT-01-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(F("((i3.u2.KdStarGStarP3kP3!=0)&&(i3.u7.KdStarGStarP3kStarP3!=1))"))))
Formula 1 simplified : F"((i3.u2.KdStarGStarP3kP3!=0)&&(i3.u7.KdStarGStarP3kStarP3!=1))"
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.104408,18696,1,0,1916,164,1044,2643,184,377,10189
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Angiogenesis-PT-01-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X((F("(i3.u2.GStarP3kP3==1)"))U(X("((i2.u3.GStarPgP3==0)||(i0.u0.DAGE==1))"))))))
Formula 2 simplified : !GX(F"(i3.u2.GStarP3kP3==1)" U X"((i2.u3.GStarPgP3==0)||(i0.u0.DAGE==1))")
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.10949,19076,1,0,2034,164,1068,2776,185,377,10802
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Angiogenesis-PT-01-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((((F(((X("((i6.u12.PtP3==0)||(u10.KdStarPgStarP2==1))"))||("(i3.u2.P3k==0)"))||("(i0.u8.KdStarGStarPgStarP2==1)")))&&(G("((i6.u12.PtP3==0)||(u10.KdStarPgStarP2==1))")))&&(X(X(G("((i2.u3.KdStarGStarPgP3==0)||(i1.u5.KdStarGStarP3==1))"))))))
Formula 3 simplified : !(F("(i0.u8.KdStarGStarPgStarP2==1)" | "(i3.u2.P3k==0)" | X"((i6.u12.PtP3==0)||(u10.KdStarPgStarP2==1))") & G"((i6.u12.PtP3==0)||(u10.KdStarPgStarP2==1))" & XXG"((i2.u3.KdStarGStarPgP3==0)||(i1.u5.KdStarGStarP3==1))")
Computing Next relation with stutter on 4 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.129128,19940,1,0,2866,168,1107,3782,186,397,14279
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Angiogenesis-PT-01-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(((G("((i6.u12.Pten==0)||(i0.u8.KdStarGStarPgStarP2==1))"))U("((i6.u11.Pip3!=0)&&(u10.KdStarPgStarP2!=1))"))&&(!(X("((i6.u11.Pip3==0)||(u10.KdStarPgStarP2==1))")))))||(G("((i6.u11.Pip3==0)||(u10.KdStarPgStarP2==1))"))))
Formula 4 simplified : !(G((G"((i6.u12.Pten==0)||(i0.u8.KdStarGStarPgStarP2==1))" U "((i6.u11.Pip3!=0)&&(u10.KdStarPgStarP2!=1))") & !X"((i6.u11.Pip3==0)||(u10.KdStarPgStarP2==1))") | G"((i6.u11.Pip3==0)||(u10.KdStarPgStarP2==1))")
Computing Next relation with stutter on 4 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.140604,20396,1,0,2922,168,1192,3904,188,397,14770
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Angiogenesis-PT-01-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F("((i6.u13.PtP2==0)||(i0.u8.KdStarGStarPgStarP2==1))"))))
Formula 5 simplified : !XF"((i6.u13.PtP2==0)||(i0.u8.KdStarGStarPgStarP2==1))"
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.143518,20396,1,0,2991,168,1222,3986,188,397,15141
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Angiogenesis-PT-01-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((!(X(((G(!(X("((i3.u2.GStarP3kP3==0)||(i0.u0.DAG==1))"))))||("(i3.u2.GStarP3kP3==0)"))||("(i0.u0.DAG==1)"))))U(!(F("(((i3.u7.KdStarGStarP3kStarP3==0)||(i6.u13.PtP2==1))&&((i1.u5.KdStar==0)||(i2.u3.GStarPgP3==1)))"))))))
Formula 6 simplified : !G(!X("(i0.u0.DAG==1)" | "(i3.u2.GStarP3kP3==0)" | G!X"((i3.u2.GStarP3kP3==0)||(i0.u0.DAG==1))") U !F"(((i3.u7.KdStarGStarP3kStarP3==0)||(i6.u13.PtP2==1))&&((i1.u5.KdStar==0)||(i2.u3.GStarPgP3==1)))")
Computing Next relation with stutter on 4 deadlock states
3 unique states visited
2 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.15342,20592,1,0,3175,168,1250,4208,188,397,16079
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Angiogenesis-PT-01-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((G("((i0.u8.KdStarGStarPgStarP2==0)||(i1.u5.KdStar==1))"))&&(!(X(X("(u10.KdStarPg==1)")))))))
Formula 7 simplified : !X(G"((i0.u8.KdStarGStarPgStarP2==0)||(i1.u5.KdStar==1))" & !XX"(u10.KdStarPg==1)")
Computing Next relation with stutter on 4 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.167318,20856,1,0,3708,168,1300,4831,189,397,18566
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Angiogenesis-PT-01-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-14 18:20:52] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-14 18:20:52] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
[2020-05-14 18:20:52] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 24) 1) (>= (select s0 31) 1)) (= (store (store (store s0 24 (- (select s0 24) 1)) 31 (- (select s0 31) 1)) 25 (+ (select s0 25) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 24) 1) (>= (select s0 31) 1)) (= (store (store (store s0 24 (- (select s0 24) 1)) 31 (- (select s0 31) 1)) 25 (+ (select s0 25) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-14 18:20:52] [INFO ] Built C files in 628ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1589480453706
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Angiogenesis-PT-01"
export BK_EXAMINATION="LTLCardinality"
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 Angiogenesis-PT-01, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-smll-158897515900317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-01.tgz
mv Angiogenesis-PT-01 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;