About the Execution of ITS-Tools for Dekker-PT-015
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.390 | 5908.00 | 14249.00 | 56.00 | FFFFFFFFFFTFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814100313.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Dekker-PT-015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814100313
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 141K Apr 27 14:36 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 Dekker-PT-015-00
FORMULA_NAME Dekker-PT-015-01
FORMULA_NAME Dekker-PT-015-02
FORMULA_NAME Dekker-PT-015-03
FORMULA_NAME Dekker-PT-015-04
FORMULA_NAME Dekker-PT-015-05
FORMULA_NAME Dekker-PT-015-06
FORMULA_NAME Dekker-PT-015-07
FORMULA_NAME Dekker-PT-015-08
FORMULA_NAME Dekker-PT-015-09
FORMULA_NAME Dekker-PT-015-10
FORMULA_NAME Dekker-PT-015-11
FORMULA_NAME Dekker-PT-015-12
FORMULA_NAME Dekker-PT-015-13
FORMULA_NAME Dekker-PT-015-14
FORMULA_NAME Dekker-PT-015-15
=== Now, execution of the tool begins
BK_START 1590110842757
[2020-05-22 01:27:24] [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-22 01:27:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:27:24] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2020-05-22 01:27:24] [INFO ] Transformed 75 places.
[2020-05-22 01:27:24] [INFO ] Transformed 255 transitions.
[2020-05-22 01:27:24] [INFO ] Found NUPN structural information;
[2020-05-22 01:27:24] [INFO ] Parsed PT model containing 75 places and 255 transitions in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 410 ms. (steps per millisecond=243 ) properties seen :[1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1]
[2020-05-22 01:27:24] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2020-05-22 01:27:24] [INFO ] Computed 45 place invariants in 8 ms
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive place invariants in 25 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-05-22 01:27:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 7 ms returned unsat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-22 01:27:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:25] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-05-22 01:27:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2020-05-22 01:27:25] [INFO ] [Nat]Added 15 Read/Feed constraints in 8 ms returned sat
[2020-05-22 01:27:25] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-05-22 01:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2020-05-22 01:27:25] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 9 ms.
[2020-05-22 01:27:25] [INFO ] Added : 16 causal constraints over 4 iterations in 54 ms. Result :sat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 10 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-22 01:27:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned unsat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-22 01:27:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 5 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:25] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Nat]Added 15 Read/Feed constraints in 8 ms returned sat
[2020-05-22 01:27:25] [INFO ] Deduced a trap composed of 5 places in 15 ms
[2020-05-22 01:27:25] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-05-22 01:27:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 38 ms
[2020-05-22 01:27:25] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 10 ms.
[2020-05-22 01:27:25] [INFO ] Added : 16 causal constraints over 4 iterations in 40 ms. Result :sat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-22 01:27:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned unsat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-22 01:27:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned unsat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:25] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-22 01:27:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 5 places in 10 ms
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-05-22 01:27:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 90 ms
[2020-05-22 01:27:26] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 7 ms.
[2020-05-22 01:27:26] [INFO ] Added : 16 causal constraints over 4 iterations in 35 ms. Result :sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-22 01:27:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 7 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 2 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 5 places in 9 ms
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-05-22 01:27:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 24 ms
[2020-05-22 01:27:26] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 8 ms.
[2020-05-22 01:27:26] [INFO ] Added : 16 causal constraints over 4 iterations in 35 ms. Result :sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 2 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-22 01:27:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 5 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-22 01:27:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 2 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 5 places in 15 ms
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-05-22 01:27:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 45 ms
[2020-05-22 01:27:26] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 7 ms.
[2020-05-22 01:27:26] [INFO ] Added : 16 causal constraints over 4 iterations in 38 ms. Result :sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-22 01:27:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 5 places in 9 ms
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-05-22 01:27:26] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-05-22 01:27:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 35 ms
[2020-05-22 01:27:26] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 7 ms.
[2020-05-22 01:27:26] [INFO ] Added : 16 causal constraints over 4 iterations in 34 ms. Result :sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-22 01:27:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-22 01:27:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned unsat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2020-05-22 01:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:27] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-22 01:27:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2020-05-22 01:27:27] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-05-22 01:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:27] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-05-22 01:27:27] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
[2020-05-22 01:27:27] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-05-22 01:27:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2020-05-22 01:27:27] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 8 ms.
[2020-05-22 01:27:27] [INFO ] Added : 16 causal constraints over 4 iterations in 47 ms. Result :sat
[2020-05-22 01:27:27] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2020-05-22 01:27:27] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 2 ms returned sat
[2020-05-22 01:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:27] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-22 01:27:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 7 ms returned unsat
[2020-05-22 01:27:27] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-05-22 01:27:27] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 5 ms returned sat
[2020-05-22 01:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:27] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-22 01:27:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:27:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-22 01:27:27] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2020-05-22 01:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:27:27] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2020-05-22 01:27:27] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-05-22 01:27:27] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 17 ms.
[2020-05-22 01:27:27] [INFO ] Added : 16 causal constraints over 4 iterations in 56 ms. Result :sat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2020-05-22 01:27:27] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-22 01:27:27] [INFO ] Flatten gal took : 66 ms
FORMULA Dekker-PT-015-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:27:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-22 01:27:27] [INFO ] Flatten gal took : 23 ms
[2020-05-22 01:27:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Dekker-PT-015-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:27:27] [INFO ] Applying decomposition
[2020-05-22 01:27:27] [INFO ] Flatten gal took : 23 ms
[2020-05-22 01:27:27] [INFO ] Input system was already deterministic with 255 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/graph9203552248310490898.txt, -o, /tmp/graph9203552248310490898.bin, -w, /tmp/graph9203552248310490898.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/graph9203552248310490898.bin, -l, -1, -v, -w, /tmp/graph9203552248310490898.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:27:28] [INFO ] Decomposing Gal with order
[2020-05-22 01:27:28] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 60 out of 255 initially.
// Phase 1: matrix 60 rows 75 cols
[2020-05-22 01:27:28] [INFO ] Computed 45 place invariants in 2 ms
inv : flag_0_12 + p1_12 + p3_12 = 1
inv : flag_1_14 - p1_14 - p3_14 = 0
inv : flag_1_11 - p1_11 - p3_11 = 0
inv : p0_6 + p1_6 + p3_6 = 1
inv : flag_1_1 - p1_1 - p3_1 = 0
inv : p0_12 + p1_12 + p3_12 = 1
inv : flag_1_5 - p1_5 - p3_5 = 0
inv : p0_2 + p1_2 + p3_2 = 1
inv : flag_0_0 + p1_0 + p3_0 = 1
inv : flag_0_2 + p1_2 + p3_2 = 1
inv : flag_0_6 + p1_6 + p3_6 = 1
inv : flag_1_10 - p1_10 - p3_10 = 0
inv : flag_1_2 - p1_2 - p3_2 = 0
inv : p0_8 + p1_8 + p3_8 = 1
inv : flag_1_7 - p1_7 - p3_7 = 0
inv : p0_0 + p1_0 + p3_0 = 1
inv : p0_5 + p1_5 + p3_5 = 1
inv : p0_3 + p1_3 + p3_3 = 1
inv : flag_0_3 + p1_3 + p3_3 = 1
inv : p0_13 + p1_13 + p3_13 = 1
inv : flag_0_11 + p1_11 + p3_11 = 1
inv : flag_0_7 + p1_7 + p3_7 = 1
inv : flag_0_1 + p1_1 + p3_1 = 1
inv : p0_1 + p1_1 + p3_1 = 1
inv : flag_1_3 - p1_3 - p3_3 = 0
inv : flag_1_6 - p1_6 - p3_6 = 0
inv : p0_7 + p1_7 + p3_7 = 1
inv : flag_1_9 - p1_9 - p3_9 = 0
inv : p0_10 + p1_10 + p3_10 = 1
inv : flag_0_10 + p1_10 + p3_10 = 1
inv : flag_0_14 + p1_14 + p3_14 = 1
inv : flag_0_4 + p1_4 + p3_4 = 1
inv : flag_0_8 + p1_8 + p3_8 = 1
inv : p0_11 + p1_11 + p3_11 = 1
inv : p0_14 + p1_14 + p3_14 = 1
inv : flag_1_13 - p1_13 - p3_13 = 0
inv : flag_1_8 - p1_8 - p3_8 = 0
inv : p0_9 + p1_9 + p3_9 = 1
inv : flag_1_12 - p1_12 - p3_12 = 0
inv : flag_1_4 - p1_4 - p3_4 = 0
inv : flag_0_13 + p1_13 + p3_13 = 1
inv : flag_1_0 - p1_0 - p3_0 = 0
inv : flag_0_5 + p1_5 + p3_5 = 1
inv : p0_4 + p1_4 + p3_4 = 1
inv : flag_0_9 + p1_9 + p3_9 = 1
Total of 45 invariants.
[2020-05-22 01:27:28] [INFO ] Computed 45 place invariants in 3 ms
[2020-05-22 01:27:28] [INFO ] Removed a total of 697 redundant transitions.
[2020-05-22 01:27:28] [INFO ] Flatten gal took : 64 ms
[2020-05-22 01:27:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2020-05-22 01:27:28] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-22 01:27:28] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 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-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 11 LTL properties
Checking formula 0 : !((F(X(G("((i12.u7.p3_6==0)||(i11.u18.p1_4==1))")))))
Formula 0 simplified : !FXG"((i12.u7.p3_6==0)||(i11.u18.p1_4==1))"
built 106 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u1.exit_1, u2.exit_2, u8.exit_7, u10.exit_9, u12.exit_11, u13.exit_12, u15.exit_14, i0.exit_0, i3.exit_3, i4.exit_5, i6.exit_8, i11.exit_4, i12.exit_6, i13.exit_10, i14.exit_13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/240/15/255
[2020-05-22 01:27:28] [INFO ] Proved 75 variables to be positive in 196 ms
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 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.115547,20432,1,0,9545,171,2517,8033,259,228,17274
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-015-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(F((F("(i13.u11.p1_10==1)"))U(G(F("((u13.p3_12!=0)&&(i4.u5.flag_0_5!=1))")))))))
Formula 1 simplified : F(F"(i13.u11.p1_10==1)" U GF"((u13.p3_12!=0)&&(i4.u5.flag_0_5!=1))")
[2020-05-22 01:27:28] [INFO ] Computing symmetric may disable matrix : 255 transitions.
[2020-05-22 01:27:28] [INFO ] Computation of disable matrix completed :0/255 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.139317,21836,1,0,11674,171,2690,10835,261,228,22205
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-015-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(F(F((X("((i4.u6.p0_5!=0)&&(i14.u14.p1_13!=1))"))U("((i6.u20.flag_1_8==0)||(u8.p0_7==1))")))))))
Formula 2 simplified : !FGF(X"((i4.u6.p0_5!=0)&&(i14.u14.p1_13!=1))" U "((i6.u20.flag_1_8==0)||(u8.p0_7==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.148206,22384,1,0,12015,171,2898,11243,263,228,23159
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-015-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X(("((u10.flag_0_9==0)||(u12.p3_11==1))")U("(i12.u7.p1_6==1)")))||(G("((i6.u9.p1_8==0)||(u10.p1_9==1))"))))
Formula 3 simplified : !(X("((u10.flag_0_9==0)||(u12.p3_11==1))" U "(i12.u7.p1_6==1)") | G"((i6.u9.p1_8==0)||(u10.p1_9==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.163749,23220,1,0,12842,171,3156,12183,267,228,25780
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-015-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(("((u13.p1_12==0)||(i4.u5.flag_0_5==1))")U(G("((u13.p1_12!=0)&&(i4.u5.flag_0_5!=1))")))))
Formula 4 simplified : !F("((u13.p1_12==0)||(i4.u5.flag_0_5==1))" U G"((u13.p1_12!=0)&&(i4.u5.flag_0_5!=1))")
[2020-05-22 01:27:28] [INFO ] Computation of Complete disable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 01:27:28] [INFO ] Computing symmetric may enable matrix : 255 transitions.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 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.196498,24748,1,0,16388,171,3180,17355,268,228,33315
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-015-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(X(F(X("((u12.flag_0_11==0)||(u1.p0_1==1))")))))&&((("((u13.p3_12==0)||(i6.u20.p0_8==1))")U("((u12.flag_0_11==0)||(u1.p0_1==1))"))||(("((u12.flag_0_11==0)||(u1.p0_1==1))")U("((u13.p3_12==0)||(i6.u20.p0_8==1))")))))
Formula 5 simplified : !(!XFX"((u12.flag_0_11==0)||(u1.p0_1==1))" & (("((u13.p3_12==0)||(i6.u20.p0_8==1))" U "((u12.flag_0_11==0)||(u1.p0_1==1))") | ("((u12.flag_0_11==0)||(u1.p0_1==1))" U "((u13.p3_12==0)||(i6.u20.p0_8==1))")))
[2020-05-22 01:27:28] [INFO ] Computation of Complete enable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.211108,25392,1,0,17332,171,3383,18698,269,228,35897
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-015-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(("((i3.u17.p0_3==0)||(u10.p1_9==1))")U(X(("((i6.u9.p3_8==0)||(i11.u18.p0_4==1))")U(!(X("((i6.u9.p3_8!=0)&&(i11.u18.p0_4!=1))"))))))))
Formula 6 simplified : !F("((i3.u17.p0_3==0)||(u10.p1_9==1))" U X("((i6.u9.p3_8==0)||(i11.u18.p0_4==1))" U !X"((i6.u9.p3_8!=0)&&(i11.u18.p0_4!=1))"))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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.214038,25656,1,0,17333,171,3424,18699,270,228,35942
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Dekker-PT-015-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((X("((u15.flag_1_14==0)||(i12.u7.p1_6==1))"))||(X("((i14.u14.flag_0_13==0)||(u10.flag_0_9==1))")))||(G(F("((u2.p1_2!=0)&&(u1.p0_1!=1))")))))
Formula 7 simplified : !(X"((u15.flag_1_14==0)||(i12.u7.p1_6==1))" | X"((i14.u14.flag_0_13==0)||(u10.flag_0_9==1))" | GF"((u2.p1_2!=0)&&(u1.p0_1!=1))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.216041,25868,1,0,17333,171,3452,18706,272,228,35983
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Dekker-PT-015-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F(X(G(X(F(G("((((u2.p0_2!=0)&&(u1.flag_1_1!=1))&&(i0.u16.p3_0!=0))&&(u13.flag_0_12!=1))")))))))))
Formula 8 simplified : !GFXGXFG"((((u2.p0_2!=0)&&(u1.flag_1_1!=1))&&(i0.u16.p3_0!=0))&&(u13.flag_0_12!=1))"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.228983,26044,1,0,17579,171,3664,19040,272,228,36753
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-015-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(F(X(("(i13.u11.flag_0_10!=1)")U("((i12.u19.flag_1_6==0)||(i6.u9.flag_0_8==1))"))))))
Formula 9 simplified : !FX("(i13.u11.flag_0_10!=1)" U "((i12.u19.flag_1_6==0)||(i6.u9.flag_0_8==1))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.230704,26044,1,0,17583,171,3698,19045,272,228,36791
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Dekker-PT-015-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(!(X(F("((u1.flag_0_1!=0)&&(i4.u5.p1_5!=1))"))))))
Formula 10 simplified : !G!XF"((u1.flag_0_1!=0)&&(i4.u5.p1_5!=1))"
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.240863,26532,1,0,18399,171,3885,19898,273,228,39026
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-015-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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-22 01:27:28] [INFO ] Built C files in 658ms 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 1590110848665
--------------------
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="Dekker-PT-015"
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 Dekker-PT-015, 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 r066-tajo-158922814100313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-015.tgz
mv Dekker-PT-015 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 ;